Jan Kára

25 papers A* 2A 2B 2Misc 2Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2012 J jnl
The complexity of surjective homomorphism problems - a survey.
Discret. Appl. Math.
Manuel Bodirsky, Jan Kára, Barnaby Martin
2011 J jnl
The Complexity of Surjective Homomorphism Problems -- a Survey
CoRR
Manuel Bodirsky, Jan Kára, Barnaby Martin
2010 J jnl
A fast algorithm and datalog inexpressibility for temporal reasoning.
ACM Trans. Comput. Log.
Manuel Bodirsky, Jan Kára
2010 J jnl
Pattern Hypergraphs.
Electron. J. Comb.
Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác
2010 J jnl
The complexity of temporal constraint satisfaction problems.
J. ACM
Manuel Bodirsky, Jan Kára
2009 J jnl
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.
J. Graph Algorithms Appl.
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
2009 J jnl
Maximal infinite-valued constraint languages.
Theor. Comput. Sci.
Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
2008 J jnl
A Fast Algorithm and Lower Bound for Temporal Reasoning
CoRR
Manuel Bodirsky, Jan Kára
2008 J jnl
The Complexity of Equality Constraint Languages.
Theory Comput. Syst.
Manuel Bodirsky, Jan Kára
2008 A* conf
The complexity of temporal constraint satisfaction problems.
STOC
Manuel Bodirsky, Jan Kára
2007 A conf
Clustered Planarity: Small Clusters in Eulerian Graphs.
GD
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
2007 A* conf
Maximal Infinite-Valued Constraint Languages.
ICALP
Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
2007 J jnl
Noncrossing Hamiltonian paths in geometric graphs.
Discret. Appl. Math.
Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára
2007 J jnl
On the Complexity of the Balanced Vertex Ordering Problem.
Discret. Math. Theor. Comput. Sci.
Jan Kára, Jan Kratochvíl, David R. Wood
2006 — conf
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs.
IWPEC
Jan Kára, Jan Kratochvíl
2006 J jnl
Free binary decision diagrams for the computation of EAR
Comput. Complex.
Jan Kára, Daniel Král
2006 Misc conf
The Complexity of Equality Constraint Languages.
CSR
Manuel Bodirsky, Jan Kára
2005 J jnl
On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane.
Discret. Comput. Geom.
Jan Kára, Attila Pór, David R. Wood
2005 Misc conf
On the Complexity of the Balanced Vertex Ordering Problem.
COCOON
Jan Kára, Jan Kratochvíl, David R. Wood
2004 — conf
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.
SWAT
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
2003 J jnl
Free Binary Decision Diagrams for Computation of EAR
Electron. Colloquium Comput. Complex.
Jan Kára, Daniel Král
2003 J jnl
Minimum Degree and the Number of Chords.
Ars Comb.
Jan Kára, Daniel Král
2003 A conf
Noncrossing Hamiltonian Paths in Geometric Graphs.
GD
Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára
2002 B conf
Complexity of Pattern Coloring of Cycle Systems.
WG
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
2002 B conf
Optimal Free Binary Decision Diagrams for Computation of EAR
MFCS
Jan Kára, Daniel Král