Jaroslav Nesetril

Antonín Kucera, Thomas A. Henzinger, Jaroslav Nesetril, Tomás Vojnar, David Antos (Eds.): Mathematical and Engineering Methods in Computer Science, 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7721, Springer 2013, isbn 978-3-642-36044-2

Jaroslav Nesetril, Patrice Ossona de Mendez: Sparsity - Graphs, Structures, and Algorithms. Algorithms and combinatorics 28, Springer 2012, isbn 978-3-642-27874-7, pp. I-XXIII, 1-457

Pavol Hell, Wilfried Imrich, Jaroslav Nesetril: Preface. Discrete Mathematics 312(1): 1 (2012)

A. Machì, Jaroslav Nesetril, Patrice Ossona de Mendez, Jorge L. Ramírez Alfonsín: Preface. Eur. J. Comb. 33(3): 277-278 (2012)

Jaroslav Nesetril, Patrice Ossona de Mendez, David R. Wood: Characterisations and examples of graph classes with bounded expansion. Eur. J. Comb. 33(3): 350-373 (2012)

Jaroslav Nesetril, André Raspaud: Preface. Eur. J. Comb. 33(5): 685-687 (2012)

Jaroslav Nesetril, Robert Sámal: Tension continuous maps - Their structure and applications. Eur. J. Comb. 33(6): 1207-1225 (2012)

Jaroslav Nesetril, Yared Nigussie: Finite dualities and map-critical graphs on a fixed surface. J. Comb. Theory, Ser. B 102(1): 131-152 (2012)

Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai: When Trees Grow Low: Shrubs and Fast MSO1. MFCS 2012: 419-430

Josep Díaz, Jaroslav Nesetril: Introduction. Computer Science Review 5(1): 1 (2011)

Jaroslav Nesetril, Patrice Ossona de Mendez: On nowhere dense graphs. Eur. J. Comb. 32(4): 600-617 (2011)

László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver: Preface. Eur. J. Comb. 32(7): 951-953 (2011)

Jan Foniok, Jaroslav Nesetril, Claude Tardif: Interleaved adjoints of directed graphs. Eur. J. Comb. 32(7): 1018-1024 (2011)

Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril: Distinguishing graphs by their left and right homomorphism profiles. Eur. J. Comb. 32(7): 1025-1053 (2011)

Jaroslav Nesetril, Patrice Ossona de Mendez: How many F's are there in G? Eur. J. Comb. 32(7): 1126-1141 (2011)

Jarik Nesetril, Ervin Györi, Attila Sali: Preface. Electronic Notes in Discrete Mathematics 38: 1-3 (2011)

Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril: Contractors for flows. Electronic Notes in Discrete Mathematics 38: 389-394 (2011)

Jan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek: Preface. Discrete Mathematics 310(3): 371-372 (2010)

John Gimbel, Jaroslav Nesetril: Partitions of graphs into cographs. Discrete Mathematics 310(24): 3437-3445 (2010)

Richard N. Ball, Jaroslav Nesetril, Ales Pultr: Dualities in full homomorphisms. Eur. J. Comb. 31(1): 106-119 (2010)

Jaroslav Nesetril, Mark H. Siggers, László Zádori: A combinatorial constraint satisfaction problem dichotomy classification conjecture. Eur. J. Comb. 31(1): 280-296 (2010)

Erkko Lehtonen, Jaroslav Nesetril: Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms. Eur. J. Comb. 31(8): 1981-1995 (2010)

Jaroslav Nesetril, Claude Tardif: Path homomorphisms, graph colorings, and boolean matrices. Journal of Graph Theory 63(3): 198-209 (2010)

Jaroslav Nesetril, Tomás Valla: On Ramsey-type positional games. Journal of Graph Theory 64(4): 343-354 (2010)

Jaroslav Nesetril, Patrice Ossona de Mendez: First order properties on nowhere dense structures. J. Symb. Log. 75(3): 868-887 (2010)

Jan Foniok, Jaroslav Nesetril, Ales Pultr, Claude Tardif: Dualities and Dual Pairs in Heyting Algebras. Order 27(3): 327-342 (2010)

Jirí Matousek, Jaroslav Nesetril: Invitation to Discrete Mathematics (2. ed.). Oxford University Press 2009, isbn 978-0-19-857042-4, pp. I-XVII, 1-443

Josep Díaz, Jarik Nesetril: Introduction. Computer Science Review 3(2): 53 (2009)

