The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel Král: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Král
    On Complexity of Colouring Mixed Hypertrees. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:516-524 [Conf]
  2. Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác
    On Intersection Graphs of Segments with Prescribed Slopes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:261-271 [Conf]
  3. Zdenek Dvorak, Daniel Král, Ondrej Pangrác
    Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:469-480 [Conf]
  4. Jan Kára, Daniel Král
    Optimal Free Binary Decision Diagrams for Computation of EARn. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:411-422 [Conf]
  5. Daniel Král
    Algebraic an Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:477-487 [Conf]
  6. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
    Complexity Note on Mixed Hypergraphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:474-486 [Conf]
  7. Daniel Král, Pavel Nejedlý
    Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:274-286 [Conf]
  8. Daniel Král, Ondrej Pangrác
    An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:603-614 [Conf]
  9. Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall
    Two algorithms for general list matrix partitions. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:870-876 [Conf]
  10. Daniel Král
    Locally satisfiable formulas. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:330-339 [Conf]
  11. Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
    Three Optimal Algorithms for Balls of Three Colors. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:206-217 [Conf]
  12. Daniel Král
    Computing Representations of Matroids of Bounded Branch-Width. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:224-235 [Conf]
  13. Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác
    An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:236-247 [Conf]
  14. Manuel Bodirsky, Daniel Král
    Locally Consistent Constraint Satisfaction Problems with Binary Constraints. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:295-306 [Conf]
  15. Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác
    Complexity of Pattern Coloring of Cycle Systems. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:164-175 [Conf]
  16. Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
    Coloring Mixed Hypertrees. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:279-289 [Conf]
  17. Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger
    Complexity of Coloring Graphs without Forbidden Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:254-262 [Conf]
  18. Jan Kára, Daniel Král
    Minimum Degree and the Number of Chords. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:68, n:, pp:- [Journal]
  19. Jan Kára, Daniel Král
    Free binary decision diagrams for the computation of EARn. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:1, pp:40-61 [Journal]
  20. Veselin Jungic, Daniel Král, Riste Skrekovski
    Colorings Of Plane Graphs With No Rainbow Faces. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:2, pp:169-182 [Journal]
  21. Zdenek Dvorak, Daniel Král
    On Planar Mixed Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  22. Daniel Král
    On Feasible Sets of Mixed Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  23. Daniel Král
    An exact algorithm for the channel assignment problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:326-331 [Journal]
  24. Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
    Coloring mixed hypertrees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:4, pp:660-672 [Journal]
  25. Daniel Král
    Hajós' theorem for list coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:161-163 [Journal]
  26. Daniel Král
    On maximum face-constrained coloring of plane graphs with no short face cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:277, n:1-3, pp:301-307 [Journal]
  27. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
    Mixed hypercacti. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:1-2, pp:99-113 [Journal]
  28. Mieczyslaw Borowiecki, Stanislav Jendrol, Daniel Král, Jozef Miskuf
    List coloring of Cartesian products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1955-1958 [Journal]
  29. Daniel Král
    Mixed hypergraphs and other coloring problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:923-938 [Journal]
  30. Daniel Král
    Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:13, pp:- [Journal]
  31. Daniel Král
    Locally satisfiable formulas [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:050, pp:- [Journal]
  32. Jan Kára, Daniel Král
    Free Binary Decision Diagrams for Computation of EARn [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:061, pp:- [Journal]
  33. Zdenek Dvorak, Daniel Král, Ondrej Pangrác
    Locally consistent constraint satisfaction problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:051, pp:- [Journal]
  34. Zdenek Dvorak, Daniel Král, Riste Skrekovski
    Coloring face hypergraphs on surfaces. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:1, pp:95-110 [Journal]
  35. Daniel Král, Tomás Madaras, Riste Skrekovski
    Cyclic, diagonal and facial colorings. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:3-4, pp:473-490 [Journal]
  36. Daniel Král, Riste Skrekovski
    Borodin's conjecture on diagonal coloring is false. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:813-816 [Journal]
  37. Zdenek Dvorak, Tomás Kaiser, Daniel Král
    Eulerian colorings and the bipartizing matchings conjecture of Fleischner. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1088-1101 [Journal]
  38. Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal
    Pancyclicity of Strong Products of Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:1, pp:91-104 [Journal]
  39. Tomás Kaiser, Daniel Král, Riste Skrekovski
    A revival of the girth conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:1, pp:41-53 [Journal]
  40. Daniel Král
    Extending partial 5-colorings and 6-colorings in planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:1, pp:100-110 [Journal]
  41. Daniel Král, Heinz-Jürgen Voss
    Edge-disjoint odd cycles in planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:107-120 [Journal]
  42. Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu
    The circular chromatic index of graphs of high girth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:1, pp:1-13 [Journal]
  43. Jirí Fiala, Daniel Král, Riste Skrekovski
    A Brooks-Type Theorem for the Generalized List T-Coloring. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:588-609 [Journal]
  44. Daniel Král
    Coloring Powers of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:451-461 [Journal]
  45. Daniel Král, Riste Skrekovski
    A Theorem about the Channel Assignment Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:3, pp:426-437 [Journal]
  46. Zdenek Dvorak, Daniel Král, Ondrej Pangrác
    Locally consistent constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:187-206 [Journal]
  47. Daniel Král
    Group coloring is Pi2P-complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:99-111 [Journal]
  48. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
    Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:263-278 [Journal]
  49. Daniel Král, Vladan Majerech, Jiri Sgall, Tomás Tichý, Gerhard J. Woeginger
    It is tough to be a plumber. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:473-484 [Journal]
  50. Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský
    Hamilton cycles in strong products of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:299-321 [Journal]
  51. Daniel Král, Jiri Sgall
    Coloring graphs from lists with bounded size of their union. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:3, pp:177-186 [Journal]
  52. Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss
    A note on group colorings. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:2, pp:123-129 [Journal]
  53. Daniel Král, Riste Skrekovski
    The last excluded case of Dirac's map-color theorem for choosability. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:4, pp:319-354 [Journal]
  54. Daniel Král, Ladislav Stacho
    Closure for the property of having a hamiltonian prism. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:3, pp:209-220 [Journal]

  55. Coloring Triangle-Free Graphs on Surfaces. [Citation Graph (, )][DBLP]


  56. Coloring triangle-free graphs on surfaces. [Citation Graph (, )][DBLP]


  57. Algorithms for Classes of Graphs with Bounded Expansion. [Citation Graph (, )][DBLP]


  58. Coloring even-faced graphs in the torus and the Klein bottle. [Citation Graph (, )][DBLP]


  59. The Circular Chromatic Index of Flower Snarks. [Citation Graph (, )][DBLP]


  60. Decomposition width - a new width parameter for matroids [Citation Graph (, )][DBLP]


  61. Randomized strategies for the plurality problem. [Citation Graph (, )][DBLP]


  62. Graph labellings with variable weights, a survey. [Citation Graph (, )][DBLP]


  63. Distance constrained labelings of planar graphs with no short cycles. [Citation Graph (, )][DBLP]


  64. Distance constrained labelings of K4-minor free graphs. [Citation Graph (, )][DBLP]


  65. Labeling planar graphs with a condition at distance two. [Citation Graph (, )][DBLP]


  66. Cyclic, diagonal and facial colorings - a missing case. [Citation Graph (, )][DBLP]


  67. Coloring squares of planar graphs with girth six. [Citation Graph (, )][DBLP]


  68. Projective, affine, and abelian colorings of cubic graphs. [Citation Graph (, )][DBLP]


Search in 0.061secs, Finished in 0.064secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002