The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Kára: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan Kára, Jan Kratochvíl, David R. Wood
    On the Complexity of the Balanced Vertex Ordering Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:849-858 [Conf]
  2. Manuel Bodirsky, Jan Kára
    The Complexity of Equality Constraint Languages. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:114-126 [Conf]
  3. Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára
    Noncrossing Hamiltonian Paths in Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:86-97 [Conf]
  4. Jan Kára, Jan Kratochvíl
    Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:166-174 [Conf]
  5. Jan Kára, Daniel Král
    Optimal Free Binary Decision Diagrams for Computation of EARn. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:411-422 [Conf]
  6. Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác
    An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:236-247 [Conf]
  7. Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác
    Complexity of Pattern Coloring of Cycle Systems. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:164-175 [Conf]
  8. Jan Kára, Daniel Král
    Minimum Degree and the Number of Chords. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:68, n:, pp:- [Journal]
  9. Jan Kára, Daniel Král
    Free binary decision diagrams for the computation of EARn. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:1, pp:40-61 [Journal]
  10. Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára
    Noncrossing Hamiltonian paths in geometric graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:9, pp:1096-1105 [Journal]
  11. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:497-506 [Journal]
  12. Jan Kára, Daniel Král
    Free Binary Decision Diagrams for Computation of EARn [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:061, pp:- [Journal]
  13. Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
    Maximal Infinite-Valued Constraint Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:546-557 [Conf]

  14. Clustered Planarity: Small Clusters in Eulerian Graphs. [Citation Graph (, )][DBLP]


  15. The complexity of temporal constraint satisfaction problems. [Citation Graph (, )][DBLP]


  16. A Fast Algorithm and Lower Bound for Temporal Reasoning [Citation Graph (, )][DBLP]


  17. On the Complexity of the Balanced Vertex Ordering Problem. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002