Jaroslav Nesetril: A surprising permanence of old motivations (a not-so-rigid story). Discrete Mathematics 309(18): 5510-5526 (2009)

Alberto Márquez, Jaroslav Nesetril, Oriol Serra: Preface. Eur. J. Comb. 30(7): 1565-1567 (2009)

Delia Garijo, Jaroslav Nesetril, Maria Pastora Revuelta Marchena: Homomorphisms and polynomial invariants of graphs. Eur. J. Comb. 30(7): 1659-1675 (2009)

Jaroslav Nesetril, Patrice Ossona de Mendez: Fraternal augmentations, arrangeability and linear Ramsey numbers. Eur. J. Comb. 30(7): 1696-1703 (2009)

Jaroslav Nesetril, André Raspaud: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). Electronic Notes in Discrete Mathematics 34: 1-8 (2009)

Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril: Graph homomorphisms, the Tutte polynomial and "q-state Potts uniqueness". Electronic Notes in Discrete Mathematics 34: 231-236 (2009)

Jaroslav Nesetril, Patrice Ossona de Mendez: Counting Homomorphisms to Sparse Graphs. Electronic Notes in Discrete Mathematics 34: 393-397 (2009)

Pavol Hell, Jaroslav Nesetril: Colouring, constraint satisfaction, and complexity. Computer Science Review 2(3): 143-163 (2008)

Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril: Preface. Discrete Mathematics 308(8): 1347-1349 (2008)

Jaroslav Nesetril, Claude Tardif: A dualistic approach to bounding the chromatic number of a graph. Eur. J. Comb. 29(1): 254-260 (2008)

Jaroslav Nesetril, Patrice Ossona de Mendez: Grad and classes with bounded expansion I. Decompositions. Eur. J. Comb. 29(3): 760-776 (2008)

Jaroslav Nesetril, Patrice Ossona de Mendez: Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb. 29(3): 777-791 (2008)

Jaroslav Nesetril, Oriol Serra: Preface. Eur. J. Comb. 29(4): 793-795 (2008)

Jan Foniok, Jaroslav Nesetril, Claude Tardif: Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. Eur. J. Comb. 29(4): 881-899 (2008)

Gábor Kun, Jaroslav Nesetril: Forbidden lifts (NP and CSP for combinatorialists). Eur. J. Comb. 29(4): 930-945 (2008)

Jaroslav Nesetril, Patrice Ossona de Mendez: Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. Eur. J. Comb. 29(4): 1012-1024 (2008)

Jaroslav Nesetril, Robert Sámal: On tension-continuous mappings. Eur. J. Comb. 29(4): 1025-1054 (2008)

Jaroslav Nesetril: Structural Properties of Sparse Graphs. Electronic Notes in Discrete Mathematics 31: 247-251 (2008)

Jaroslav Nesetril: Many Facets of Dualities. Bonn Workshop of Combinatorial Optimization 2008: 285-302

Josep Díaz, Jaroslav Nesetril: Introduction. Computer Science Review 1(1): 1 (2007)

Jaroslav Nesetril, Martin Bálek: Preface. Discrete Mathematics 307(16): 1969-1971 (2007)

Jaroslav Nesetril: Metric spaces are Ramsey. Eur. J. Comb. 28(1): 457-468 (2007)

Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril: Editorial. Eur. J. Comb. 28(8): 2053-2056 (2007)

Jaroslav Nesetril, Patrice Ossona de Mendez: Fraternal Augmentations of graphs, Coloration and Minors. Electronic Notes in Discrete Mathematics 28: 223-230 (2007)

Alberto Márquez, Jarik Nesetril, Oriol Serra: Preface. Electronic Notes in Discrete Mathematics 29: 1-2 (2007)

Gábor Kun, Jaroslav Nesetril: NP for Combinatorialists. Electronic Notes in Discrete Mathematics 29: 373-381 (2007)

Jan Foniok, Jaroslav Nesetril, Claude Tardif: On Finite Maximal Antichains in the Homomorphism Order. Electronic Notes in Discrete Mathematics 29: 389-396 (2007)

Delia Garijo, Jaroslav Nesetril, M. P. Revuelta: Homomorphisms and Polynomial Invariants of Graphs. Electronic Notes in Discrete Mathematics 29: 539-545 (2007)

Jaroslav Nesetril, Yared Nigussie: Finite duality for some minor closed classes. Electronic Notes in Discrete Mathematics 29: 579-585 (2007)

