default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaroslav Nesetril
Jarik Nesetril – Jaroslav Nešetřil
Person information
- unicode name: Jaroslav Nešetřil
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j214]Jan Kratochvíl, Martin Loebl, Jaroslav Nesetril:
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas. Discret. Math. 347(9): 114066 (2024)- [j213]Jaroslav Nesetril, Martin Skoviera:
Preface. Eur. J. Comb. 117: 103819 (2024) - [j212]Robert Cori, Jaroslav Nesetril, Patrice Ossona de Mendez:
Special Issue dedicated to the memory of Pierre Rosenstiehl. Eur. J. Comb. 119: 103800 (2024) - [j211]Jaroslav Nesetril, Guillem Perarnau, Juanjo Rué, Oriol Serra:
Preface. Eur. J. Comb. 121: 103834 (2024) - [j210]Yiting Jiang
, Jaroslav Nesetril:
Minimal asymmetric hypergraphs. J. Comb. Theory B 164: 105-118 (2024) - [j209]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. Log. Methods Comput. Sci. 20(3) (2024) - 2023
- [j208]Jaroslav Nesetril, Ales Pultr:
Note on strong product graph dimension. Art Discret. Appl. Math. 6(2): 2 (2023) - [j207]Yiting Jiang, Jaroslav Nesetril, Patrice Ossona de Mendez:
From χ- to χp-bounded classes. J. Comb. Theory B 158(Part): 186-209 (2023) - [i34]Martin Grötschel, Jaroslav Nesetril:
The Mathematics of László Lovász. CoRR abs/2303.03148 (2023) - [i33]Andrés Aranda, Samuel Braunfeld, David Chodounský, Jan Hubicka, Matej Konecný, Jaroslav Nesetril, Andy Zucker:
Type-respecting amalgamation and big Ramsey degrees. CoRR abs/2303.12679 (2023) - [i32]David Hartman, Tomás Hons, Jaroslav Nesetril:
Structural convergence and algebraic roots. CoRR abs/2310.07045 (2023) - [i31]Martin Balko, David Chodounský, Natasha Dobrinen, Jan Hubicka, Matej Konecný, Jaroslav Nesetril, Andy Zucker:
Ramsey theorem for trees with successor operation. CoRR abs/2311.06872 (2023) - 2022
- [c29]Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Structural Properties of the First-Order Transduction Quasiorder. CSL 2022: 31:1-31:16 - [i30]Jan Hubicka, Jaroslav Nesetril, Pablo Oviedo, Oriol Serra:
On the Homomorphism Order of Oriented Paths and Trees. CoRR abs/2201.09365 (2022) - [i29]Samuel Braunfeld, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
On the first-order transduction quasiorder of hereditary classes of graphs. CoRR abs/2208.14412 (2022) - [i28]Samuel Braunfeld, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Decomposition horizons: from graph sparsity to model-theoretic dividing lines. CoRR abs/2209.11229 (2022) - [i27]Jarik Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Modulo-Counting First-Order Logic on Bounded Expansion Classes. CoRR abs/2211.03704 (2022) - [i26]David Hartman, Tomás Hons, Jaroslav Nesetril:
Gadget construction and structural convergence. CoRR abs/2212.10985 (2022) - 2021
- [j206]Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
Conant's generalised metric spaces are Ramsey. Contributions Discret. Math. 16(2): 46-70 (2021) - [j205]Josep Díaz, Jarik Nesetril:
Preface. Comput. Sci. Rev. 39: 100354 (2021) - [j204]Pavol Hell, Jaroslav Nesetril:
In praise of homomorphisms. Comput. Sci. Rev. 40: 100352 (2021) - [j203]Jirí Fiala, Jaroslav Nesetril:
Foreword. Eur. J. Comb. 91: 103199 (2021) - [j202]Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb. 91: 103223 (2021) - [c28]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. SODA 2021: 2014-2033 - [i25]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. CoRR abs/2102.06880 (2021) - [i24]Martin Balko, David Chodounský, Jan Hubicka, Matej Konecný, Jaroslav Nesetril, Lluís Vena:
Big Ramsey degrees and forbidden cycles. CoRR abs/2105.12184 (2021) - 2020
- [j201]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu:
Clustering Powers of Sparse Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j200]Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva:
EATCS Distinguished Dissertation Award 2020 - Call for Nominations. Bull. EATCS 132 (2020) - [j199]Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril:
Preface. Eur. J. Comb. 88: 103169 (2020) - [j198]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. 21(4): 29:1-29:41 (2020) - [c27]Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez, Sebastian Siebertz:
Linear rankwidth meets stability. SODA 2020: 1180-1199 - [i23]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu:
Clustering powers of sparse graphs. CoRR abs/2003.03605 (2020) - [i22]Yiting Jiang, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Regular partitions of gentle graphs. CoRR abs/2003.11692 (2020) - [i21]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. CoRR abs/2007.07857 (2020) - [i20]Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Towards an arboretum of monadically stable classes of graphs. CoRR abs/2010.02607 (2020)
2010 – 2019
- 2019
- [j197]David Peleg, Susanne Albers, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, Vladimiro Sassone:
EATCS Distinguished Dissertation Award 2019 - Call for Nominations. Bull. EATCS 129 (2019) - [j196]Jaroslav Nesetril, Patrice Ossona de Mendez:
Existence of Modeling Limits for sequences of Sparse Structures. J. Symb. Log. 84(2): 452-472 (2019) - [j195]Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez:
Shrub-depth: Capturing Height of Dense Graphs. Log. Methods Comput. Sci. 15(1) (2019) - [i19]Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
All those EPPA classes (Strengthenings of the Herwig-Lascar theorem). CoRR abs/1902.03855 (2019) - [i18]Jan Hubicka, Jaroslav Nesetril, Pablo Oviedo:
Density and Fractal Property of the Class of Oriented Trees. CoRR abs/1903.09808 (2019) - [i17]Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth. CoRR abs/1909.01564 (2019) - [i16]Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Linear rankwidth meets stability. CoRR abs/1911.07748 (2019) - 2018
- [j194]Jan Hubicka, Jaroslav Nesetril:
Bowtie-free graphs have a Ramsey lift. Adv. Appl. Math. 96: 286-311 (2018) - [j193]Jan Bok, Jaroslav Nesetril:
Graph-indexed random walks on pseudotrees. Electron. Notes Discret. Math. 68: 263-268 (2018) - [j192]Vindya Bhat, Jaroslav Nesetril, Christian Reiher, Vojtech Rödl:
A Ramsey class for Steiner systems. J. Comb. Theory A 154: 323-349 (2018) - [j191]Jaroslav Nesetril, Vojtech Rödl:
Ramsey Partial Orders from Acyclic Graphs. Order 35(2): 293-300 (2018) - [c26]Jaroslav Nesetril:
Sparsity - an Algorithmic Perspective (Invited Paper). ICALP 2018: 2:1-2:1 - [c25]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-Order Interpretations of Bounded Expansion Classes. ICALP 2018: 126:1-126:14 - [i15]David M. Evans, Jan Hubicka, Jaroslav Nesetril:
Automorphism groups and Ramsey properties of sparse graphs. CoRR abs/1801.01165 (2018) - [i14]Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
A combinatorial proof of the extension property for partial isometries. CoRR abs/1807.10976 (2018) - [i13]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-order interpretations of bounded expansion classes. CoRR abs/1810.02389 (2018) - [i12]David M. Evans, Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
EPPA for two-graphs and antipodal metric spaces. CoRR abs/1812.11157 (2018) - 2017
- [j190]Jaroslav Nesetril, Oriol Serra:
Preface. Eur. J. Comb. 66: 1-4 (2017) - [j189]Jirí Fiala, Jan Hubicka, Yangjing Long, Jaroslav Nesetril:
Fractal property of the graph homomorphism order. Eur. J. Comb. 66: 101-109 (2017) - [j188]Lucas Hosseini, Jaroslav Nesetril, Patrice Ossona de Mendez:
Limits of mappings. Eur. J. Comb. 66: 145-159 (2017) - [j187]Michael Drmota, Mihyun Kang, Christian Krattenthaler, Jaroslav Nesetril:
Preface. Electron. Notes Discret. Math. 61: 1-3 (2017) - [j186]Jan Hubicka, Jaroslav Nesetril:
Ramsey theorem for designs. Electron. Notes Discret. Math. 61: 623-629 (2017) - [j185]Jaroslav Nesetril, Patrice Ossona de Mendez:
Cluster analysis of local convergent sequences of structures. Random Struct. Algorithms 51(4): 674-728 (2017) - [i11]Jan Hubicka, Jaroslav Nesetril:
Ramsey Classes with Closure Operations (Selected Combinatorial Applications). CoRR abs/1705.01924 (2017) - [i10]David M. Evans, Jan Hubicka, Jaroslav Nesetril:
Ramsey properties and extending partial automorphisms for classes of finite structures. CoRR abs/1705.02379 (2017) - [i9]Jan Hubicka, Jaroslav Nesetril:
Ramsey theorem for designs. CoRR abs/1705.02989 (2017) - [i8]Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez:
Shrub-depth: Capturing Height of Dense Graphs. CoRR abs/1707.00359 (2017) - [i7]Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
Conant's generalised metric spaces are Ramsey. CoRR abs/1710.04690 (2017) - 2016
- [j184]Jaroslav Nesetril, Patrice Ossona de Mendez:
Modeling Limits in Hereditary Classes: Reduction and Application to Trees. Electron. J. Comb. 23(2): 2 (2016) - [j183]Alexandr V. Kostochka, Jaroslav Nesetril:
Adding Edges to Increase the Chromatic Number of a Graph. Comb. Probab. Comput. 25(4): 592-594 (2016) - [j182]Jaroslav Nesetril, Patrice Ossona de Mendez:
A distributed low tree-depth decomposition algorithm for bounded expansion classes. Distributed Comput. 29(1): 39-49 (2016) - [j181]Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
Polynomial graph invariants from homomorphism numbers. Discret. Math. 339(4): 1315-1328 (2016) - [j180]László Lovász, Jaroslav Nesetril, Alexander Schrijver:
Preface. Eur. J. Comb. 52: 245-247 (2016) - [j179]Nathanael L. Ackerman, Cameron E. Freer, Jaroslav Nesetril, Rehana Patel:
Invariant measures via inverse limits of finite structures. Eur. J. Comb. 52: 248-289 (2016) - [j178]Jaroslav Nesetril, Patrice Ossona de Mendez:
First-order limits, an analytical perspective. Eur. J. Comb. 52: 368-388 (2016) - [j177]Andrew J. Goodall, Jaroslav Nesetril, Patrice Ossona de Mendez:
Strongly polynomial sequences as interpretations. J. Appl. Log. 18: 129-149 (2016) - [j176]Jan Hubicka, Jaroslav Nesetril:
Homomorphism and Embedding Universal Structures for Restricted Classes. J. Multiple Valued Log. Soft Comput. 27(2-3): 229-253 (2016) - [i6]Jirí Fiala, Jan Hubicka, Yangjing Long, Jaroslav Nesetril:
Fractal property of the graph homomorphism order. CoRR abs/1606.07881 (2016) - [i5]Jan Hubicka, Jaroslav Nesetril:
All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms). CoRR abs/1606.07979 (2016) - 2015
- [j175]Jaroslav Nesetril, Marco Pellegrini:
Preface. Eur. J. Comb. 48: 2-4 (2015) - [j174]Jaroslav Nesetril, Oriol Serra, Jan Arne Telle:
Preface. Electron. Notes Discret. Math. 49: 1-2 (2015) - [j173]Jaroslav Nesetril, Patrice Ossona de Mendez:
Structural Limits and Approximations of Mappings. Electron. Notes Discret. Math. 49: 531-539 (2015) - [j172]Jan Hubicka, Jaroslav Nesetril:
Ramsey classes with forbidden homomorphisms and a closure. Electron. Notes Discret. Math. 49: 737-745 (2015) - [j171]Jaroslav Nesetril, Patrice Ossona de Mendez:
On Low Tree-Depth Decompositions. Graphs Comb. 31(6): 1941-1963 (2015) - [j170]Jaroslav Nesetril, Patrice Ossona de Mendez:
A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems. J. Graph Theory 80(4): 268-276 (2015) - [p3]Jan Hubicka, Jaroslav Nesetril:
Universal Structures with Forbidden Homomorphisms. Logic Without Borders 2015: 241-264 - 2014
- [j169]Ervin Györi, Jaroslav Nesetril, Attila Sali:
Preface. Eur. J. Comb. 35: 1 (2014) - [j168]Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
On the number of BB-flows of a graph. Eur. J. Comb. 35: 273-285 (2014) - [j167]Jaroslav Nesetril, Robert Sámal:
Flow-continuous mappings - The influence of the group. Eur. J. Comb. 36: 342-347 (2014) - [j166]Jaroslav Nesetril, Patrice Ossona de Mendez, Xuding Zhu:
Colouring edges with many colours in cycles. J. Comb. Theory B 109: 102-119 (2014) - [p2]Jaroslav Nesetril, Patrice Ossona de Mendez:
On first-order definable colorings. Geometry, Structure and Randomness in Combinatorics 2014: 99-122 - [e7]Jirí Matousek, Jaroslav Nesetril, Marco Pellegrini:
Geometry, Structure and Randomness in Combinatorics. Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 18, Springer 2014, ISBN 978-88-7642-524-0 [contents] - [i4]Jan Hubicka, Jaroslav Nesetril:
Bowtie-free graphs have a Ramsey lift. CoRR abs/1402.2700 (2014) - 2013
- [j165]Jaroslav Nesetril, André Raspaud:
Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 (2012) 685-687]. Eur. J. Comb. 34(7): 1203 (2013) - [p1]Ronald L. Graham, Jaroslav Nesetril:
Ramsey Theory in the Work of Paul Erdős. The Mathematics of Paul Erdős II 2013: 171-193 - [e6]Ronald L. Graham, Jaroslav Nesetril, Steve Butler:
The Mathematics of Paul Erdős I. Springer 2013, ISBN 978-1-4614-7257-5 [contents] - [e5]Ronald L. Graham, Jaroslav Nesetril, Steve Butler:
The Mathematics of Paul Erdős II. Springer 2013, ISBN 978-1-4614-7253-7 [contents] - [e4]Antonín Kucera, Thomas A. Henzinger, Jaroslav Nesetril, Tomás Vojnar, David Antos:
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 [contents] - [i3]David Hartman, Jan Hubicka, Jaroslav Nesetril:
Complexities of relational structures. CoRR abs/1309.4266 (2013) - 2012
- [b5]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 - [j164]Pavol Hell, Wilfried Imrich, Jaroslav Nesetril:
Preface. Discret. Math. 312(1): 1 (2012) - [j163]A. Machì, Jaroslav Nesetril, Patrice Ossona de Mendez, Jorge L. Ramírez Alfonsín:
Preface. Eur. J. Comb. 33(3): 277-278 (2012) - [j162]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) - [j161]Jaroslav Nesetril, André Raspaud:
Preface. Eur. J. Comb. 33(5): 685-687 (2012) - [j160]Jaroslav Nesetril, Robert Sámal:
Tension continuous maps - Their structure and applications. Eur. J. Comb. 33(6): 1207-1225 (2012) - [j159]Jaroslav Nesetril, Yared Nigussie:
Finite dualities and map-critical graphs on a fixed surface. J. Comb. Theory B 102(1): 131-152 (2012) - [c24]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 - 2011
- [j158]Josep Díaz, Jaroslav Nesetril:
Introduction. Comput. Sci. Rev. 5(1): 1 (2011) - [j157]Jaroslav Nesetril, Patrice Ossona de Mendez:
On nowhere dense graphs. Eur. J. Comb. 32(4): 600-617 (2011) - [j156]László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver:
Preface. Eur. J. Comb. 32(7): 951-953 (2011) - [j155]Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Interleaved adjoints of directed graphs. Eur. J. Comb. 32(7): 1018-1024 (2011) - [j154]Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
Distinguishing graphs by their left and right homomorphism profiles. Eur. J. Comb. 32(7): 1025-1053 (2011) - [j153]Jaroslav Nesetril, Patrice Ossona de Mendez:
How many F's are there in G? Eur. J. Comb. 32(7): 1126-1141 (2011) - [j152]Jarik Nesetril, Ervin Györi, Attila Sali:
Preface. Electron. Notes Discret. Math. 38: 1-3 (2011) - [j151]Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
Contractors for flows. Electron. Notes Discret. Math. 38: 389-394 (2011) - 2010
- [j150]Jan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek:
Preface. Discret. Math. 310(3): 371-372 (2010) - [j149]John Gimbel, Jaroslav Nesetril:
Partitions of graphs into cographs. Discret. Math. 310(24): 3437-3445 (2010) - [j148]Richard N. Ball, Jaroslav Nesetril, Ales Pultr:
Dualities in full homomorphisms. Eur. J. Comb. 31(1): 106-119 (2010) - [j147]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) - [j146]Erkko Lehtonen, Jaroslav Nesetril:
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms. Eur. J. Comb. 31(8): 1981-1995 (2010) - [j145]Jaroslav Nesetril, Claude Tardif:
Path homomorphisms, graph colorings, and boolean matrices. J. Graph Theory 63(3): 198-209 (2010) - [j144]Jaroslav Nesetril, Tomás Valla:
On Ramsey-type positional games. J. Graph Theory 64(4): 343-354 (2010) - [j143]Jaroslav Nesetril, Patrice Ossona de Mendez:
First order properties on nowhere dense structures. J. Symb. Log. 75(3): 868-887 (2010) - [j142]Jan Foniok, Jaroslav Nesetril, Ales Pultr, Claude Tardif:
Dualities and Dual Pairs in Heyting Algebras. Order 27(3): 327-342 (2010)
2000 – 2009
- 2009
- [b4]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 - [j141]Josep Díaz, Jarik Nesetril:
Introduction. Comput. Sci. Rev. 3(2): 53 (2009) - [j140]Jaroslav Nesetril:
A surprising permanence of old motivations (a not-so-rigid story). Discret. Math. 309(18): 5510-5526 (2009) - [j139]Alberto Márquez, Jaroslav Nesetril, Oriol Serra:
Preface. Eur. J. Comb. 30(7): 1565-1567 (2009) - [j138]Delia Garijo, Jaroslav Nesetril, Maria Pastora Revuelta Marchena:
Homomorphisms and polynomial invariants of graphs. Eur. J. Comb. 30(7): 1659-1675 (2009) - [j137]Jaroslav Nesetril, Patrice Ossona de Mendez:
Fraternal augmentations, arrangeability and linear Ramsey numbers. Eur. J. Comb. 30(7): 1696-1703 (2009) - [j136]Jaroslav Nesetril, André Raspaud:
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). Electron. Notes Discret. Math. 34: 1-8 (2009) - [j135]Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
Graph homomorphisms, the Tutte polynomial and "q-state Potts uniqueness". Electron. Notes Discret. Math. 34: 231-236 (2009) - [j134]Jaroslav Nesetril, Patrice Ossona de Mendez:
Counting Homomorphisms to Sparse Graphs. Electron. Notes Discret. Math. 34: 393-397 (2009) - [c23]Jan Hubicka, Jaroslav Nesetril:
Some Examples of Universal and Generic Partial Orders. AMS-ASL Joint Special Session 2009: 293-318 - [i2]Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Interleaved adjoints on directed graphs. CoRR abs/0905.1200 (2009) - 2008
- [j133]Pavol Hell, Jaroslav Nesetril:
Colouring, constraint satisfaction, and complexity. Comput. Sci. Rev. 2(3): 143-163 (2008) - [j132]Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril:
Preface. Discret. Math. 308(8): 1347-1349 (2008) - [j131]Jaroslav Nesetril, Claude Tardif:
A dualistic approach to bounding the chromatic number of a graph. Eur. J. Comb. 29(1): 254-260 (2008) - [j130]Jaroslav Nesetril, Patrice Ossona de Mendez:
Grad and classes with bounded expansion I. Decompositions. Eur. J. Comb. 29(3): 760-776 (2008) - [j129]Jaroslav Nesetril, Patrice Ossona de Mendez:
Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb. 29(3): 777-791 (2008) - [j128]Jaroslav Nesetril, Oriol Serra:
Preface. Eur. J. Comb. 29(4): 793-795 (2008) - [j127]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) - [j126]Gábor Kun, Jaroslav Nesetril:
Forbidden lifts (NP and CSP for combinatorialists). Eur. J. Comb. 29(4): 930-945 (2008) - [j125]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) - [j124]Jaroslav Nesetril, Robert Sámal:
On tension-continuous mappings. Eur. J. Comb. 29(4): 1025-1054 (2008) - [j123]Jaroslav Nesetril:
Structural Properties of Sparse Graphs. Electron. Notes Discret. Math. 31: 247-251 (2008) - [c22]Jaroslav Nesetril:
Many Facets of Dualities. Bonn Workshop of Combinatorial Optimization 2008: 285-302 - 2007
- [j122]Josep Díaz, Jaroslav Nesetril:
Introduction. Comput. Sci. Rev. 1(1): 1 (2007) - [j121]Jaroslav Nesetril, Martin Bálek:
Preface. Discret. Math. 307(16): 1969-1971 (2007) - [j120]Jaroslav Nesetril:
Metric spaces are Ramsey. Eur. J. Comb. 28(1): 457-468 (2007) - [j119]Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril:
Editorial. Eur. J. Comb. 28(8): 2053-2056 (2007) - [j118]Jaroslav Nesetril, Patrice Ossona de Mendez:
Fraternal Augmentations of graphs, Coloration and Minors. Electron. Notes Discret. Math. 28: 223-230 (2007) - [j117]Alberto Márquez, Jarik Nesetril, Oriol Serra:
Preface. Electron. Notes Discret. Math. 29: 1-2 (2007) - [j116]Gábor Kun, Jaroslav Nesetril:
NP for Combinatorialists. Electron. Notes Discret. Math. 29: 373-381 (2007) - [j115]Jan Foniok, Jaroslav Nesetril, Claude Tardif:
On Finite Maximal Antichains in the Homomorphism Order. Electron. Notes Discret. Math. 29: 389-396 (2007) - [j114]Delia Garijo, Jaroslav Nesetril, M. P. Revuelta:
Homomorphisms and Polynomial Invariants of Graphs. Electron. Notes Discret. Math. 29: 539-545 (2007) - [j113]Jaroslav Nesetril, Yared Nigussie:
Finite duality for some minor closed classes. Electron. Notes Discret. Math. 29: 579-585 (2007) - [j112]Pavol Hell, Jarik Nesetril:
On the Density of Trigraph Homomorphisms. Graphs Comb. 23(Supplement-1): 275-281 (2007) - [j111]Jaroslav Nesetril, Yared Nigussie:
Density of universal classes of series-parallel graphs. J. Graph Theory 54(1): 13-23 (2007) - [j110]Jaroslav Nesetril, Ida Svejdarová:
Small Diameters of Duals. SIAM J. Discret. Math. 21(2): 374-384 (2007) - [c21]Jaroslav Nesetril, Mark H. Siggers:
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. MFCS 2007: 159-170 - [c20]Gábor Kun, Jaroslav Nesetril:
NP by Means of Lifts and Shadows. MFCS 2007: 171-181 - [i1]Gábor Kun, Jaroslav Nesetril:
NP by means of lifts and shadows. CoRR abs/0706.3459 (2007) - 2006
- [j109]Jaroslav Nesetril:
Ramsey classes of topological and metric spaces. Ann. Pure Appl. Log. 143(1-3): 147-154 (2006) - [j108]Peter J. Cameron, Jaroslav Nesetril:
Homomorphism-Homogeneous Relational Structures. Comb. Probab. Comput. 15(1-2): 91-103 (2006) - [j107]Timothy Marshall, Reza Nasraser, Jaroslav Nesetril:
Homomorphism bounded classes of graphs. Eur. J. Comb. 27(4): 592-600 (2006) - [j106]Jaroslav Nesetril, Patrice Ossona de Mendez:
Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6): 1022-1041 (2006) - [j105]Jaroslav Nesetril:
Preface. Eur. J. Comb. 27(7): 1055-1058 (2006) - [j104]Winfried Hochstättler, Jaroslav Nesetril:
Antisymmetric flows in matroids. Eur. J. Comb. 27(7): 1129-1134 (2006) - [j103]Tomasz Luczak, Jaroslav Nesetril:
When is a random graph projective? Eur. J. Comb. 27(7): 1147-1154 (2006) - [j102]Jaroslav Nesetril, Yared Nigussie:
Minimal universal and dense minor closed classes. Eur. J. Comb. 27(7): 1159-1171 (2006) - [j101]Jaroslav Nesetril, Patrice Ossona de Mendez:
Folding. J. Comb. Theory B 96(5): 730-739 (2006) - [j100]Manuel Bodirsky, Jaroslav Nesetril:
Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16(3): 359-373 (2006) - [j99]Tomasz Luczak, Jaroslav Nesetril:
A Probabilistic Approach to the Dichotomy Problem. SIAM J. Comput. 36(3): 835-843 (2006) - [c19]Jaroslav Nesetril, Patrice Ossona de Mendez:
Linear time low tree-width partitions and algorithmic consequences. STOC 2006: 391-400 - [c18]Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Generalised Dualities and Finite Maximal Antichains. WG 2006: 27-36 - 2005
- [j98]Jaroslav Nesetril:
Ramsey Classes and Homogeneous Structures. Comb. Probab. Comput. 14(1-2): 171-189 (2005) - [j97]Shalom Eliahou, Isidoro Gitler, Jaroslav Nesetril:
Foreword. Discret. Math. 302(1-3): 1-3 (2005) - [j96]Jaroslav Nesetril, Patrice Ossona de Mendez:
Cuts and bounds. Discret. Math. 302(1-3): 211-224 (2005) - [j95]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) - [j94]Jaroslav Nesetril, Patrice Ossona de Mendez:
The Grad of a Graph and Classes with Bounded Expansion. Electron. Notes Discret. Math. 22: 101-106 (2005) - [j93]Jaroslav Nesetril, Nicholas C. Wormald:
The acyclic edge chromatic number of a random d-regular graph is d + 1. J. Graph Theory 49(1): 69-74 (2005) - [j92]Jan Hubicka, Jaroslav Nesetril:
Finite Paths are Universal. Order 22(1): 21-40 (2005) - [j91]Jaroslav Nesetril, Claude Tardif:
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. SIAM J. Discret. Math. 19(4): 914-920 (2005) - [j90]Jaroslav Nesetril, Gerhard J. Woeginger:
Graph colorings. Theor. Comput. Sci. 349(1): 1 (2005) - 2004
- [b3]Pavol Hell, Jaroslav Nesetril:
Graphs and homomorphisms. Oxford lecture series in mathematics and its applications 28, Oxford University Press 2004, ISBN 978-0-19-852817-3, pp. I-XII, 1-244 - [j89]Matt DeVos, Jaroslav Nesetril, André Raspaud:
Antisymmetric flows and edge-connectivity. Discret. Math. 276(1-3): 161-167 (2004) - [j88]Jana Maxová, Jaroslav Nesetril:
On covers of graphs. Discret. Math. 276(1-3): 287-294 (2004) - [j87]Jaroslav Nesetril, Xuding Zhu:
On sparse graphs with given colorings and homomorphisms. J. Comb. Theory B 90(1): 161-172 (2004) - [j86]Tomasz Luczak, Jaroslav Nesetril:
Note on projective graphs. J. Graph Theory 47(2): 81-86 (2004) - [j85]Jan Hubicka, Jaroslav Nesetril:
Finite Paths are Universal. Order 21(3): 181-200 (2004) - [e3]Jaroslav Nesetril, Peter Winkler:
Graphs, Morphisms and Statistical Physics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 63, DIMACS/AMS 2004, ISBN 978-0-8218-3551-7 [contents] - 2003
- [j84]Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic:
Rainbow Arithmetic Progressions and Anti-Ramsey Results. Comb. Probab. Comput. 12(5-6): 599-620 (2003) - [j83]Jaroslav Nesetril, Marc Noy, Oriol Serra:
Foreword. Discret. Math. 273(1-3): 1-6 (2003) - [j82]Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
A note on random homomorphism from arbitrary graphs to Z. Discret. Math. 273(1-3): 173-181 (2003) - [j81]Jaroslav Nesetril, Claude Tardif:
On maximal finite antichains in the homomorphism order of directed graphs. Discuss. Math. Graph Theory 23(2): 325-332 (2003) - [j80]Jaroslav Nesetril, Saharon Shelah:
On the order of countable graphs. Eur. J. Comb. 24(6): 649-663 (2003) - [c17]Manuel Bodirsky, Jaroslav Nesetril:
Constraint Satisfaction with Countable Homogeneous Templates. CSL 2003: 44-57 - 2002
- [b2]Jirí Matousek, Jaroslav Nesetril:
Diskrete Mathematik - eine Entdeckungsreise (korrigierter Nachdruck). Springer-Lehrbuch, Springer 2002, ISBN 978-3-540-42386-7, pp. I-XVII, 1-459 - [j79]Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More About Subcolorings. Computing 69(3): 187-203 (2002) - [j78]Paul A. Dreyer Jr., Christopher Malon, Jaroslav Nesetril:
Universal H-colorable graphs without a given configuration. Discret. Math. 250(1-3): 245-252 (2002) - [j77]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) - [j76]John Gimbel, Jaroslav Nesetril:
Partitions of Graphs into Cographs. Electron. Notes Discret. Math. 11: 705-721 (2002) - [j75]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena:
Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory B 86(1): 100-108 (2002) - [j74]Jaroslav Nesetril:
Art of Graph Drawing and Art. J. Graph Algorithms Appl. 6(1): 131-147 (2002) - [j73]Jaroslav Nesetril:
A rigid graph for every set. J. Graph Theory 39(2): 108-110 (2002) - [j72]Jaroslav Nesetril:
Preface. Theor. Comput. Sci. 287(2): 355-357 (2002) - [j71]Jaroslav Nesetril, Claude Tardif:
Density via duality. Theor. Comput. Sci. 287(2): 585-591 (2002) - [c16]Jana Maxová, Jaroslav Nesetril:
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. ESA 2002: 711-722 - [c15]Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos:
H-Colorings of Large Degree Graphs. EurAsia-ICT 2002: 850-857 - [c14]Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More about Subcolorings. WG 2002: 68-79 - 2001
- [j70]Jaroslav Nesetril, Éric Sopena:
On the Oriented Game Chromatic Number. Electron. J. Comb. 8(2) (2001) - [j69]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). Discret. Math. 229(1-3): 1-2 (2001) - [j68]Jaroslav Nesetril, Moshe Rosenfeld:
I. Schur, C.E. Shannon and Ramsey Numbers, a short story. Discret. Math. 229(1-3): 185-195 (2001) - [j67]Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril:
Foreword. Discret. Math. 233(1-3): 1-2 (2001) - [j66]Jaroslav Nesetril, Eva Milková, Helena Nesetrilová:
Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history. Discret. Math. 233(1-3): 3-36 (2001) - [j65]Alexandr V. Kostochka, Jaroslav Nesetril, Petra Smolíková:
Colorings and homomorphisms of degenerate and bounded degree graphs. Discret. Math. 233(1-3): 257-276 (2001) - [j64]Jaroslav Nesetril, Xuding Zhu:
Construction of sparse graphs with prescribed circular colorings. Discret. Math. 233(1-3): 277-291 (2001) - [j63]Jana Maxová, Jaroslav Nesetril:
On oriented path double covers. Discret. Math. 233(1-3): 371-380 (2001) - [j62]Bernhard Korte, Jaroslav Nesetril:
Vojtech Jarni'k's work in combinatorial optimization. Discret. Math. 235(1-3): 1-17 (2001) - [j61]Jaroslav Nesetril, Ales Pultr:
A note on homomorphism-independent families. Discret. Math. 235(1-3): 327-334 (2001) - [j60]Petr Pancoska, Ví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. Discret. Math. 235(1-3): 399-423 (2001) - [j59]Jaroslav Nesetril, Marc Noy, Oriol Serra:
Preface: Volume 10. Electron. Notes Discret. Math. 10: 1 (2001) - [j58]Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
A note on Random Homomorphism from ArbitraryGraphs to Z. Electron. Notes Discret. Math. 10: 176-180 (2001) - [c13]Pavol Hell, Jaroslav Nesetril:
Counting List Homomorphisms and Graphs with Bounded Degrees. Graphs, Morphisms and Statistical Physics 2001: 105-112 - [c12]Jan Adamec, Jaroslav Nesetril:
Towards an Aesthetic Invariant for Graph Drawing. GD 2001: 287-296 - 2000
- [j57]Anna Galluccio, Pavol Hell, Jaroslav Nesetril:
The complexity of H-colouring of bounded degree graphs. Discret. Math. 222(1-3): 101-109 (2000) - [j56]Jana Maxová, Jaroslav Nesetril:
On covers of graphs. Electron. Notes Discret. Math. 5: 222-224 (2000) - [j55]Jaroslav Nesetril, Claude Tardif:
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). J. Comb. Theory B 80(1): 80-97 (2000) - [j54]Jaroslav Nesetril, André Raspaud:
Colored Homomorphisms of Colored Mixed Graphs. J. Comb. Theory B 80(1): 147-155 (2000)
1990 – 1999
- 1999
- [j53]Alexandr V. Kostochka, Jaroslav Nesetril:
Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. Comb. Probab. Comput. 8(5): 467-472 (1999) - [j52]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena:
On the maximum average degree and the oriented chromatic number of a graph. Discret. Math. 206(1-3): 77-89 (1999) - [c11]Jaroslav Nesetril:
Art of Drawing. GD 1999: 267-275 - [e2]Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts:
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 49, DIMACS/AMS 1999, ISBN 0-8218-0963-6 [contents] - [e1]Jaroslav Nesetril:
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 [contents] - 1998
- [b1]Jirí Matousek, Jaroslav Nesetril:
Invitation to discrete mathematics. Oxford University Press 1998, ISBN 978-0-19-850207-4, pp. I-XV, 1-410 - [j51]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena:
On universal graphs for planar oriented graphs of a given girth. Discret. Math. 188(1-3): 73-85 (1998) - [j50]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) - [j49]Jaroslav Nesetril, Pavel Valtr:
A Ramsey Property of Order Types. J. Comb. Theory A 81(1): 88-107 (1998) - 1997
- [j48]Jarik Nesetril, André Raspaud, Éric Sopena:
Colorings and girth of oriented planar graphs. Discret. Math. 165-166: 519-530 (1997) - [j47]Martin Loebl, Jaroslav Nesetril:
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. J. Algorithms 23(2): 207-220 (1997) - [c10]Jaroslav Nesetril, József Solymosi, Pavel Valtr:
Induced monochromatic subconfigurations. Contemporary Trends in Discrete Mathematics 1997: 219-227 - [c9]Jaroslav Nesetril, Claude Tardif:
Density. Contemporary Trends in Discrete Mathematics 1997: 229-235 - [c8]Petr Pancoska, Vít Janota, Jaroslav Nesetril:
Spectra, graphs, and proteins. Towards understanding of protein folding. Contemporary Trends in Discrete Mathematics 1997: 237-255 - [c7]Jaroslav Nesetril, Daniel Turzík:
Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP). SOFSEM 1997: 70-85 - 1996
- [j46]Pavol Hell, Jaroslav Nesetril, Xuding Zhu:
Complexity of Tree Homomorphisms. Discret. Appl. Math. 70(1): 23-36 (1996) - [j45]Pavol Gvozdjak, Jaroslav Nesetril:
High girth and extendability. Discret. Math. 154(1-3): 77-84 (1996) - [j44]Jaroslav Nesetril, Xuding Zhu:
On bounded treewidth duality of graphs. J. Graph Theory 23(2): 151-162 (1996) - 1994
- [j43]Jaroslav Nesetril, Pavel Valtr:
A Ramsey-type Theorem in the Plane. Comb. Probab. Comput. 3: 127-135 (1994) - [j42]Jaroslav Nesetril:
on ordered Graphs and Graph orderings. Discret. Appl. Math. 51(1-2): 113-116 (1994) - 1992
- [j41]Jaroslav Nesetril, Vojtech Rödl:
On Ramsey graphs without bipartite subgraphs. Discret. Math. 101(1-3): 223-229 (1992) - [j40]Jaroslav Nesetril:
Z. Frolík and his winter schools. Discret. Math. 108(1-3): 1-2 (1992) - [j39]Wilfried Imrich, Jaroslav Nesetril:
Simple tournaments and sharply transitive groups. Discret. Math. 108(1-3): 159-165 (1992) - [j38]Pavol Hell, Jaroslav Nesetril:
The core of a graph. Discret. Math. 109(1-3): 117-126 (1992) - [j37]Jaroslav Nesetril, Gert Sabidussi:
Minimal asymmetric graphs of induced length 4. Graphs Comb. 8(4): 343-359 (1992) - 1991
- [j36]Graham R. Brightwell, Jaroslav Nesetril:
Reorientations of covering graphs. Discret. Math. 88(2-3): 129-132 (1991) - [j35]Pavol Hell, Jaroslav Nesetril:
Images of Rigid Digraphs. Eur. J. Comb. 12(1): 33-42 (1991) - [j34]Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril:
Noncrossing Subgraphs in Topological Layouts. SIAM J. Discret. Math. 4(2): 223-244 (1991) - [j33]Peter Alles, Jaroslav Nesetril, Svatopluk Poljak:
Extendability, Dimensions, and Diagrams of Cycle Orders. SIAM J. Discret. Math. 4(4): 453-471 (1991) - 1990
- [j32]Pavol Hell, Jaroslav Nesetril:
On the complexity of H-coloring. J. Comb. Theory B 48(1): 92-110 (1990) - [j31]Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo:
On Locally Presented Posets. Theor. Comput. Sci. 70(2): 251-260 (1990)
1980 – 1989
- 1989
- [j30]Jaroslav Nesetril, Vojtech Rödl:
The partite construction and ramsey set systems. Discret. Math. 75(1-3): 327-334 (1989) - [j29]Jaroslav Nesetril:
For graphs there are only four types of hereditary Ramsey classes. J. Comb. Theory B 46(2): 127-132 (1989) - [j28]Jaroslav Nesetril, Vojtech Rödl:
Chromatically optimal rigid graphs. J. Comb. Theory B 46(2): 133-141 (1989) - 1988
- [j27]Chris D. Godsil, Richard J. Nowakowski, Jaroslav Nesetril:
The chromatic connectivity of graphs. Graphs Comb. 4(1): 229-233 (1988) - [j26]Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril:
Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory A 49(1): 129-144 (1988) - [c6]Martin Loebl, Jaroslav Nesetril:
Postorder Hierarchy for Path Compressions and Set Union. IMYCS 1988: 146-151 - [c5]Martin Loebl, Jaroslav Nesetril:
Linearity and Unprovability of Set Union Problem Strategies. STOC 1988: 360-366 - 1987
- [j25]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 B 43(2): 127-139 (1987) - [j24]Egon Balas, Vasek Chvátal, Jaroslav Nesetril:
On the Maximum Weight Clique Problem. Math. Oper. Res. 12(3): 522-535 (1987) - [c4]Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo:
Posets, Boolean Representations and Quick Path Searching. ICALP 1987: 404-424 - [c3]Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo:
Efficient Representation of Taxonomies. TAPSOFT, Vol.1 1987: 232-240 - 1986
- [j23]Jaroslav Nesetril, Vojtech Rödl:
On sets of integers with the Schur property. Graphs Comb. 2(1): 269-275 (1986) - [j22]Jaroslav Nesetril, Vojtech Rödl:
Finite union theorem with restrictions. Graphs Comb. 2(1): 357-361 (1986) - [j21]Ronald L. Graham, Jaroslav Nesetril:
Large minimal sets which force long arithmetic progressions. J. Comb. Theory A 42(2): 270-276 (1986) - 1985
- [j20]Stefan A. Burr, Jaroslav Nesetril, Vojtech Rödl:
On the use of senders in generalized ramsey theory for graphs. Discret. Math. 54(1): 1-13 (1985) - [j19]Jaroslav Nesetril, Vojtech Rödl:
Two remarks on Ramsey's theorem. Discret. Math. 54(3): 339-341 (1985) - [j18]Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt:
Canonizing Ordering Theorems for Hales Jewett Structures. J. Comb. Theory A 40(2): 394-408 (1985) - 1984
- [j17]Jaroslav Nesetril, Vojtech Rödl:
Sparse Ramsey graphs. Comb. 4(1): 71-78 (1984) - [j16]Jaroslav Nesetril:
Some Nonstandard Ramsey Like Applications. Theor. Comput. Sci. 34: 3-15 (1984) - 1983
- [j15]Jaroslav Nesetril, R. Paninski, H. Sachs:
An Extremal Problem on v-Partite Graphs. Eur. J. Comb. 4(3): 255-262 (1983) - [j14]Jaroslav Nesetril, Vojtech Rödl:
Another Proof of the Folkman-Rado-Sanders Theorem. J. Comb. Theory A 34(1): 108-109 (1983) - [j13]Jaroslav Nesetril, Vojtech Rödl:
Ramsey Classes of Set Systems. J. Comb. Theory A 34(2): 183-201 (1983) - 1982
- [j12]Jaroslav Nesetril, Vojtech Rödl:
Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs. Eur. J. Comb. 3(4): 347-352 (1982) - 1981
- [j11]Jaroslav Nesetril, Vojtech Rödl:
Simple proof of the existence of restricted Ramsey graphs by means of a partite construction. Comb. 1(2): 199-202 (1981) - [j10]M. E. Adams, Jaroslav Nesetril, Jirí Sichler:
Quotients of rigid graphs. J. Comb. Theory B 30(3): 351-359 (1981) - [j9]Jaroslav Nesetril, Svatopluk Poljak, Daniel Turzík:
Amalgamation of matroids and its applications. J. Comb. Theory B 31(3): 9-22 (1981) - [c2]Jaroslav Nesetril:
Representations of Graphs by Means of Products and Their Complexity. MFCS 1981: 94-102 - 1980
- [j8]László Lovász, Jaroslav Nesetril, Ales Pultr:
On a product dimension of graphs. J. Comb. Theory B 29(1): 47-67 (1980) - [j7]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)
1970 – 1979
- 1979
- [j6]Jaroslav Nesetril, Vojtech Rödl:
A short proof of the existence of highly chromatic hypergraphs without short cycles. J. Comb. Theory B 27(2): 225-227 (1979) - 1978
- [j5]Jaroslav Nesetril, Ales Pultr:
On classes of relations and graphs determined by subobjects and factorobjects. Discret. Math. 22(3): 287-300 (1978) - [j4]Jaroslav Nesetril, Vojtech Rödl:
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph. Discret. Math. 23(1): 49-55 (1978) - 1977
- [j3]Jaroslav Nesetril, Vojtech Rödl:
Partitions of Finite Relational and Set Systems. J. Comb. Theory A 22(3): 289-312 (1977) - [c1]Jaroslav Nesetril, Ales Pultr:
A Dushnik - Miller Type Dimension of Graphs and its Complexity. FCT 1977: 482-493 - 1975
- [j2]Vladimír Müller, Jaroslav Nesetril, Jan Pelant:
Either tournaments or algebras? Discret. Math. 11(1): 37-66 (1975) - 1971
- [j1]Jaroslav Nesetril:
Homomorphisms of derivative graphs. Discret. Math. 1(3): 257-268 (1971)
Coauthor Index
[j212] [j209] [j207] [c29] [i29] [i28] [i27] [j202] [c28] [i25] [j201] [j198] [c27] [i23] [i22] [i21] [i20] [j196] [j195] [i17] [i16] [c25] [i13] [j188] [j185] [i8] [j184] [j182] [j178] [j177] [j173] [j171] [j170] [j166] [p2] [b5] [j163] [j162] [c24] [j157] [j156] [j153] [j143] [j137] [j134] [j130] [j129] [j125] [j118] [j106] [j101] [c19] [j96] [j94]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
