The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Kyncl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan Kyncl, János Pach, Géza Tóth
    Long Alternating Paths in Bicolored Point Sets. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:340-348 [Conf]
  2. Jan Kyncl, Pavel Valtr
    On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:274-284 [Conf]
  3. Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
    Three Optimal Algorithms for Balls of Three Colors. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:206-217 [Conf]

  4. On Three Parameters of Invisibility Graphs. [Citation Graph (, )][DBLP]


  5. Improvement on the Decay of Crossing Numbers. [Citation Graph (, )][DBLP]


  6. The Complexity of Several Realizability Problems for Abstract Topological Graphs. [Citation Graph (, )][DBLP]


  7. Hamiltonian Alternating Paths on Bicolored Double-Chains. [Citation Graph (, )][DBLP]


  8. Graph Sharing Games: Complexity and Connectivity. [Citation Graph (, )][DBLP]


  9. Solution of Peter Winkler's Pizza Problem. [Citation Graph (, )][DBLP]


  10. Solution of Peter Winkler's Pizza Problem [Citation Graph (, )][DBLP]


  11. Long alternating paths in bicolored point sets. [Citation Graph (, )][DBLP]


  12. On edges crossing few other edges in simple topological complete graphs. [Citation Graph (, )][DBLP]


  13. Enumeration of simple complete topological graphs. [Citation Graph (, )][DBLP]


Search in 0.515secs, Finished in 0.516secs
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