|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Josef Cibulka, Jan Kyncl |
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension.  |
J. Comb. Theory, Ser. A  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl |
Ramsey-type constructions for arrangements of segments. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Cerný, Jan Kyncl, Géza Tóth |
Improvement on the decay of crossing numbers |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr |
Graph sharing games: complexity and connectivity |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl |
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jan Kyncl |
Simple Realizability of Complete Abstract Topological Graphs in P. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl |
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr |
Universal Sets for Straight-Line Embeddings of Bicolored Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jan Kyncl, Martin Novotný |
Education of Digital and Analog Circuits supported by computer algebra system. |
ISCAS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl, Tomás Vyskocil |
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case. |
TOCT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr |
Graph Sharing Games: Complexity and Connectivity. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr |
On Three Parameters of Invisibility Graphs. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl, Tomás Vyskocil |
Logspace reduction of directed reachability for bounded genus graphs to the planar case. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jan Kyncl, Pavel Valtr |
On edges crossing few other edges in simple topological complete graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl |
Enumeration of simple complete topological graphs. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla |
Monochromatic triangles in two-colored plane. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický |
6-Critical Graphs on the Klein Bottle. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr |
Solution of Peter Winkler's Pizza Problem. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický |
Six-Critical Graphs on the Klein Bottle. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl |
Ramsey-type constructions for arrangements of segments. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl, János Pach, Géza Tóth |
Long alternating paths in bicolored point sets. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl, Martin Tancer |
The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr |
Solution of Peter Winkler's Pizza Problem |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr |
Hamiltonian Alternating Paths on Bicolored Double-Chains. |
Graph Drawing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl |
Enumeration of simple complete topological graphs. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks |
Probabilistic strategies for the partition and plurality problems. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl |
The Complexity of Several Realizability Problems for Abstract Topological Graphs. |
Graph Drawing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Cerný, Jan Kyncl, Géza Tóth |
Improvement on the Decay of Crossing Numbers. |
Graph Drawing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks |
Three Optimal Algorithms for Balls of Three Colors. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl, Pavel Valtr |
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. |
Graph Drawing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kyncl, János Pach, Géza Tóth |
Long Alternating Paths in Bicolored Point Sets. |
Graph Drawing |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")