dblp.uni-trier.dewww.uni-trier.de

Jaroslav Nesetril Vis

Jarik Nesetril

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2008
135EEPavol Hell, Jaroslav Nesetril: Colouring, constraint satisfaction, and complexity. Computer Science Review 2(3): 143-163 (2008)
134EEStefan Felsner, Marco E. Lübbecke, Jarik Nesetril: Preface. Discrete Mathematics 308(8): 1347-1349 (2008)
133EEJaroslav Nesetril: Structural Properties of Sparse Graphs. Electronic Notes in Discrete Mathematics 31: 247-251 (2008)
132EEJaroslav Nesetril, Claude Tardif: A dualistic approach to bounding the chromatic number of a graph. Eur. J. Comb. 29(1): 254-260 (2008)
131EEJaroslav Nesetril, Patrice Ossona de Mendez: Grad and classes with bounded expansion I. Decompositions. Eur. J. Comb. 29(3): 760-776 (2008)
130EEJaroslav Nesetril, Patrice Ossona de Mendez: Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb. 29(3): 777-791 (2008)
129EEJaroslav Nesetril, Patrice Ossona de Mendez: Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. Eur. J. Comb. 29(4): 1012-1024 (2008)
128EEJaroslav Nesetril, Robert Sámal: On tension-continuous mappings. Eur. J. Comb. 29(4): 1025-1054 (2008)
127EEJaroslav Nesetril, Oriol Serra: Preface. Eur. J. Comb. 29(4): 793-795 (2008)
126EEJan 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)
125EEGábor Kun, Jaroslav Nesetril: Forbidden lifts (NP and CSP for combinatorialists). Eur. J. Comb. 29(4): 930-945 (2008)
2007
124EEJaroslav Nesetril, Mark H. Siggers: Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. MFCS 2007: 159-170
123EEGábor Kun, Jaroslav Nesetril: NP by Means of Lifts and Shadows. MFCS 2007: 171-181
122EEGábor Kun, Jaroslav Nesetril: NP by means of lifts and shadows CoRR abs/0706.3459: (2007)
121EEJosep Díaz, Jaroslav Nesetril: Introduction. Computer Science Review 1(1): 1 (2007)
120EEJaroslav Nesetril, Martin Bálek: Preface. Discrete Mathematics 307(16): 1969-1971 (2007)
119EEJaroslav Nesetril, Patrice Ossona de Mendez: Fraternal Augmentations of graphs, Coloration and Minors. Electronic Notes in Discrete Mathematics 28: 223-230 (2007)
118EEAlberto Márquez, Jarik Nesetril, Oriol Serra: Preface. Electronic Notes in Discrete Mathematics 29: 1-2 (2007)
117EEGábor Kun, Jaroslav Nesetril: NP for Combinatorialists. Electronic Notes in Discrete Mathematics 29: 373-381 (2007)
116EEJan Foniok, Jaroslav Nesetril, Claude Tardif: On Finite Maximal Antichains in the Homomorphism Order. Electronic Notes in Discrete Mathematics 29: 389-396 (2007)
115EED. Garijo, Jaroslav Nesetril, M. P. Revuelta: Homomorphisms and Polynomial Invariants of Graphs. Electronic Notes in Discrete Mathematics 29: 539-545 (2007)
114EEJaroslav Nesetril, Yared Nigussie: Finite duality for some minor closed classes. Electronic Notes in Discrete Mathematics 29: 579-585 (2007)
113EEJaroslav Nesetril: Metric spaces are Ramsey. Eur. J. Comb. 28(1): 457-468 (2007)
112EEStefan Felsner, Marco E. Lübbecke, Jarik Nesetril: Editorial. Eur. J. Comb. 28(8): 2053-2056 (2007)
111EEJaroslav Nesetril, Yared Nigussie: Density of universal classes of series-parallel graphs. Journal of Graph Theory 54(1): 13-23 (2007)
110EEJaroslav Nesetril, Ida Svejdarová: Small Diameters of Duals. SIAM J. Discrete Math. 21(2): 374-384 (2007)
2006
109EEJaroslav Nesetril, Patrice Ossona de Mendez: Linear time low tree-width partitions and algorithmic consequences. STOC 2006: 391-400
108EEJan Foniok, Jaroslav Nesetril, Claude Tardif: Generalised Dualities and Finite Maximal Antichains. WG 2006: 27-36
107EEJaroslav Nesetril: Ramsey classes of topological and metric spaces. Ann. Pure Appl. Logic 143(1-3): 147-154 (2006)
106EEPeter J. Cameron, Jaroslav Nesetril: Homomorphism-Homogeneous Relational Structures. Combinatorics, Probability & Computing 15(1-2): 91-103 (2006)
105EETimothy Marshall, Reza Nasraser, Jaroslav Nesetril: Homomorphism bounded classes of graphs. Eur. J. Comb. 27(4): 592-600 (2006)
104EEJaroslav Nesetril, Patrice Ossona de Mendez: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6): 1022-1041 (2006)
103EEJaroslav Nesetril: Preface. Eur. J. Comb. 27(7): 1055-1058 (2006)
102EEWinfried Hochstättler, Jaroslav Nesetril: Antisymmetric flows in matroids. Eur. J. Comb. 27(7): 1129-1134 (2006)
101EETomasz Luczak, Jaroslav Nesetril: When is a random graph projective? Eur. J. Comb. 27(7): 1147-1154 (2006)
100EEJaroslav Nesetril, Yared Nigussie: Minimal universal and dense minor closed classes. Eur. J. Comb. 27(7): 1159-1171 (2006)
99EEJaroslav Nesetril, Patrice Ossona de Mendez: Folding. J. Comb. Theory, Ser. B 96(5): 730-739 (2006)
98EEManuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16(3): 359-373 (2006)
97EETomasz Luczak, Jaroslav Nesetril: A Probabilistic Approach to the Dichotomy Problem. SIAM J. Comput. 36(3): 835-843 (2006)
2005
96EEJaroslav Nesetril: Ramsey Classes and Homogeneous Structures. Combinatorics, Probability & Computing 14(1-2): 171-189 (2005)
95EEShalom Eliahou, Isidoro Gitler, Jaroslav Nesetril: Foreword. Discrete Mathematics 302(1-3): 1-3 (2005)
94EEJaroslav Nesetril, Patrice Ossona de Mendez: Cuts and bounds. Discrete Mathematics 302(1-3): 211-224 (2005)
93EEJaroslav Nesetril, Patrice Ossona de Mendez: The Grad of a Graph and Classes with Bounded Expansion. Electronic Notes in Discrete Mathematics 22: 101-106 (2005)
92EEJan Hubicka, Jaroslav Nesetril: Universal partial order represented by means of oriented trees and other simple graphs. Eur. J. Comb. 26(5): 765-778 (2005)
91EEJaroslav 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)
90EEJan Hubicka, Jaroslav Nesetril: Finite Paths are Universal. Order 22(1): 21-40 (2005)
89EEJaroslav Nesetril, Claude Tardif: Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. SIAM J. Discrete Math. 19(4): 914-920 (2005)
88EEJaroslav Nesetril, Gerhard J. Woeginger: Graph colorings. Theor. Comput. Sci. 349(1): 1 (2005)
2004
87EEMatt DeVos, Jaroslav Nesetril, André Raspaud: Antisymmetric flows and edge-connectivity. Discrete Mathematics 276(1-3): 161-167 (2004)
86EEJana Maxová, Jaroslav Nesetril: On covers of graphs. Discrete Mathematics 276(1-3): 287-294 (2004)
85EEJaroslav Nesetril, Xuding Zhu: On sparse graphs with given colorings and homomorphisms. J. Comb. Theory, Ser. B 90(1): 161-172 (2004)
84EETomasz Luczak, Jaroslav Nesetril: Note on projective graphs. Journal of Graph Theory 47(2): 81-86 (2004)
83EEJan Hubicka, Jaroslav Nesetril: Finite Paths are Universal. Order 21(3): 181-200 (2004)
2003
82EEManuel Bodirsky, Jaroslav Nesetril: Constraint Satisfaction with Countable Homogeneous Templates. CSL 2003: 44-57
81 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)
80EEJaroslav Nesetril, Marc Noy, Oriol Serra: Foreword. Discrete Mathematics 273(1-3): 1-6 (2003)
79EEMartin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on random homomorphism from arbitrary graphs to Z. Discrete Mathematics 273(1-3): 173-181 (2003)
78EEJaroslav Nesetril, Saharon Shelah: On the order of countable graphs. Eur. J. Comb. 24(6): 649-663 (2003)
2002
77EEJana Maxová, Jaroslav Nesetril: Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. ESA 2002: 711-722
76EEJosep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos: H-Colorings of Large Degree Graphs. EurAsia-ICT 2002: 850-857
75EEHajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79
74EEHajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)
73EEPaul A. Dreyer Jr., Christopher Malon, Jaroslav Nesetril: Universal H-colorable graphs without a given configuration. Discrete Mathematics 250(1-3): 245-252 (2002)
72EEJohn Gimbel, Jaroslav Nesetril: Partitions of Graphs into Cographs. Electronic Notes in Discrete Mathematics 11: 705-721 (2002)
71EEAlexandr 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)
70EEDmitry 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)
69EEJaroslav Nesetril: Art of Graph Drawing and Art. J. Graph Algorithms Appl. 6(1): 131-147 (2002)
68 Jaroslav Nesetril: Preface. Theor. Comput. Sci. 287(2): 355-357 (2002)
67 Jaroslav Nesetril, Claude Tardif: Density via duality. Theor. Comput. Sci. 287(2): 585-591 (2002)
2001
66EEJan Adamec, Jaroslav Nesetril: Towards an Aesthetic Invariant for Graph Drawing. Graph Drawing 2001: 287-296
65EEMiroslav 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)
64EEJaroslav Nesetril, Moshe Rosenfeld: I. Schur, C.E. Shannon and Ramsey Numbers, a short story. Discrete Mathematics 229(1-3): 185-195 (2001)
63EEMiroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril: Foreword. Discrete Mathematics 233(1-3): 1-2 (2001)
62EEAlexandr V. Kostochka, Jaroslav Nesetril, P. Smolíková: Colorings and homomorphisms of degenerate and bounded degree graphs. Discrete Mathematics 233(1-3): 257-276 (2001)
61EEJaroslav Nesetril, Xuding Zhu: Construction of sparse graphs with prescribed circular colorings. Discrete Mathematics 233(1-3): 277-291 (2001)
60EEJaroslav 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)
59EEJana Maxová, Jaroslav Nesetril: On oriented path double covers. Discrete Mathematics 233(1-3): 371-380 (2001)
58EEBernhard Korte, Jaroslav Nesetril: Vojtech Jarni'k's work in combinatorial optimization. Discrete Mathematics 235(1-3): 1-17 (2001)
57EEJaroslav Nesetril, Ales Pultr: A note on homomorphism-independent families. Discrete Mathematics 235(1-3): 327-334 (2001)
56EEPetr 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)
55EEJaroslav Nesetril, Eric Sopena: On the Oriented Game Chromatic Number. Electr. J. Comb. 8(2): (2001)
54EEJaroslav Nesetril, Marc Noy, Oriol Serra: Preface: Volume 10. Electronic Notes in Discrete Mathematics 10: 1 (2001)
53EEMartin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on Random Homomorphism from ArbitraryGraphs to Z. Electronic Notes in Discrete Mathematics 10: 176-180 (2001)
2000
52EEAnna Galluccio, Pavol Hell, Jaroslav Nesetril: The complexity of H-colouring of bounded degree graphs. Discrete Mathematics 222(1-3): 101-109 (2000)
51EEJana Maxová, Jaroslav Nesetril: On covers of graphs. Electronic Notes in Discrete Mathematics 5: 222-224 (2000)
50EEJaroslav Nesetril, André Raspaud: Colored Homomorphisms of Colored Mixed Graphs. J. Comb. Theory, Ser. B 80(1): 147-155 (2000)
49EEJaroslav Nesetril, Claude Tardif: Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). J. Comb. Theory, Ser. B 80(1): 80-97 (2000)
1999
48 Jaroslav Nesetril: Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings Springer 1999
47EEJaroslav Nesetril: Art of Drawing. Graph Drawing 1999: 267-275
46 Alexandr V. Kostochka, Jaroslav Nesetril: Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. Combinatorics, Probability & Computing 8(5): (1999)
45EEOleg 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)
1998
44EEOleg 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)
43EEAlexandr V. Kostochka, Jaroslav Nesetril: Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth. Eur. J. Comb. 19(1): 103-110 (1998)
42EEJaroslav Nesetril, Pavel Valtr: A Ramsey Property of Order Types. J. Comb. Theory, Ser. A 81(1): 88-107 (1998)
1997
41 Jaroslav Nesetril, Daniel Turzík: Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP). SOFSEM 1997: 70-85
40EEJarik Nesetril, André Raspaud, Eric Sopena: Colorings and girth of oriented planar graphs. Discrete Mathematics 165-166: 519-530 (1997)
39 Martin Loebl, Jaroslav Nesetril: Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. J. Algorithms 23(2): 207-220 (1997)
1996
38EEPavol Hell, Jaroslav Nesetril, Xuding Zhu: Complexity of Tree Homomorphisms. Discrete Applied Mathematics 70(1): 23-36 (1996)
37EEPavol Gvozdjak, Jaroslav Nesetril: High girth and extendability. Discrete Mathematics 154(1-3): 77-84 (1996)
1994
36 Jaroslav Nesetril, Pavel Valtr: A Ramsey-type Theorem in the Plane. Combinatorics, Probability & Computing 3: 127-135 (1994)
35EEJaroslav Nesetril: on ordered Graphs and Graph orderings. Discrete Applied Mathematics 51(1-2): 113-116 (1994)
1992
34EEJaroslav Nesetril, Vojtech Rödl: On Ramsey graphs without bipartite subgraphs. Discrete Mathematics 101(1-3): 223-229 (1992)
33EEJaroslav Nesetril: Z. Frolík and his winter schools. Discrete Mathematics 108(1-3): 1-2 (1992)
32EEWilfried Imrich, Jaroslav Nesetril: Simple tournaments and sharply transitive groups. Discrete Mathematics 108(1-3): 159-165 (1992)
31EEPavol Hell, Jaroslav Nesetril: The core of a graph. Discrete Mathematics 109(1-3): 117-126 (1992)
1991
30EEGraham Brightwell, Jaroslav Nesetril: Reorientations of covering graphs. Discrete Mathematics 88(2-3): 129-132 (1991)
29 Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril: Noncrossing Subgraphs in Topological Layouts. SIAM J. Discrete Math. 4(2): 223-244 (1991)
28 Peter Alles, Jaroslav Nesetril, Svatopluk Poljak: Extendability, Dimensions, and Diagrams of Cycle Orders. SIAM J. Discrete Math. 4(4): 453-471 (1991)
1990
27EEPavol Hell, Jaroslav Nesetril: On the complexity of H-coloring. J. Comb. Theory, Ser. B 48(1): 92-110 (1990)
26 Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo: On Locally Presented Posets. Theor. Comput. Sci. 70(2): 251-260 (1990)
1989
25EEJaroslav Nesetril, Vojtech Rödl: The partite construction and ramsey set systems. Discrete Mathematics 75(1-3): 327-334 (1989)
24EEJaroslav Nesetril: For graphs there are only four types of hereditary Ramsey classes. J. Comb. Theory, Ser. B 46(2): 127-132 (1989)
23EEJaroslav Nesetril, Vojtech Rödl: Chromatically optimal rigid graphs. J. Comb. Theory, Ser. B 46(2): 133-141 (1989)
1988
22EEMartin Loebl, Jaroslav Nesetril: Postorder Hierarchy for Path Compressions and Set Union. IMYCS 1988: 146-151
21 Martin Loebl, Jaroslav Nesetril: Linearity and Unprovability of Set Union Problem Strategies STOC 1988: 360-366
20EEAviezri 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)
1987
19EEGiorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo: Posets, Boolean Representations and Quick Path Searching. ICALP 1987: 404-424
18EEGiorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo: Efficient Representation of Taxonomies. TAPSOFT, Vol.1 1987: 232-240
17EEAndrá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)
1986
16EERonald L. Graham, Jaroslav Nesetril: Large minimal sets which force long arithmetic progressions. J. Comb. Theory, Ser. A 42(2): 270-276 (1986)
1985
15EEStefan 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)
14EEJaroslav Nesetril, Vojtech Rödl: Two remarks on Ramsey's theorem. Discrete Mathematics 54(3): 339-341 (1985)
13 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)
1984
12 Jaroslav Nesetril, Vojtech Rödl: Sparse Ramsey graphs. Combinatorica 4(1): 71-78 (1984)
11 Jaroslav Nesetril: Some Nonstandard Ramsey Like Applications. Theor. Comput. Sci. 34: 3-15 (1984)
1983
10 Jaroslav Nesetril, Vojtech Rödl: Another Proof of the Folkman-Rado-Sanders Theorem. J. Comb. Theory, Ser. A 34(1): 108-109 (1983)
9 Jaroslav Nesetril, Vojtech Rödl: Ramsey Classes of Set Systems. J. Comb. Theory, Ser. A 34(2): 183-201 (1983)
1981
8EEJaroslav Nesetril: Representations of Graphs by Means of Products and Their Complexity. MFCS 1981: 94-102
7 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)
6EEM. E. Adams, Jaroslav Nesetril, J. Sichler: Quotients of rigid graphs. J. Comb. Theory, Ser. B 30(3): 351-359 (1981)
1980
5EELászló Lovász, Jaroslav Nesetril, Ales Pultr: On a product dimension of graphs. J. Comb. Theory, Ser. B 29(1): 47-67 (1980)
4 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)
1979
3EEJaroslav 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)
1977
2 Jaroslav Nesetril, Ales Pultr: A Dushnik - Miller Type Dimension of Graphs and its Complexity. FCT 1977: 482-493
1 Jaroslav Nesetril: Partitions of Finite Relational and Set Systems. J. Comb. Theory, Ser. A 22(3): 289-312 (1977)