Jaroslav Nesetril, Yared Nigussie: Density of universal classes of series-parallel graphs. Journal of Graph Theory 54(1): 13-23 (2007)

Jaroslav Nesetril, Ida Svejdarová: Small Diameters of Duals. SIAM J. Discrete Math. 21(2): 374-384 (2007)

Jaroslav Nesetril, Mark H. Siggers: Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. MFCS 2007: 159-170

Gábor Kun, Jaroslav Nesetril: NP by Means of Lifts and Shadows. MFCS 2007: 171-181

Gábor Kun, Jaroslav Nesetril: NP by means of lifts and shadows. CoRR abs/0706.3459 (2007)

Jaroslav Nesetril: Ramsey classes of topological and metric spaces. Ann. Pure Appl. Logic 143(1-3): 147-154 (2006)

Peter J. Cameron, Jaroslav Nesetril: Homomorphism-Homogeneous Relational Structures. Combinatorics, Probability & Computing 15(1-2): 91-103 (2006)

Timothy Marshall, Reza Nasraser, Jaroslav Nesetril: Homomorphism bounded classes of graphs. Eur. J. Comb. 27(4): 592-600 (2006)

Jaroslav Nesetril, Patrice Ossona de Mendez: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6): 1022-1041 (2006)

Jaroslav Nesetril: Preface. Eur. J. Comb. 27(7): 1055-1058 (2006)

Winfried Hochstättler, Jaroslav Nesetril: Antisymmetric flows in matroids. Eur. J. Comb. 27(7): 1129-1134 (2006)

Tomasz Luczak, Jaroslav Nesetril: When is a random graph projective? Eur. J. Comb. 27(7): 1147-1154 (2006)

Jaroslav Nesetril, Yared Nigussie: Minimal universal and dense minor closed classes. Eur. J. Comb. 27(7): 1159-1171 (2006)

Jaroslav Nesetril, Patrice Ossona de Mendez: Folding. J. Comb. Theory, Ser. B 96(5): 730-739 (2006)

Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16(3): 359-373 (2006)

Tomasz Luczak, Jaroslav Nesetril: A Probabilistic Approach to the Dichotomy Problem. SIAM J. Comput. 36(3): 835-843 (2006)

Jaroslav Nesetril, Patrice Ossona de Mendez: Linear time low tree-width partitions and algorithmic consequences. STOC 2006: 391-400

Jan Foniok, Jaroslav Nesetril, Claude Tardif: Generalised Dualities and Finite Maximal Antichains. WG 2006: 27-36

Jaroslav Nesetril: Ramsey Classes and Homogeneous Structures. Combinatorics, Probability & Computing 14(1-2): 171-189 (2005)

Shalom Eliahou, Isidoro Gitler, Jaroslav Nesetril: Foreword. Discrete Mathematics 302(1-3): 1-3 (2005)

Jaroslav Nesetril, Patrice Ossona de Mendez: Cuts and bounds. Discrete Mathematics 302(1-3): 211-224 (2005)

Jan Hubicka, Jaroslav Nesetril: Universal partial order represented by means of oriented trees and other simple graphs. Eur. J. Comb. 26(5): 765-778 (2005)

Jaroslav Nesetril, Patrice Ossona de Mendez: The Grad of a Graph and Classes with Bounded Expansion. Electronic Notes in Discrete Mathematics 22: 101-106 (2005)

Jaroslav Nesetril, Nicholas C. Wormald: The acyclic edge chromatic number of a random d-regular graph is d + 1. Journal of Graph Theory 49(1): 69-74 (2005)

Jan Hubicka, Jaroslav Nesetril: Finite Paths are Universal. Order 22(1): 21-40 (2005)

Jaroslav Nesetril, Claude Tardif: Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. SIAM J. Discrete Math. 19(4): 914-920 (2005)

Jaroslav Nesetril, Gerhard J. Woeginger: Graph colorings. Theor. Comput. Sci. 349(1): 1 (2005)

Matt DeVos, Jaroslav Nesetril, André Raspaud: Antisymmetric flows and edge-connectivity. Discrete Mathematics 276(1-3): 161-167 (2004)

Jana Maxová, Jaroslav Nesetril: On covers of graphs. Discrete Mathematics 276(1-3): 287-294 (2004)

Jaroslav Nesetril, Xuding Zhu: On sparse graphs with given colorings and homomorphisms. J. Comb. Theory, Ser. B 90(1): 161-172 (2004)

