default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Kára
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j12]Manuel Bodirsky
, Jan Kára, Barnaby Martin:
The complexity of surjective homomorphism problems - a survey. Discret. Appl. Math. 160(12): 1680-1690 (2012)- 2011
- [i3]Manuel Bodirsky, Jan Kára, Barnaby Martin:
The Complexity of Surjective Homomorphism Problems -- a Survey. CoRR abs/1104.5257 (2011) - 2010
- [j11]Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác:
Pattern Hypergraphs. Electron. J. Comb. 17(1) (2010) - [j10]Manuel Bodirsky, Jan Kára:
The complexity of temporal constraint satisfaction problems. J. ACM 57(2): 9:1-9:41 (2010) - [j9]Manuel Bodirsky, Jan Kára:
A fast algorithm and datalog inexpressibility for temporal reasoning. ACM Trans. Comput. Log. 11(3): 15:1-15:21 (2010)
2000 – 2009
- 2009
- [j8]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): 379-422 (2009) - [j7]Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410(18): 1684-1693 (2009) - 2008
- [j6]Manuel Bodirsky, Jan Kára:
The Complexity of Equality Constraint Languages. Theory Comput. Syst. 43(2): 136-158 (2008) - [c10]Manuel Bodirsky, Jan Kára:
The complexity of temporal constraint satisfaction problems. STOC 2008: 29-38 - [i2]Manuel Bodirsky, Jan Kára:
A Fast Algorithm and Lower Bound for Temporal Reasoning. CoRR abs/0805.1473 (2008) - 2007
- [j5]Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára:
Noncrossing Hamiltonian paths in geometric graphs. Discret. Appl. Math. 155(9): 1096-1105 (2007) - [j4]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) - [c9]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Eulerian Graphs. GD 2007: 303-314 - [c8]Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557 - 2006
- [j3]Jan Kára, Daniel Král:
Free binary decision diagrams for the computation of EARn. Comput. Complex. 15(1): 40-61 (2006) - [c7]Manuel Bodirsky, Jan Kára:
The Complexity of Equality Constraint Languages. CSR 2006: 114-126 - [c6]Jan Kára, Jan Kratochvíl:
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. IWPEC 2006: 166-174 - 2005
- [j2]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): 497-506 (2005) - [c5]Jan Kára, Jan Kratochvíl, David R. Wood:
On the Complexity of the Balanced Vertex Ordering Problem. COCOON 2005: 849-858 - 2004
- [c4]Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247 - 2003
- [j1]Jan Kára, Daniel Král:
Minimum Degree and the Number of Chords. Ars Comb. 68 (2003) - [c3]Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára:
Noncrossing Hamiltonian Paths in Geometric Graphs. GD 2003: 86-97 - [i1]Jan Kára, Daniel Král:
Free Binary Decision Diagrams for Computation of EARn. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c2]Jan Kára, Daniel Král:
Optimal Free Binary Decision Diagrams for Computation of EARn. MFCS 2002: 411-422 - [c1]Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
