 | 2009 |
|---|
| 19 |       | Manuel Bodirsky,
Hubie Chen,
Jan Kára,
Timo von Oertzen:
Maximal infinite-valued constraint languages.
Theor. Comput. Sci. 410(18): 1684-1693 (2009) |
| 2008 |
|---|
| 18 | | Manuel Bodirsky,
Jan Kára:
The complexity of temporal constraint satisfaction problems.
STOC 2008: 29-38 |
| 17 | | Manuel Bodirsky,
Jan Kára:
A Fast Algorithm and Lower Bound for Temporal Reasoning
CoRR abs/0805.1473: (2008) |
| 16 | | Manuel Bodirsky,
Jan Kára:
The Complexity of Equality Constraint Languages.
Theory Comput. Syst. 43(2): 136-158 (2008) |
| 2007 |
|---|
| 15 | | Eva Jelínková,
Jan Kára,
Jan Kratochvíl,
Martin Pergel,
Ondrej Suchý,
Tomás Vyskocil:
Clustered Planarity: Small Clusters in Eulerian Graphs.
Graph Drawing 2007: 303-314 |
| 14 | | Manuel Bodirsky,
Hubie Chen,
Jan Kára,
Timo von Oertzen:
Maximal Infinite-Valued Constraint Languages.
ICALP 2007: 546-557 |
| 13 | | Jakub Cerný,
Zdenek Dvorak,
Vít Jelínek,
Jan Kára:
Noncrossing Hamiltonian paths in geometric graphs.
Discrete Applied Mathematics 155(9): 1096-1105 (2007) |
| 12 | | Jan Kára,
Jan Kratochvíl,
David R. Wood:
On the Complexity of the Balanced Vertex Ordering Problem.
Discrete Mathematics & Theoretical Computer Science 9(1): (2007) |
| 2006 |
|---|
| 11 | | Manuel Bodirsky,
Jan Kára:
The Complexity of Equality Constraint Languages.
CSR 2006: 114-126 |
| 10 | | Jan Kára,
Jan Kratochvíl:
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs.
IWPEC 2006: 166-174 |
| 9 | | Jan Kára,
Daniel Král:
Free binary decision diagrams for the computation of EARn.
Computational Complexity 15(1): 40-61 (2006) |
| 2005 |
|---|
| 8 | | Jan Kára,
Jan Kratochvíl,
David R. Wood:
On the Complexity of the Balanced Vertex Ordering Problem.
COCOON 2005: 849-858 |
| 7 | | Jan Kára,
Attila Pór,
David R. Wood:
On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane.
Discrete & Computational Geometry 34(3): 497-506 (2005) |
| 2004 |
|---|
| 6 | | Zdenek Dvorak,
Jan Kára,
Daniel Král,
Ondrej Pangrác:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.
SWAT 2004: 236-247 |
| 2003 |
|---|
| 5 | | Jakub Cerný,
Zdenek Dvorak,
Vít Jelínek,
Jan Kára:
Noncrossing Hamiltonian Paths in Geometric Graphs.
Graph Drawing 2003: 86-97 |
| 4 |  | Jan Kára,
Daniel Král:
Minimum Degree and the Number of Chords.
Ars Comb. 68: (2003) |
| 3 | | Jan Kára,
Daniel Král:
Free Binary Decision Diagrams for Computation of EARn
Electronic Colloquium on Computational Complexity (ECCC)(061): (2003) |
| 2002 |
|---|
| 2 | | Jan Kára,
Daniel Král:
Optimal Free Binary Decision Diagrams for Computation of EARn.
MFCS 2002: 411-422 |
| 1 | | Zdenek Dvorak,
Jan Kára,
Daniel Král,
Ondrej Pangrác:
Complexity of Pattern Coloring of Cycle Systems.
WG 2002: 164-175 |
