prof. RNDr. Daniel Kráľ, Ph.D., DSc.
Professor, Department of Computer Science
Office: C517
Botanická 554/68a
602 00 Brno
Phone: | +420 549 49 6337 |
---|---|
E‑mail: |
social and academic networks: |
---|
Total number of publications: 171
2005
-
Locally consistent constraint satisfaction problems with binary constraints
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, year: 2005, volume: 3787
-
Three optimal algorithms for balls of three colors
STACS 2005, PROCEEDINGS, year: 2005, volume: 3404
-
Two Algorithms for General List Matrix Partitions
, year: 2005
2004
-
A revival of the girth conjecture
JOURNAL OF COMBINATORIAL THEORY SERIES B, year: 2004, volume: 92, edition: 1, DOI
-
An algorithm for cyclic edge connectivity of cubic graphs
ALGORITHM THEORY- SWAT 2004, year: 2004, volume: 3111
-
Borodin's conjecture on diagonal coloring is false
European Journal of Combinatorics, year: 2004, volume: 25, edition: 6, DOI
-
Edge-disjoint odd cycles in planar graphs
JOURNAL OF COMBINATORIAL THEORY SERIES B, year: 2004, volume: 90, edition: 1, DOI
-
Group coloring and list group coloring are Pi(P)(2)-complete
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, year: 2004, volume: 3153
-
Hajos' theorem for list coloring
Discrete Mathematics, year: 2004, volume: 287, edition: 1-3, DOI
-
It is tough to be a plumber
Theoretical Computer Science, year: 2004, volume: 313, edition: 3, DOI