Publication Records

HLINĚNÝ, Petr, Markus CHIMANI and Petra MUTZEL. Approximating the Crossing Number of Apex Graphs. In Symposium Graph Drawing 2008, Lecture Notes in Computer Science. 5417th ed. Berlin: Springer Verlag, 2009, p. 432-434. ISBN 978-3-642-00218-2. Available from: https://dx.doi.org/10.1007/978-3-642-00219-9_42.

HLINĚNÝ, Petr and Gelasio SALAZAR. Stars and Bonds in Crossing-Critical Graphs. Electronic Notes in Discrete Mathematics. Elsevier, 2008, vol. 31, No 1, p. 271-275. ISSN 1571-0653.

HLINĚNÝ, Petr, Gelasio SALAZAR, Isidoro GITLER and Jesus LEANOS. The crossing number of a projective graph is quadratic in the face--width. Electronic Journal of Combinatorics. internet: -, 2008, vol. 15, No 1, p. R46, 8 pp. ISSN 1077-8926.

HLINĚNÝ, Petr. Approximating the Crossing Number for Graphs close to "Planarity". In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Abstracts collection, Dagstuhl Seminar 07281. Dagstuhl, Germany: Schloss Dagstuhl GmbH, 2007, p. 6-7. ISSN 1862-4405.

HLINĚNÝ, Petr and Gelasio SALAZAR. Approximating the Crossing Number of Toroidal Graphs. In International Symposium on Algorithms and Computation (ISAAC 2007). Berlin: Springer Verlag, 2007, p. 148-159. ISBN 978-3-540-77118-0.

HLINĚNÝ, Petr. New almost-planar crossing-critical graph families. In 6th Slovenian International Conference on Graph Theory. 2007. ISBN 978-961-212-198-3.

HLINĚNÝ, Petr and Gelasio SALAZAR. On the Crossing Number of Almost Planar Graphs. In Graph Drawing, Symposium GD2006. 4372nd ed. Berlin: Springer Verlag, 2007, p. 162-173. ISBN 3-540-70903-7.

HLINĚNÝ, Petr, Isidoro GITLER, Gelasio SALAZAR and Jesus LEANOS. The crossing number of a projective graph is quadratic in the face-width. In Czech-Slovak Conference on Graph Theory 2007, Hradec nad Moravicí. 2007. ISBN 978-80-248-1445-2.

HLINĚNÝ, Petr, Gelasio SALAZAR, Isidoro GITLER and Jesus LEANOS. The crossing number of a projective graph is quadratic in the face--width (Extended abstract). Electronic Notes in Discrete Mathematics. Elsevier, 2007, vol. 29, C, p. 219-223. ISSN 1571-0653.

HLINĚNÝ, Petr. Crossing Number is Hard for Cubic Graphs. Journal of Combinatorial Theory, Ser B. Amsterdam: Elsevier B.V., 2006, vol. 96, No 4, p. 455-471. ISSN 0095-8956.

HLINĚNÝ, Petr. On Matroid Representability and Minor Problems. In 31st International Symposium, MFCS 2006. 4162nd ed. Berlin: Springer Verlag, 2006, p. 505-516. ISBN 3-540-37791-3.

HLINĚNÝ, Petr and Gelasio SALAZAR. On the Crossing Number of Almost Planar Graphs. In 14th International Symposium on Graph Drawing, GD 2006. 2006.

HLINĚNÝ, Petr. On crossing-critical graphs. In GEMS 2005 Graph Embeddings and Maps on Surfaces. 2005.

HLINĚNÝ, Petr. On Crossing-Critical Graphs. In Workshop on Geometric Graphs, Asian Applied Computing Conference AACC2005. 2005.

HLINĚNÝ, Petr. Crossing-Number Critical Graphs have Bounded Pathwidth. Journal of Combinatorial Theory, Ser B. .: Elsevier B.V., 2003, vol. 88, No 3, p. 347-367. ISSN 0095-8956.

HLINĚNÝ, Petr. Crossing-Critical Graphs and Path-Width. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 2002, vol. 2265, No 2265, p. 102-113. ISSN 0302-9743.