Coauthor Index

1Jan Adamec [66]
2M. E. Adams [6]
3Peter Alles [28]
4Martin Bálek [120]
5Manuel Bodirsky [82] [98]
6Oleg V. Borodin [44] [45]
7Graham Brightwell [30]
8Hajo Broersma (H. J. Broersma) [74] [75]
9Stefan A. Burr [15]
10Peter J. Cameron [106]
11Matt DeVos [87]
12Josep Díaz [76] [121]
13Paul A. Dreyer Jr. [73]
14Shalom Eliahou [95]
15Stefan Felsner [112] [134]
16Miroslav Fiedler [63] [65]
17Fedor V. Fomin [74] [75]
18Dmitry Fon-Der-Flaass [70]
19Jan Foniok [108] [116] [126]
20Aviezri S. Fraenkel [20]
21Anna Galluccio [52]
22Giorgio Gambosi [18] [19] [26]
23D. Garijo [115]
24John Gimbel [72]
25Isidoro Gitler [95]
26Ronald L. Graham [16]
27Pavol Gvozdjak [37]
28András Gyárfás [17]
29Pavol Hell [27] [31] [38] [52] [135]
30Winfried Hochstättler [102]
31Jan Hubicka [83] [90] [92]
32Wilfried Imrich [32]
33Vi't Janota [56]
34Veselin Jungic [81]
35Bernhard Korte [58]
36Alexandr V. Kostochka [43] [44] [45] [46] [62] [70] [71]
37Jan Kratochvíl [29] [63] [65]
38Ludek Kucera [4]
39Gábor Kun [117] [122] [123] [125]
40Jenö Lehel (Jeno Lehel) [17]
41Jacob Licht [81]
42Martin Loebl [20] [21] [22] [39] [53] [79]
43László Lovász [5]
44Marco E. Lübbecke [112] [134]
45Anna Lubiw [29]
46Tomasz Luczak [84] [97] [101]
47Mohammad Mahdian [81]
48Christopher Malon [73]
49Alberto Márquez [118]
50Timothy Marshall [105]
51Jana Maxová [51] [59] [77] [86]
52Patrice Ossona de Mendez [93] [94] [99] [104] [109] [119] [129] [130] [131]
53Eva Milková [60]
54Reza Nasraser [105]
55Helena Nesetrilová [60]
56Yared Nigussie [100] [111] [114]
57Marc Noy [54] [80]
58Petr Pancoska [56]
59Svatopluk Poljak [28]
60Hans Jürgen Prömel [13]
61Ales Pultr [2] [4] [5] [57]
62Rados Radoicic [81]
63André Raspaud [40] [44] [45] [50] [70] [87]
64Bruce A. Reed [53] [79]
65M. P. Revuelta [115]
66Vojtech Rödl [3] [7] [9] [10] [12] [13] [14] [15] [17] [23] [25] [34]
67Moshe Rosenfeld [64]
68Robert Sámal [128]
69Richard H. Schelp [17]
70Maria J. Serna [76]
71Oriol Serra [54] [80] [118] [127]
72Saharon Shelah [78]
73J. Sichler [6]
74Mark H. Siggers [124]
75P. Smolíková [62]
76Eric Sopena [40] [44] [45] [55] [70]
77Ida Svejdarová [110]
78Maurizio Talamo [18] [19] [26]
79Claude Tardif [49] [67] [89] [108] [116] [126] [132]
80Dimitrios M. Thilikos [76]
81Daniel Turzík [41]
82Zsolt Tuza [17]
83Pavel Valtr [36] [42]
84Bernd Voigt [13]
85Gerhard J. Woeginger [74] [75] [88]
86Nicholas C. Wormald [91]
87Xuding Zhu [38] [61] [85]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)