Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
86 | Alberto Marcone |
Fine Analysis of the Quasi-Orderings on the Power Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(4), pp. 339-347, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 132-140, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 32-45, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Jean Goubault-Larrecq |
On Noetherian Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pp. 453-462, 2007, IEEE Computer Society, 0-7695-2908-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Daniela Bianucci, Gianpiero Cattaneo |
Information Entropy and Granulation Co-Entropy of Partitions and Coverings: A Summary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Transactions on Rough Sets X, pp. 15-66, 2009, Springer, 978-3-642-03280-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 78(3), pp. 443-457, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. Law ![In: Artif. Intell. Law 11(2-3), pp. 81-104, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings, pp. 136-150, 2007, Springer, 978-3-540-74406-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 164, pp. 222-244, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Maurice Pouzet |
Well-quasi-ordering and Embeddability of Relational Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 41(1), pp. 183-278, April 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 158(Part), pp. 210-251, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Gregory A. McKay |
On Better-quasi-ordering Classes of Partial Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Multiple Valued Log. Soft Comput. ![In: J. Multiple Valued Log. Soft Comput. 39(1), pp. 27-78, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
18 | Alberto Del Pia, Dion Gijswijt, Jeff T. Linderoth, Haoran Zhu |
Integer packing sets form a well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 49(2), pp. 226-230, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 108, pp. 64-91, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Aistis Atminas, Robert Brignall |
Well-quasi-ordering and finite distinguishing number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 95(1), pp. 5-26, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.10703, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Jaroslaw Blasiok, Marcin Kaminski 0001, Jean-Florent Raymond, Théophile Trunck |
Induced minors and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 134, pp. 110-142, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Florian Barbero, Christophe Paul, Michal Pilipczuk |
Strong immersion is a well-quasi-ordering for semicomplete digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 90(4), pp. 484-496, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 35(2), pp. 253-274, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Robert Brignall, Michael Engen, Vincent Vatter |
A Counterexample Regarding Labelled Well-Quasi-Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 34(6), pp. 1395-1409, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck |
Well-quasi-ordering H-contraction-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 248, pp. 18-27, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Vadim V. Lozin, Igor Razgon, Viktor Zamaraev |
Well-quasi-ordering versus clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 130, pp. 1-18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Florian Barbero, Christophe Paul, Michal Pilipczuk |
Strong immersion is a well-quasi-ordering for semi-complete digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.03563, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1711.08837, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, pp. 220-233, 2017, Springer, 978-3-319-68704-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.03671, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Marcin Kaminski 0001, Jean-Florent Raymond, Théophile Trunck |
Well-quasi-ordering H-contraction-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.00733, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, pp. 253-265, 2016, Springer, 978-3-319-44542-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Jaroslaw Blasiok, Marcin Kaminski 0001, Jean-Florent Raymond, Théophile Trunck |
Induced minors and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 49, pp. 197-201, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Aistis Atminas, Vadim V. Lozin |
Labelled Induced Subgraphs and Well-Quasi-Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 32(3), pp. 313-328, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Vadim V. Lozin, Igor Razgon, Victor Zamaraev |
Well-quasi-ordering does not imply bounded clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.00571, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
18 | Jaroslaw Blasiok, Marcin Kaminski 0001, Jean-Florent Raymond, Théophile Trunck |
Induced minors and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1510.07135, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.01628, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
18 | Vadim V. Lozin, Igor Razgon, Victor Zamaraev |
Well-quasi-ordering Does Not Imply Bounded Clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, pp. 351-359, 2015, Springer, 978-3-662-53173-0. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Alberto Policriti, Alexandru I. Tomescu |
Well-quasi-ordering hereditarily finite sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 90(6), pp. 1278-1291, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Mamadou Moustapha Kanté |
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 33(8), pp. 1820-1841, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Sang-il Oum |
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 38, pp. 693-698, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Mamadou Moustapha Kanté |
Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1102.2134, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
18 | Nicholas Korpelainen, Vadim V. Lozin |
Two forbidden induced subgraphs and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 311(16), pp. 1813-1822, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Nicholas Korpelainen, Vadim V. Lozin |
Bipartite induced subgraphs and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 67(3), pp. 235-249, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Alberto Policriti, Alexandru I. Tomescu |
Well-Quasi-Ordering Hereditarily Finite Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings, pp. 440-451, 2011, Springer, 978-3-642-21253-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Sang-il Oum |
Rank-Width and Well-Quasi-Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 22(2), pp. 666-682, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Miguel Couceiro, Maurice Pouzet |
On a quasi-ordering on Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 396(1-3), pp. 71-87, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Sang-il Oum |
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 22, pp. 281-285, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Neil Robertson 0001, Paul D. Seymour |
Graph Minors. XIX. Well-quasi-ordering on a surface. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 90(2), pp. 325-385, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Neil Robertson 0001, Paul D. Seymour |
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 89(1), pp. 77-108, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 84(2), pp. 270-290, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Giuliano Pacini, Maria I. Sessa |
Loop checking in SLD-derivations by well-quasi-ordering of goals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 238(1-2), pp. 221-246, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Jens Gustedt |
Well Quasi Ordering Finite Posets and Formal Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 65(1), pp. 111-124, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Guoli Ding |
Subgraphs and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 16(5), pp. 489-502, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
18 | Jens Gustedt |
Well-quasi-ordering finite posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Structure Theory ![In: Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA, pp. 511-515, 1991, American Mathematical Society, 0-8218-5160-8. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP BibTeX RDF |
|
18 | Alain Louveau, Jean Saint-Raymond |
On the Quasi-Ordering of Borel Linear Orders under Embeddability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 55(2), pp. 537-560, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Igor Kríz, Robin Thomas 0001 |
On well-quasi-ordering finite structures with labels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 6(1), pp. 41-49, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Neil Robertson 0001, Paul D. Seymour |
Graph minors. IV. Tree-width and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 48(2), pp. 227-254, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Peter Damaschke |
Induced subgraphs and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 14(4), pp. 427-435, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Ulrich Bollerhoff |
On Well-quasi-ordering Finite Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 10(3), pp. 227-230, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
18 | Pierre Lescanne |
Well quasi-ordering in a paper by Maurice Janet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. EATCS ![In: Bull. EATCS 39, pp. 185-188, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP BibTeX RDF |
|
18 | Thomas Andreae |
On well-quasi-ordering finite graphs by immersion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 6(4), pp. 287-298, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
18 | E. Corominas |
On better quasi-ordering countable trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 53, pp. 35-53, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
18 | Robin Thomas 0001 |
Graphs without K4 and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 38(3), pp. 240-247, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
18 | Joseph B. Kruskal |
The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 13(3), pp. 297-305, 1972. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSEISP ![In: Rough Sets and Intelligent Systems Paradigms, International Conference, RSEISP 2007, Warsaw, Poland, June 28-30, 2007, Proceedings, pp. 584-593, 2007, Springer, 978-3-540-73450-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 20th International Conference, CAV 2008, Princeton, NJ, USA, July 7-14, 2008, Proceedings, pp. 341-354, 2008, Springer, 978-3-540-70543-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Roland Meyer 0001 |
On Boundedness in Depth in the pi-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy, pp. 477-489, 2008, Springer, 978-0-387-09679-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Laura Bozzelli, Régis Gascon |
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 197-211, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 1-2, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VRCAI ![In: Proceedings VRCAI 2004, ACM SIGGRAPH International Conference on Virtual Reality Continuum and its Applications in Industry, Nanyang Technological University, Singapore, June 16-18, 2004, pp. 463-466, 2004, ACM, 1-58113-884-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 1-14, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
10 | Floriana Esposito, Angela Laterza, Donato Malerba, Giovanni Semeraro |
Locally Finite, Proper and Complete Operators for Refining Datalog Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 9th International Symposium, ISMIS '96, Zakopane, Poland, June 9-13, 1996, Proceedings, pp. 468-478, 1996, Springer, 3-540-61286-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
10 | Hans Leiß |
Bounded Fixed-Point Definability and Tabular Recognition of Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 9th International Workshop, CSL '95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers, pp. 388-402, 1995, Springer, 3-540-61377-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
10 | Masahiko Tsukamoto, Shojiro Nishio, Mitsuhiko Fujio |
DOT: A Term Reprentation using DOT Algebra for Knowledge-bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DOOD ![In: Deductive and Object-Oriented Databases, Second International Conference, DOOD'91, Munich, Germany, December 16-18, 1991, Proceedings, pp. 391-410, 1991, Springer, 3-540-55015-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|