Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
86 | Alberto Marcone |
Fine Analysis of the Quasi-Orderings on the Power Set. |
Order |
2001 |
DBLP DOI BibTeX RDF |
better quasi-ordering, wqo, well quasi-ordering |
38 | Parosh Aziz Abdulla, Aletta Nylén |
Better is Better than Well: On Efficient Verification of Infinite-State Systems. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
lossy channel systems, integral relational automata, model checking, Verification, timed Petri nets, infinite-state systems, broadcast protocols |
31 | Nachum Dershowitz, E. Castedo Ellerman |
Leanest Quasi-orderings. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Jean Goubault-Larrecq |
On Noetherian Spaces. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Daniela Bianucci, Gianpiero Cattaneo |
Information Entropy and Granulation Co-Entropy of Partitions and Coverings: A Summary. |
Trans. Rough Sets |
2009 |
DBLP DOI BibTeX RDF |
Measure distributions, partial partitions, co-entropy, isotonicity, anti-tonicity, partitions, entropy, partial ordering, probability distributions, coverings, quasi-ordering |
24 | Nick Bezhanishvili, Ian M. Hodkinson |
All Normal Extensions of S5-squared Are Finitely Axiomatizable. |
Stud Logica |
2004 |
DBLP DOI BibTeX RDF |
finite axiomatization, better-quasi-ordering, NP-complete, modal logic |
24 | Lars Lindahl, Jan Odelstad |
Normative Systems and their Revision: An Algebraic Approach. |
Artif. Intell. Law |
2003 |
DBLP DOI BibTeX RDF |
Alchourrón, Boolean quasi-ordering, Bulygin, connecting norm, defeasibility, norm revision, organic whole, normative system |
21 | Rohit Chadha, Mahesh Viswanathan 0001 |
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage. |
CONCUR |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Nathan J. Bowler, Yared Nigussie |
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture. |
J. Comb. Theory, Ser. B |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Maurice Pouzet |
Well-quasi-ordering and Embeddability of Relational Structures. |
Order |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Chun-Hung Liu, Irene Muzi |
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation. |
J. Comb. Theory, Ser. B |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Gregory A. McKay |
On Better-quasi-ordering Classes of Partial Orders. |
J. Multiple Valued Log. Soft Comput. |
2022 |
DBLP BibTeX RDF |
|
18 | Alberto Del Pia, Dion Gijswijt, Jeff T. Linderoth, Haoran Zhu |
Integer packing sets form a well-quasi-ordering. |
Oper. Res. Lett. |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma |
Clique-width and well-quasi-ordering of triangle-free graph classes. |
J. Comput. Syst. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Aistis Atminas, Robert Brignall |
Well-quasi-ordering and finite distinguishing number. |
J. Graph Theory |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen |
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
18 | Jaroslaw Blasiok, Marcin Kaminski 0001, Jean-Florent Raymond, Théophile Trunck |
Induced minors and well-quasi-ordering. |
J. Comb. Theory, Ser. B |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Florian Barbero, Christophe Paul, Michal Pilipczuk |
Strong immersion is a well-quasi-ordering for semicomplete digraphs. |
J. Graph Theory |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma |
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. |
Order |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Robert Brignall, Michael Engen, Vincent Vatter |
A Counterexample Regarding Labelled Well-Quasi-Ordering. |
Graphs Comb. |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck |
Well-quasi-ordering H-contraction-free graphs. |
Discret. Appl. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Vadim V. Lozin, Igor Razgon, Viktor Zamaraev |
Well-quasi-ordering versus clique-width. |
J. Comb. Theory, Ser. B |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Florian Barbero, Christophe Paul, Michal Pilipczuk |
Strong immersion is a well-quasi-ordering for semi-complete digraphs. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
18 | Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma |
Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
18 | Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma |
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. |
WG |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma |
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
18 | Marcin Kaminski 0001, Jean-Florent Raymond, Théophile Trunck |
Well-quasi-ordering H-contraction-free graphs. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
18 | Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma |
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. |
IWOCA |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Jaroslaw Blasiok, Marcin Kaminski 0001, Jean-Florent Raymond, Théophile Trunck |
Induced minors and well-quasi-ordering. |
Electron. Notes Discret. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Aistis Atminas, Vadim V. Lozin |
Labelled Induced Subgraphs and Well-Quasi-Ordering. |
Order |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Vadim V. Lozin, Igor Razgon, Victor Zamaraev |
Well-quasi-ordering does not imply bounded clique-width. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
18 | Jaroslaw Blasiok, Marcin Kaminski 0001, Jean-Florent Raymond, Théophile Trunck |
Induced minors and well-quasi-ordering. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
18 | Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho |
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
18 | Vadim V. Lozin, Igor Razgon, Victor Zamaraev |
Well-quasi-ordering Does Not Imply Bounded Clique-width. |
WG |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Alberto Policriti, Alexandru I. Tomescu |
Well-quasi-ordering hereditarily finite sets. |
Int. J. Comput. Math. |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Mamadou Moustapha Kanté |
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Sang-il Oum |
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). |
Electron. Notes Discret. Math. |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Mamadou Moustapha Kanté |
Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs. |
CoRR |
2011 |
DBLP BibTeX RDF |
|
18 | Nicholas Korpelainen, Vadim V. Lozin |
Two forbidden induced subgraphs and well-quasi-ordering. |
Discret. Math. |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Nicholas Korpelainen, Vadim V. Lozin |
Bipartite induced subgraphs and well-quasi-ordering. |
J. Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Alberto Policriti, Alexandru I. Tomescu |
Well-Quasi-Ordering Hereditarily Finite Sets. |
LATA |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Sang-il Oum |
Rank-Width and Well-Quasi-Ordering. |
SIAM J. Discret. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Miguel Couceiro, Maurice Pouzet |
On a quasi-ordering on Boolean functions. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Sang-il Oum |
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract). |
Electron. Notes Discret. Math. |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Neil Robertson 0001, Paul D. Seymour |
Graph Minors. XIX. Well-quasi-ordering on a surface. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Neil Robertson 0001, Paul D. Seymour |
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
18 | James F. Geelen, A. M. H. Gerards, Geoff Whittle |
Branch-Width and Well-Quasi-Ordering in Matroids and Graphs. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Giuliano Pacini, Maria I. Sessa |
Loop checking in SLD-derivations by well-quasi-ordering of goals. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Jens Gustedt |
Well Quasi Ordering Finite Posets and Formal Languages. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Guoli Ding |
Subgraphs and well-quasi-ordering. |
J. Graph Theory |
1992 |
DBLP DOI BibTeX RDF |
|
18 | Jens Gustedt |
Well-quasi-ordering finite posets. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
18 | Alain Louveau, Jean Saint-Raymond |
On the Quasi-Ordering of Borel Linear Orders under Embeddability. |
J. Symb. Log. |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Igor Kríz, Robin Thomas 0001 |
On well-quasi-ordering finite structures with labels. |
Graphs Comb. |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Neil Robertson 0001, Paul D. Seymour |
Graph minors. IV. Tree-width and well-quasi-ordering. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Peter Damaschke |
Induced subgraphs and well-quasi-ordering. |
J. Graph Theory |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Ulrich Bollerhoff |
On Well-quasi-ordering Finite Sequences. |
Eur. J. Comb. |
1989 |
DBLP DOI BibTeX RDF |
|
18 | Pierre Lescanne |
Well quasi-ordering in a paper by Maurice Janet. |
Bull. EATCS |
1989 |
DBLP BibTeX RDF |
|
18 | Thomas Andreae |
On well-quasi-ordering finite graphs by immersion. |
Comb. |
1986 |
DBLP DOI BibTeX RDF |
|
18 | E. Corominas |
On better quasi-ordering countable trees. |
Discret. Math. |
1985 |
DBLP DOI BibTeX RDF |
|
18 | Robin Thomas 0001 |
Graphs without K4 and well-quasi-ordering. |
J. Comb. Theory, Ser. B |
1985 |
DBLP DOI BibTeX RDF |
|
18 | Joseph B. Kruskal |
The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept. |
J. Comb. Theory, Ser. A |
1972 |
DBLP DOI BibTeX RDF |
|
16 | Daniela Bianucci, Gianpiero Cattaneo |
Monotonic Behavior of Entropies and Co-entropies for Coverings with Respect to Different Quasi-orderings. |
RSEISP |
2007 |
DBLP DOI BibTeX RDF |
|
10 | Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric Haziza, Ahmed Rezine |
Monotonic Abstraction for Programs with Dynamic Memory Heaps. |
CAV |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Roland Meyer 0001 |
On Boundedness in Depth in the pi-Calculus. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Laura Bozzelli, Régis Gascon |
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints. |
LPAR |
2006 |
DBLP DOI BibTeX RDF |
|
10 | Michael R. Fellows |
A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
10 | Zhenghong Deng 0001, Wei Zheng, Fang Wang, Zhengguo Hu |
Research and implementation of management software for SAN based on clustering technology. |
VRCAI |
2004 |
DBLP DOI BibTeX RDF |
clustering technology, related backup task, virtual storage, SAN |
10 | Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso |
Deciding Monotonic Games. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
10 | Floriana Esposito, Angela Laterza, Donato Malerba, Giovanni Semeraro |
Locally Finite, Proper and Complete Operators for Refining Datalog Programs. |
ISMIS |
1996 |
DBLP DOI BibTeX RDF |
|
10 | Hans Leiß |
Bounded Fixed-Point Definability and Tabular Recognition of Languages. |
CSL |
1995 |
DBLP DOI BibTeX RDF |
|
10 | Masahiko Tsukamoto, Shojiro Nishio, Mitsuhiko Fujio |
DOT: A Term Reprentation using DOT Algebra for Knowledge-bases. |
DOOD |
1991 |
DBLP DOI BibTeX RDF |
|