Tomasz Luczak, Jaroslav Nesetril: Note on projective graphs. Journal of Graph Theory 47(2): 81-86 (2004)

Jan Hubicka, Jaroslav Nesetril: Finite Paths are Universal. Order 21(3): 181-200 (2004)

Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic: Rainbow Arithmetic Progressions and Anti-Ramsey Results. Combinatorics, Probability & Computing 12(5-6): 599-620 (2003)

Jaroslav Nesetril, Marc Noy, Oriol Serra: Foreword. Discrete Mathematics 273(1-3): 1-6 (2003)

Martin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on random homomorphism from arbitrary graphs to Z. Discrete Mathematics 273(1-3): 173-181 (2003)

Jaroslav Nesetril, Claude Tardif: On maximal finite antichains in the homomorphism order of directed graphs. Discussiones Mathematicae Graph Theory 23(2): 325-332 (2003)

Jaroslav Nesetril, Saharon Shelah: On the order of countable graphs. Eur. J. Comb. 24(6): 649-663 (2003)

Manuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. CSL 2003: 44-57

Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)

Paul A. Dreyer Jr., Christopher Malon, Jaroslav Nesetril: Universal H-colorable graphs without a given configuration. Discrete Mathematics 250(1-3): 245-252 (2002)

Alexandr V. Kostochka, Jaroslav Nesetril: Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions. Eur. J. Comb. 23(1): 37-41 (2002)

John Gimbel, Jaroslav Nesetril: Partitions of Graphs into Cographs. Electronic Notes in Discrete Mathematics 11: 705-721 (2002)

Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory, Ser. B 86(1): 100-108 (2002)

Jaroslav Nesetril: Art of Graph Drawing and Art. J. Graph Algorithms Appl. 6(1): 131-147 (2002)

Jaroslav Nesetril: A rigid graph for every set. Journal of Graph Theory 39(2): 108-110 (2002)

Jaroslav Nesetril: Preface. Theor. Comput. Sci. 287(2): 355-357 (2002)

Jaroslav Nesetril, Claude Tardif: Density via duality. Theor. Comput. Sci. 287(2): 585-591 (2002)

Jana Maxová, Jaroslav Nesetril: Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. ESA 2002: 711-722

Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos: H-Colorings of Large Degree Graphs. EurAsia-ICT 2002: 850-857

Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79

Jaroslav Nesetril, Eric Sopena: On the Oriented Game Chromatic Number. Electr. J. Comb. 8(2) (2001)

Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril: DIMATIA surveys (related to the Fifth Czech and Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications held in Prague on July 6-11, 1998). Discrete Mathematics 229(1-3): 1-2 (2001)

Jaroslav Nesetril, Moshe Rosenfeld: I. Schur, C.E. Shannon and Ramsey Numbers, a short story. Discrete Mathematics 229(1-3): 185-195 (2001)

Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril: Foreword. Discrete Mathematics 233(1-3): 1-2 (2001)

Jaroslav Nesetril, Eva Milková, Helena Nesetrilová: Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history. Discrete Mathematics 233(1-3): 3-36 (2001)

Alexandr V. Kostochka, Jaroslav Nesetril, P. Smolíková: Colorings and homomorphisms of degenerate and bounded degree graphs. Discrete Mathematics 233(1-3): 257-276 (2001)

Jaroslav Nesetril, Xuding Zhu: Construction of sparse graphs with prescribed circular colorings. Discrete Mathematics 233(1-3): 277-291 (2001)

Jana Maxová, Jaroslav Nesetril: On oriented path double covers. Discrete Mathematics 233(1-3): 371-380 (2001)

Bernhard Korte, Jaroslav Nesetril: Vojtech Jarni'k's work in combinatorial optimization. Discrete Mathematics 235(1-3): 1-17 (2001)

Jaroslav Nesetril, Ales Pultr: A note on homomorphism-independent families. Discrete Mathematics 235(1-3): 327-334 (2001)

Petr Pancoska, Vi't Janota, Jaroslav Nesetril: Novel matrix descriptor for determination of the connectivity of secondary structure segments in proteins. Analysis of general properties using graph theory. Discrete Mathematics 235(1-3): 399-423 (2001)

Jaroslav Nesetril, Marc Noy, Oriol Serra: Preface: Volume 10. Electronic Notes in Discrete Mathematics 10: 1 (2001)

Martin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on Random Homomorphism from ArbitraryGraphs to Z. Electronic Notes in Discrete Mathematics 10: 176-180 (2001)

