Jan Kára

Publication Activity (10 Years)

Years Active: 2002-2012
Publications (10 Years): 0

Top Topics

Computational Complexity

Top Venues

Discret. Appl. Math.

Publications

Manuel Bodirsky, Jan Kára, Barnaby Martin
The complexity of surjective homomorphism problems - a survey. Discret. Appl. Math. 160 (12) (2012)
Manuel Bodirsky, Jan Kára, Barnaby Martin
The Complexity of Surjective Homomorphism Problems -- a Survey CoRR (2011)
Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác
Pattern Hypergraphs. Electron. J. Comb. 17 (1) (2010)
Manuel Bodirsky, Jan Kára
A fast algorithm and datalog inexpressibility for temporal reasoning. ACM Trans. Comput. Log. 11 (3) (2010)
Manuel Bodirsky, Jan Kára
The complexity of temporal constraint satisfaction problems. J. ACM 57 (2) (2010)
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl. 13 (3) (2009)
Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410 (18) (2009)
Manuel Bodirsky, Jan Kára
The Complexity of Equality Constraint Languages. Theory Comput. Syst. 43 (2) (2008)
Manuel Bodirsky, Jan Kára
The complexity of temporal constraint satisfaction problems. STOC (2008)
Manuel Bodirsky, Jan Kára
A Fast Algorithm and Lower Bound for Temporal Reasoning CoRR (2008)
Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára
Noncrossing Hamiltonian paths in geometric graphs. Discret. Appl. Math. 155 (9) (2007)
Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
Maximal Infinite-Valued Constraint Languages. ICALP (2007)
Jan Kára, Jan Kratochvíl, David R. Wood
On the Complexity of the Balanced Vertex Ordering Problem. Discret. Math. Theor. Comput. Sci. 9 (1) (2007)
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)
Jan Kára, Jan Kratochvíl
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. IWPEC (2006)
Manuel Bodirsky, Jan Kára
The Complexity of Equality Constraint Languages. CSR (2006)
Jan Kára, Daniel Král
. Comput. Complex. 15 (1) (2006)
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. Discret. Comput. Geom. 34 (3) (2005)
Jan Kára, Jan Kratochvíl, David R. Wood
On the Complexity of the Balanced Vertex Ordering Problem. COCOON (2005)
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT (2004)
Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára
Noncrossing Hamiltonian Paths in Geometric Graphs. Graph Drawing (2003)
Jan Kára, Daniel Král
Electron. Colloquium Comput. Complex. (061) (2003)
Jan Kára, Daniel Král
Minimum Degree and the Number of Chords. Ars Comb. 68 (2003)
Jan Kára, Daniel Král
. MFCS (2002)
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
Complexity of Pattern Coloring of Cycle Systems. WG (2002)