The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jaroslav Nesetril: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manuel Bodirsky, Jaroslav Nesetril
    Constraint Satisfaction with Countable Homogeneous Templates. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:44-57 [Conf]
  2. Jana Maxová, Jaroslav Nesetril
    Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:711-722 [Conf]
  3. Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos
    H-Colorings of Large Degree Graphs. [Citation Graph (0, 0)][DBLP]
    EurAsia-ICT, 2002, pp:850-857 [Conf]
  4. Jaroslav Nesetril, Ales Pultr
    A Dushnik - Miller Type Dimension of Graphs and its Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:482-493 [Conf]
  5. Jan Adamec, Jaroslav Nesetril
    Towards an Aesthetic Invariant for Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:287-296 [Conf]
  6. Jaroslav Nesetril
    Art of Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:267-275 [Conf]
  7. Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo
    Posets, Boolean Representations and Quick Path Searching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:404-424 [Conf]
  8. Martin Loebl, Jaroslav Nesetril
    Postorder Hierarchy for Path Compressions and Set Union. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1988, pp:146-151 [Conf]
  9. Jaroslav Nesetril
    Representations of Graphs by Means of Products and Their Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:94-102 [Conf]
  10. Jaroslav Nesetril, Daniel Turzík
    Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP). [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:70-85 [Conf]
  11. Martin Loebl, Jaroslav Nesetril
    Linearity and Unprovability of Set Union Problem Strategies [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:360-366 [Conf]
  12. Jaroslav Nesetril, Patrice Ossona de Mendez
    Linear time low tree-width partitions and algorithmic consequences. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:391-400 [Conf]
  13. Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo
    Efficient Representation of Taxonomies. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:232-240 [Conf]
  14. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
    More about Subcolorings. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:68-79 [Conf]
  15. Jan Foniok, Jaroslav Nesetril, Claude Tardif
    Generalised Dualities and Finite Maximal Antichains. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:27-36 [Conf]
  16. Jaroslav Nesetril
    Ramsey classes of topological and metric spaces. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:143, n:1-3, pp:147-154 [Journal]
  17. Jaroslav Nesetril, Vojtech Rödl
    Simple proof of the existence of restricted Ramsey graphs by means of a partite construction. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:2, pp:199-202 [Journal]
  18. Jaroslav Nesetril, Vojtech Rödl
    Sparse Ramsey graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:1, pp:71-78 [Journal]
  19. Jaroslav Nesetril, Eric Sopena
    On the Oriented Game Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  20. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
    More About Subcolorings. [Citation Graph (0, 0)][DBLP]
    Computing, 2002, v:69, n:3, pp:187-203 [Journal]
  21. Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic
    Rainbow Arithmetic Progressions and Anti-Ramsey Results. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:599-620 [Journal]
  22. Alexandr V. Kostochka, Jaroslav Nesetril
    Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:5, pp:- [Journal]
  23. Jaroslav Nesetril
    Ramsey Classes and Homogeneous Structures. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:171-189 [Journal]
  24. Jaroslav Nesetril, Pavel Valtr
    A Ramsey-type Theorem in the Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:127-135 [Journal]
  25. Pavol Hell, Jaroslav Nesetril, Xuding Zhu
    Complexity of Tree Homomorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:70, n:1, pp:23-36 [Journal]
  26. Jaroslav Nesetril
    on ordered Graphs and Graph orderings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:113-116 [Journal]
  27. Matt DeVos, Jaroslav Nesetril, André Raspaud
    Antisymmetric flows and edge-connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:161-167 [Journal]
  28. Paul A. Dreyer Jr., Christopher Malon, Jaroslav Nesetril
    Universal H-colorable graphs without a given configuration. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:245-252 [Journal]
  29. Shalom Eliahou, Isidoro Gitler, Jaroslav Nesetril
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:302, n:1-3, pp:1-3 [Journal]
  30. Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:1-2 [Journal]
  31. 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). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:1-2 [Journal]
  32. Anna Galluccio, Pavol Hell, Jaroslav Nesetril
    The complexity of H-colouring of bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:101-109 [Journal]
  33. Bernhard Korte, Jaroslav Nesetril
    Vojtech Jarni'k's work in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:1-17 [Journal]
  34. Alexandr V. Kostochka, Jaroslav Nesetril, P. Smolíková
    Colorings and homomorphisms of degenerate and bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:257-276 [Journal]
  35. Martin Loebl, Jaroslav Nesetril, Bruce A. Reed
    A note on random homomorphism from arbitrary graphs to Z. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:173-181 [Journal]
  36. Jana Maxová, Jaroslav Nesetril
    On oriented path double covers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:371-380 [Journal]
  37. Jana Maxová, Jaroslav Nesetril
    On covers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:287-294 [Journal]
  38. Jaroslav Nesetril, Patrice Ossona de Mendez
    Cuts and bounds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:302, n:1-3, pp:211-224 [Journal]
  39. Jaroslav Nesetril, Eva Milková, Helena Nesetrilová
    Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:3-36 [Journal]
  40. Jaroslav Nesetril, Marc Noy, Oriol Serra
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:1-6 [Journal]
  41. Jaroslav Nesetril, Ales Pultr
    A note on homomorphism-independent families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:327-334 [Journal]
  42. Jaroslav Nesetril, Moshe Rosenfeld
    I. Schur, C.E. Shannon and Ramsey Numbers, a short story. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:185-195 [Journal]
  43. Jaroslav Nesetril, Xuding Zhu
    Construction of sparse graphs with prescribed circular colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:277-291 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:399-423 [Journal]
  45. Jan Hubicka, Jaroslav Nesetril
    Universal partial order represented by means of oriented trees and other simple graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:765-778 [Journal]
  46. Alexandr V. Kostochka, Jaroslav Nesetril
    Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:1, pp:37-41 [Journal]
  47. Alexandr V. Kostochka, Jaroslav Nesetril
    Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:1, pp:103-110 [Journal]
  48. Timothy Marshall, Reza Nasraser, Jaroslav Nesetril
    Homomorphism bounded classes of graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:4, pp:592-600 [Journal]
  49. Jaroslav Nesetril, Patrice Ossona de Mendez
    Tree-depth, subgraph coloring and homomorphism bounds. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:6, pp:1022-1041 [Journal]
  50. Jaroslav Nesetril, Saharon Shelah
    On the order of countable graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:6, pp:649-663 [Journal]
  51. Jaroslav Nesetril
    Preface. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1055-1058 [Journal]
  52. Jaroslav Nesetril, Yared Nigussie
    Minimal universal and dense minor closed classes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1159-1171 [Journal]
  53. Tomasz Luczak, Jaroslav Nesetril
    When is a random graph projective? [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1147-1154 [Journal]
  54. Winfried Hochstättler, Jaroslav Nesetril
    Antisymmetric flows in matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1129-1134 [Journal]
  55. Jaroslav Nesetril
    Metric spaces are Ramsey. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:1, pp:457-468 [Journal]
  56. Martin Loebl, Jaroslav Nesetril
    Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:207-220 [Journal]
  57. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    Nilpotent Families of Endomorphisms of (p(V)+, cup). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:100-108 [Journal]
  58. Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril
    Epidemiography II. Games with a dozing yet winning player. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:1, pp:129-144 [Journal]
  59. Ronald L. Graham, Jaroslav Nesetril
    Large minimal sets which force long arithmetic progressions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:2, pp:270-276 [Journal]
  60. András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
    Local k-colorings of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:127-139 [Journal]
  61. Pavol Hell, Jaroslav Nesetril
    On the complexity of H-coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:1, pp:92-110 [Journal]
  62. Jaroslav Nesetril, Pavel Valtr
    A Ramsey Property of Order Types. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:81, n:1, pp:88-107 [Journal]
  63. Jaroslav Nesetril, Xuding Zhu
    On sparse graphs with given colorings and homomorphisms. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:161-172 [Journal]
  64. Jaroslav Nesetril
    Partitions of Finite Relational and Set Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:22, n:3, pp:289-312 [Journal]
  65. Jaroslav Nesetril
    For graphs there are only four types of hereditary Ramsey classes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:127-132 [Journal]
  66. Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt
    Canonizing Ordering Theorems for Hales Jewett Structures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:2, pp:394-408 [Journal]
  67. Jaroslav Nesetril, André Raspaud
    Colored Homomorphisms of Colored Mixed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:147-155 [Journal]
  68. Jaroslav Nesetril, Vojtech Rödl
    Another Proof of the Folkman-Rado-Sanders Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:1, pp:108-109 [Journal]
  69. Jaroslav Nesetril, Vojtech Rödl
    Ramsey Classes of Set Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:2, pp:183-201 [Journal]
  70. Jaroslav Nesetril, Vojtech Rödl
    Chromatically optimal rigid graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:133-141 [Journal]
  71. Jaroslav Nesetril, Claude Tardif
    Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:80-97 [Journal]
  72. Jaroslav Nesetril, Patrice Ossona de Mendez
    Folding. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:5, pp:730-739 [Journal]
  73. M. E. Adams, Jaroslav Nesetril, J. Sichler
    Quotients of rigid graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:3, pp:351-359 [Journal]
  74. László Lovász, Jaroslav Nesetril, Ales Pultr
    On a product dimension of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:1, pp:47-67 [Journal]
  75. Jaroslav Nesetril, Vojtech Rödl
    A short proof of the existence of highly chromatic hypergraphs without short cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:225-227 [Journal]
  76. Jaroslav Nesetril
    Art of Graph Drawing and Art. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2002, v:6, n:1, pp:131-147 [Journal]
  77. Manuel Bodirsky, Jaroslav Nesetril
    Constraint Satisfaction with Countable Homogeneous Templates. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2006, v:16, n:3, pp:359-373 [Journal]
  78. Jan Hubicka, Jaroslav Nesetril
    Finite Paths are Universal. [Citation Graph (0, 0)][DBLP]
    Order, 2005, v:22, n:1, pp:21-40 [Journal]
  79. Jan Hubicka, Jaroslav Nesetril
    Finite Paths are Universal. [Citation Graph (0, 0)][DBLP]
    Order, 2004, v:21, n:3, pp:181-200 [Journal]
  80. Tomasz Luczak, Jaroslav Nesetril
    A Probabilistic Approach to the Dichotomy Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:835-843 [Journal]
  81. Peter Alles, Jaroslav Nesetril, Svatopluk Poljak
    Extendability, Dimensions, and Diagrams of Cycle Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:4, pp:453-471 [Journal]
  82. Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril
    Noncrossing Subgraphs in Topological Layouts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:223-244 [Journal]
  83. Jaroslav Nesetril, Claude Tardif
    Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:914-920 [Journal]
  84. Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo
    On Locally Presented Posets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:2, pp:251-260 [Journal]
  85. Ludek Kucera, Jaroslav Nesetril, Ales Pultr
    Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:93-106 [Journal]
  86. Jaroslav Nesetril
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:355-357 [Journal]
  87. Jaroslav Nesetril
    Some Nonstandard Ramsey Like Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:34, n:, pp:3-15 [Journal]
  88. Jaroslav Nesetril, Claude Tardif
    Density via duality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:585-591 [Journal]
  89. Jaroslav Nesetril, Gerhard J. Woeginger
    Graph colorings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:1- [Journal]
  90. Jaroslav Nesetril, Nicholas C. Wormald
    The acyclic edge chromatic number of a random d-regular graph is d + 1. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:1, pp:69-74 [Journal]
  91. Jaroslav Nesetril, Yared Nigussie
    Density of universal classes of series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:1, pp:13-23 [Journal]
  92. Tomasz Luczak, Jaroslav Nesetril
    Note on projective graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:81-86 [Journal]
  93. Gábor Kun, Jaroslav Nesetril
    NP by Means of Lifts and Shadows. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:171-181 [Conf]
  94. Jaroslav Nesetril, Mark Siggers
    Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:159-170 [Conf]
  95. Gábor Kun, Jaroslav Nesetril
    NP by means of lifts and shadows [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  96. Stefan A. Burr, Jaroslav Nesetril, Vojtech Rödl
    On the use of senders in generalized ramsey theory for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:1-13 [Journal]
  97. Jaroslav Nesetril, Vojtech Rödl
    Two remarks on Ramsey's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:3, pp:339-341 [Journal]
  98. Jaroslav Nesetril, Vojtech Rödl
    The partite construction and ramsey set systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:327-334 [Journal]
  99. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:77-89 [Journal]
  100. Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    On universal graphs for planar oriented graphs of a given girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:73-85 [Journal]
  101. Graham Brightwell, Jaroslav Nesetril
    Reorientations of covering graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:129-132 [Journal]
  102. Jaroslav Nesetril, Vojtech Rödl
    On Ramsey graphs without bipartite subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:223-229 [Journal]
  103. Wilfried Imrich, Jaroslav Nesetril
    Simple tournaments and sharply transitive groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:159-165 [Journal]
  104. Jaroslav Nesetril
    Z. Frolík and his winter schools. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:1-2 [Journal]
  105. Pavol Hell, Jaroslav Nesetril
    The core of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:117-126 [Journal]
  106. Pavol Gvozdjak, Jaroslav Nesetril
    High girth and extendability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:77-84 [Journal]
  107. Jaroslav Nesetril, Martin Bálek
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:1969-1971 [Journal]

  108. Homomorphism-Homogeneous Relational Structures. [Citation Graph (, )][DBLP]


  109. A surprising permanence of old motivations (a not-so-rigid story). [Citation Graph (, )][DBLP]


  110. Preface. [Citation Graph (, )][DBLP]


  111. A dualistic approach to bounding the chromatic number of a graph. [Citation Graph (, )][DBLP]


  112. Preface. [Citation Graph (, )][DBLP]


  113. Grad and classes with bounded expansion I. Decompositions. [Citation Graph (, )][DBLP]


  114. Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. [Citation Graph (, )][DBLP]


  115. On tension-continuous mappings. [Citation Graph (, )][DBLP]


  116. Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. [Citation Graph (, )][DBLP]


  117. Grad and classes with bounded expansion II. Algorithmic aspects. [Citation Graph (, )][DBLP]


  118. Forbidden lifts (NP and CSP for combinatorialists). [Citation Graph (, )][DBLP]


  119. Dualities in full homomorphisms. [Citation Graph (, )][DBLP]


  120. A combinatorial constraint satisfaction problem dichotomy classification conjecture. [Citation Graph (, )][DBLP]


  121. Homomorphisms and polynomial invariants of graphs. [Citation Graph (, )][DBLP]


  122. Preface. [Citation Graph (, )][DBLP]


  123. Fraternal augmentations, arrangeability and linear Ramsey numbers. [Citation Graph (, )][DBLP]


  124. Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms. [Citation Graph (, )][DBLP]


Search in 0.083secs, Finished in 0.088secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002