Jan Adamec, Jaroslav Nesetril: Towards an Aesthetic Invariant for Graph Drawing. Graph Drawing 2001: 287-296

Anna Galluccio, Pavol Hell, Jaroslav Nesetril: The complexity of H-colouring of bounded degree graphs. Discrete Mathematics 222(1-3): 101-109 (2000)

Jana Maxová, Jaroslav Nesetril: On covers of graphs. Electronic Notes in Discrete Mathematics 5: 222-224 (2000)

Jaroslav Nesetril, Claude Tardif: Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). J. Comb. Theory, Ser. B 80(1): 80-97 (2000)

Jaroslav Nesetril, André Raspaud: Colored Homomorphisms of Colored Mixed Graphs. J. Comb. Theory, Ser. B 80(1): 147-155 (2000)

Alexandr V. Kostochka, Jaroslav Nesetril: Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. Combinatorics, Probability & Computing 8(5): 467-472 (1999)

Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: On the maximum average degree and the oriented chromatic number of a graph. Discrete Mathematics 206(1-3): 77-89 (1999)

Jaroslav Nesetril: Art of Drawing. Graph Drawing 1999: 267-275

Jaroslav Nesetril (Ed.): Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings. Lecture Notes in Computer Science 1643, Springer 1999, isbn 3-540-66251-0

Jirí Matousek, Jaroslav Nesetril: Invitation to discrete mathematics. Oxford University Press 1998, isbn 978-0-19-850207-4, pp. I-XV, 1-410

Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: On universal graphs for planar oriented graphs of a given girth. Discrete Mathematics 188(1-3): 73-85 (1998)

Alexandr V. Kostochka, Jaroslav Nesetril: Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth. Eur. J. Comb. 19(1): 103-110 (1998)

Jaroslav Nesetril, Pavel Valtr: A Ramsey Property of Order Types. J. Comb. Theory, Ser. A 81(1): 88-107 (1998)

Jarik Nesetril, André Raspaud, Eric Sopena: Colorings and girth of oriented planar graphs. Discrete Mathematics 165-166: 519-530 (1997)

Martin Loebl, Jaroslav Nesetril: Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. J. Algorithms 23(2): 207-220 (1997)

Jaroslav Nesetril, Daniel Turzík: Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP). SOFSEM 1997: 70-85

Pavol Hell, Jaroslav Nesetril, Xuding Zhu: Complexity of Tree Homomorphisms. Discrete Applied Mathematics 70(1): 23-36 (1996)

Pavol Gvozdjak, Jaroslav Nesetril: High girth and extendability. Discrete Mathematics 154(1-3): 77-84 (1996)

Jaroslav Nesetril, Xuding Zhu: On bounded treewidth duality of graphs. Journal of Graph Theory 23(2): 151-162 (1996)

Jaroslav Nesetril, Pavel Valtr: A Ramsey-type Theorem in the Plane. Combinatorics, Probability & Computing 3: 127-135 (1994)

Jaroslav Nesetril: on ordered Graphs and Graph orderings. Discrete Applied Mathematics 51(1-2): 113-116 (1994)

Jaroslav Nesetril, Vojtech Rödl: On Ramsey graphs without bipartite subgraphs. Discrete Mathematics 101(1-3): 223-229 (1992)

Jaroslav Nesetril: Z. Frolík and his winter schools. Discrete Mathematics 108(1-3): 1-2 (1992)

Wilfried Imrich, Jaroslav Nesetril: Simple tournaments and sharply transitive groups. Discrete Mathematics 108(1-3): 159-165 (1992)

Pavol Hell, Jaroslav Nesetril: The core of a graph. Discrete Mathematics 109(1-3): 117-126 (1992)

Jaroslav Nesetril, Gert Sabidussi: Minimal asymmetric graphs of induced length 4. Graphs and Combinatorics 8(4): 343-359 (1992)

Graham Brightwell, Jaroslav Nesetril: Reorientations of covering graphs. Discrete Mathematics 88(2-3): 129-132 (1991)

Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril: Noncrossing Subgraphs in Topological Layouts. SIAM J. Discrete Math. 4(2): 223-244 (1991)

Peter Alles, Jaroslav Nesetril, Svatopluk Poljak: Extendability, Dimensions, and Diagrams of Cycle Orders. SIAM J. Discrete Math. 4(4): 453-471 (1991)

