Jan Kára

Available identifiers

zbMath Open kara.janDBLP46/3042WikidataQ95146933 ScholiaQ95146933MaRDI QIDQ444432

List of research outcomes

Publication	Date of Publication	Type
A fast algorithm and datalog inexpressibility for temporal reasoning	2015-09-17	Paper
The complexity of surjective homomorphism problems-a survey	2012-08-14	Paper
The complexity of temporal constraint satisfaction problems	2010-07-14	Paper
Pattern hypergraphs	2010-03-26	Paper
Clustered planarity: small clusters in cycles and Eulerian graphs	2010-02-04	Paper
Graph Drawing	2009-08-11	Paper
Maximal infinite-valued constraint languages	2009-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q3549679	2009-01-05	Paper
The complexity of equality constraint languages	2008-06-17	Paper
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs	2008-06-03	Paper
On the complexity of the balanced vertex ordering problem	2008-05-27	Paper
Clustered Planarity: Small Clusters in Eulerian Graphs	2008-03-25	Paper
Maximal Infinite-Valued Constraint Languages	2007-11-28	Paper
Noncrossing Hamiltonian paths in geometric graphs	2007-06-08	Paper
The Complexity of Equality Constraint Languages	2007-05-02	Paper
Free binary decision diagrams for the computation of \(\text{EAR}_{ n }\)	2006-09-28	Paper
On the number of intersections of two polygons.	2006-09-13	Paper
Computing and Combinatorics	2006-01-11	Paper
On the chromatic number of the visibility graph of a set of points in the plane	2005-11-10	Paper
Algorithm Theory - SWAT 2004	2005-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q5466086	2005-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4414494	2003-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4708589	2003-06-18	Paper

Research outcomes over time

This page was built for person: Jan Kára