Optimal Free Binary Decision Diagrams for Computation of EARn. - Jan Kára; Daniel Král (MFCS, 2002)

Complexity of Pattern Coloring of Cycle Systems. - Zdenek Dvorák 001; Jan Kára; Daniel Král; Ondrej Pangrác (WG, 2002)

Minimum Degree and the Number of Chords. - Jan Kára; Daniel Král (Ars Comb., 2003)

Free Binary Decision Diagrams for Computation of EARn - Jan Kára; Daniel Král (Electron. Colloquium Comput. Complex., 2003)

An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. - Zdenek Dvorák 001; Jan Kára; Daniel Král; Ondrej Pangrác (SWAT, 2004)

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. - Jan Kára; Attila Pór; David R. Wood (Discret. Comput. Geom., 2005)

Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. - Jan Kára; Jan Kratochvíl (IWPEC, 2006)

Free binary decision diagrams for the computation of EARn. - Jan Kára; Daniel Král (Comput. Complex., 2006)

Clustered Planarity: Small Clusters in Eulerian Graphs. - Eva Jelínková; Jan Kára; Jan Kratochvíl; Martin Pergel; Ondrej Suchý 001; Tomás Vyskocil (GD, 2007)

Noncrossing Hamiltonian paths in geometric graphs. - Jakub Cerný; Zdenek Dvorák 001; Vít Jelínek; Jan Kára (Discret. Appl. Math., 2007)

On the Complexity of the Balanced Vertex Ordering Problem. - Jan Kára; Jan Kratochvíl; David R. Wood (Discret. Math. Theor. Comput. Sci., 2007)

A Fast Algorithm and Lower Bound for Temporal Reasoning - Manuel Bodirsky; Jan Kára (CoRR, 2008)

The Complexity of Equality Constraint Languages. - Manuel Bodirsky; Jan Kára (Theory Comput. Syst., 2008)

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. - Eva Jelínková; Jan Kára; Jan Kratochvíl; Martin Pergel; Ondrej Suchý 001; Tomás Vyskocil (J. Graph Algorithms Appl., 2009)

Maximal infinite-valued constraint languages. - Manuel Bodirsky; Hubie Chen; Jan Kára; Timo von Oertzen (Theor. Comput. Sci., 2009)

Pattern Hypergraphs. - Zdenek Dvorák 001; Jan Kára; Daniel Král'; Ondrej Pangrác (Electron. J. Comb., 2010)

The complexity of temporal constraint satisfaction problems. - Manuel Bodirsky; Jan Kára (J. ACM, 2010)

A fast algorithm and datalog inexpressibility for temporal reasoning. - Manuel Bodirsky; Jan Kára (ACM Trans. Comput. Log., 2010)

The complexity of surjective homomorphism problems - a survey. - Manuel Bodirsky; Jan Kára; Barnaby Martin (Discret. Appl. Math., 2012)