Pavol Hell, Jaroslav Nesetril: On the complexity of H-coloring. J. Comb. Theory, Ser. B 48(1): 92-110 (1990)

Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo: On Locally Presented Posets. Theor. Comput. Sci. 70(2): 251-260 (1990)

Jaroslav Nesetril, Vojtech Rödl: The partite construction and ramsey set systems. Discrete Mathematics 75(1-3): 327-334 (1989)

Jaroslav Nesetril: For graphs there are only four types of hereditary Ramsey classes. J. Comb. Theory, Ser. B 46(2): 127-132 (1989)

Jaroslav Nesetril, Vojtech Rödl: Chromatically optimal rigid graphs. J. Comb. Theory, Ser. B 46(2): 133-141 (1989)

C. D. Godsil, Richard J. Nowakowski, Jaroslav Nesetril: The chromatic connectivity of graphs. Graphs and Combinatorics 4(1): 229-233 (1988)

Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril: Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory, Ser. A 49(1): 129-144 (1988)

Martin Loebl, Jaroslav Nesetril: Postorder Hierarchy for Path Compressions and Set Union. IMYCS 1988: 146-151

Martin Loebl, Jaroslav Nesetril: Linearity and Unprovability of Set Union Problem Strategies. STOC 1988: 360-366

András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza: Local k-colorings of graphs and hypergraphs. J. Comb. Theory, Ser. B 43(2): 127-139 (1987)

Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo: Posets, Boolean Representations and Quick Path Searching. ICALP 1987: 404-424

Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo: Efficient Representation of Taxonomies. TAPSOFT, Vol.1 1987: 232-240

Jaroslav Nesetril, Vojtech Rödl: On sets of integers with the Schur property. Graphs and Combinatorics 2(1): 269-275 (1986)

Jaroslav Nesetril, Vojtech Rödl: Finite union theorem with restrictions. Graphs and Combinatorics 2(1): 357-361 (1986)

Ronald L. Graham, Jaroslav Nesetril: Large minimal sets which force long arithmetic progressions. J. Comb. Theory, Ser. A 42(2): 270-276 (1986)

Stefan A. Burr, Jaroslav Nesetril, Vojtech Rödl: On the use of senders in generalized ramsey theory for graphs. Discrete Mathematics 54(1): 1-13 (1985)

Jaroslav Nesetril, Vojtech Rödl: Two remarks on Ramsey's theorem. Discrete Mathematics 54(3): 339-341 (1985)

Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt: Canonizing Ordering Theorems for Hales Jewett Structures. J. Comb. Theory, Ser. A 40(2): 394-408 (1985)

Jaroslav Nesetril, Vojtech Rödl: Sparse Ramsey graphs. Combinatorica 4(1): 71-78 (1984)

Jaroslav Nesetril: Some Nonstandard Ramsey Like Applications. Theor. Comput. Sci. 34: 3-15 (1984)

Jaroslav Nesetril, Vojtech Rödl: Another Proof of the Folkman-Rado-Sanders Theorem. J. Comb. Theory, Ser. A 34(1): 108-109 (1983)

Jaroslav Nesetril, Vojtech Rödl: Ramsey Classes of Set Systems. J. Comb. Theory, Ser. A 34(2): 183-201 (1983)

Jaroslav Nesetril, Vojtech Rödl: Simple proof of the existence of restricted Ramsey graphs by means of a partite construction. Combinatorica 1(2): 199-202 (1981)

M. E. Adams, Jaroslav Nesetril, J. Sichler: Quotients of rigid graphs. J. Comb. Theory, Ser. B 30(3): 351-359 (1981)

Jaroslav Nesetril: Representations of Graphs by Means of Products and Their Complexity. MFCS 1981: 94-102

László Lovász, Jaroslav Nesetril, Ales Pultr: On a product dimension of graphs. J. Comb. Theory, Ser. B 29(1): 47-67 (1980)

Ludek Kucera, Jaroslav Nesetril, Ales Pultr: Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs. Theor. Comput. Sci. 11: 93-106 (1980)

Jaroslav Nesetril, Vojtech Rödl: A short proof of the existence of highly chromatic hypergraphs without short cycles. J. Comb. Theory, Ser. B 27(2): 225-227 (1979)

Jaroslav Nesetril: Partitions of Finite Relational and Set Systems. J. Comb. Theory, Ser. A 22(3): 289-312 (1977)

Jaroslav Nesetril, Ales Pultr: A Dushnik - Miller Type Dimension of Graphs and its Complexity. FCT 1977: 482-493