Go to main content | Go to main menu | Go to search

prof. RNDr. Petr Hliněný, Ph.D.

Professor, Department of Computer Science

Office: C418
Botanická 554/68a
602 00 Brno

Show on the map

Phone: +420 549 49 3775
E‑mail:
social and academic networks:
Basic information
CV

Curriculum vitae

Name, first names, scientific degrees
  • Hliněný, Petr, born 1971 in Ostrava, CZ, married.
Department/Faculty/University
  • Faculty of Informatics, Masaryk University
Function, current position
  • Professor
Education and academic qualifications
  • 2014: Full Professor of Computer Science, Masaryk University, Brno.
  • 2003: Associate Professor of Computer Science, FEI VŠB - TU Ostrava.
  • 2000: Ph.D. in Combinatorics and Discrete Mathematics (advisor Prof. Jan Kratochvíl), Dissertation Contact Representations of Graphs, Faculty of Mathematics and Physics, Charles University, Czech Republic.
  • 1999: PhD. in Algorithms, Combinatorics and Optimization (advisor Prof. Robin Thomas), Dissertation Planar Covers of Graphs: Negami s Conjecture, School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia, USA.
  • 1995: Mgr. (equivalent M.Sc.) in Computer Science, Faculty of Mathematics and Physics, Charles University, Czech Republic.
Professional experience
  • 2005- : Faculty of Informatics, Masaryk University, Brno, Czech Republic.
  • 2003-2007 : Department of Computer Science, Technical University Ostrava, Czech Republic.
  • 2002-2003: Institute of Mathematics and Computer Science, Matej Bel University, Slovakia.
  • 2000-2004: Institute of Theoretical Computer Science, Charles University.
  • 2000-2002: School of Mathematical and Computing Sciences, Victoria University, New Zealand.
  • 1999-2000: The Fields Institute, University of Toronto, Canada; J.E. Marsden Distinguished Postdoctoral Fellow.
Teaching activities
  • Courses:
    2016: Matematické základy informatiky, Graph Theory, Discrete Math Methods, Formela lab seminar.
    2015: Matematické základy informatiky, Graph Theory, Discrete Math Methods, Formela lab seminar.
    2014: Matematické základy informatiky, Graph Theory, Discrete Math Methods, Advanced Graph Theory.
    2013: Matematické základy informatiky, Graph Theory, Discrete Math Methods, Advanced Graph Theory.
    2012: Úvod do informatiky, Graph Theory, Discrete Math Methods, Advanced Graph Theory.
    2011: Úvod do informatiky, Graph Theory, Advanced Graph Theory.
    2010: Úvod do informatiky, Graph Theory, Advanced Graph Theory.
    2009: Úvod do informatiky, Graph Theory, Advanced Graph Theory, Optimization.
    2008: Úvod do informatiky, Teorie Grafů, Advanced Graph Theory, Advanced Matroid Theory.
    2007: Úvod do informatiky, Teorie Grafů, Advanced Graph Theory, Optimization; FI MU Brno.
    2006: Úvod do informatiky 2x, Teorie Grafů, Matematická logika, Advanced Graph Theory; FI MU Brno.
    2005: Optimalizační úlohy; FI MU Brno.
    2004,2005: Úvod do teoretické informatiky; FEI VŠB - TU Ostrava.
    2004: Optimalizační úlohy; FEI VŠB - TU Ostrava.
    2003,2004: Diskrétní matematika; FEI VŠB - TU Ostrava.
    2003: Algebra, Teorie Grafů; UMB Banská Bystrica.
    2002: Teorie čísel, Pravděpodobnostní algoritmy, UMB Banská Bystrica.
    1999: Introduction to Programming; CS University of Toronto, Canada.
    1998: Applied Combinatorics; Mathematics, Georgia Tech, USA.
    1996,1997: Algebraické metody v kombinatorice; KAM MFF UK Praha.
  • Ph.D. students:
    2018- : Deniz Ağaoğlu
    2016- : Onur Çağırıcı
    2012-?? : Marek Derňár
    2012-2016: Jakub Gajarský
    2010- X: Ondrej Moriš
    2008-2012: Robert Ganian
Research activities
  • Discrete mathematics: graph structure theory, combinatorial algorithms, "width" and "depth" parameters, logic on graphs, topological graph theory and crossing numbers.
  • Theoretical computer science: complexity and parametrized complexity of (the aforementioned) combinatorial problems, finite model theory in CS.
  • Projects, grants:
    2017-2019: PI of Structural properties, parameterized tractability and hardness in combinatorial problems, GAČR 17-00837S.
    2014-2016: PI of Parameterized algorithms and kernelization in the context of discrete mathematics and logic, GAČR 14-03501S.
    2012-2018: Participation in the CE - Institute for Theoretical Computer Science, GAČR P202/12/G061.
    2011-2013: PI of Well-structured combinatorial classes, width parameters, and design of efficient algorithms, GAČR P202/11/0196.
    2009-2010: PI of Structural Graph Theory and Parameterized Complexity, GAČR 201/09/J021 billateral with RWTH Aachen.
    2008-2010: PI of Utilization of Structural and Width Parameters in Combinatorics and Algorithmic Complexity, GAČR 201/08/0308.
    2005-2011: Participation in the Institute for Theoretical Computer Science, project 1M0545.
    2005-2007: PI of Structural properties and algorithmic complexity of discrete problems, GAČR 201/05/0050.
    2005: PI of FRVŠ 2270/2005: Výuka optimalizačních úloh.
    2000-2004: Participated in the Institute for Theoretical Computer Science, project LN00A056.
    2000-2002: Participated in the NZ Marsden Fund grant, Matroid Structure Theory, Geoff Whittle.
    1999-2000: J.E. Marsden Distinguished Postdoctoral Fellow, The Fields Institute.
Professional stays abroad
  • ... see employment... plus
  • 2006: BIRS Banff, Canada, 1 week.
  • 2004: UA San Luis Potosi, Mexico, 1 week.
  • 2004: UPC Barcelona, 1 month (COMBSTRU network).
  • 1999: PIMS Vancouver, Canada, 1 month.
  • 1995: University of Oregon, USA, 2 months (Fulbright grant).
Most significant professional accomplishments
  • 2010: J. Combin. Theory ser. B Top cited article 2005-2010 award.
  • 1999/2000: Jerrold E. Marsden Distinguished Postdoctoral Fellowship at The Fields Institute, Toronto, Canada.
  • 1995: Bolzano prize in Computer Science for the work Contact Graphs of Curves (an extended version of thesis) at the Faculty of Mathematics and Physics, Charles University.
Refereed publications
  • BALABÁN, Jakub, Petr HLINĚNÝ a Jan JEDELSKÝ. Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. DISCRETE MATHEMATICS. NETHERLANDS: ELSEVIER, 2024, roč. 347, č. 8, 20 s. ISSN 0012-365X. Dostupné z: https://dx.doi.org/10.1016/j.disc.2024.113876. URL info
  • HLINĚNÝ, Petr a Jan JEDELSKÝ. ℋ-Clique-Width and a Hereditary Analogue of Product Structure. Online. In Královič, Rastislav and Kučera, Antonín. 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2024, s. "61:1"-"61:16", 16 s. ISBN 978-3-95977-335-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2024.61. info
  • CAGIRICI, Onur, Petr HLINĚNÝ, Filip POKRÝVKA a Abhisekh SANKARAN. Clique-Width of Point Configurations. Journal of Combinatorial Theory, Ser B. Amsterdam: Elsevier B.V., 2023, roč. 158, č. 1, s. 43-73. ISSN 0095-8956. Dostupné z: https://dx.doi.org/10.1016/j.jctb.2021.09.001. DOI open access preprint info
  • AGAOGLU CAGIRICI, Deniz a Petr HLINĚNÝ. Efficient Isomorphism for Sd-Graphs and T-Graphs. ALGORITHMICA. UNITED STATES: SPRINGER, 2023, roč. 85, č. 2, s. 352-383. ISSN 0178-4617. Dostupné z: https://dx.doi.org/10.1007/s00453-022-01033-8. full preprint URL info
  • CHIMANI, Markus a Petr HLINĚNÝ. Inserting Multiple Edges into a Planar Graph. Journal of Graph Algorithms and Applications. USA: Brown University, 2023, roč. 27, č. 6, s. 489-522. ISSN 1526-1719. Dostupné z: https://dx.doi.org/10.7155/jgaa.00631. URL info
  • HLINĚNÝ, Petr a Jan JEDELSKÝ. Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar. Online. In Etessami, Kousha and Feige, Uriel and Puppis, Gabriele. 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2023, s. "75:1"-"75:18", 18 s. ISBN 978-3-95977-278-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ICALP.2023.75. info
  • HLINĚNÝ, Petr a Adam STRAKA. Stack and Queue Numbers of Graphs Revisited. Online. In European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23. Brno, Czech Republic: MUNI Press, 2023, s. 601-606. ISSN 2788-3116. Dostupné z: https://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-083. info
  • AGAOGLU CAGIRICI, Deniz, Onur CAGIRICI, Jan DERBISZ, Tim HARTMANN, Petr HLINĚNÝ, Jan KRATOCHVÍL, Tomasz KRAWCZYK a Peter ZEMAN. Recognizing H-Graphs - Beyond Circular-Arc Graphs. Online. In Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David. 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2023, s. "8:1"-"8:14", 14 s. ISBN 978-3-95977-292-1. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2023.8. info
  • HLINĚNÝ, Petr. Twin-width of Planar Graphs; a Short Proof. Online. In European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23. Brno, Czech Republic: MUNI Press, 2023, s. 595-600. ISSN 2788-3116. Dostupné z: https://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-082. info
  • HLINĚNÝ, Petr a Tomáš MASAŘÍK. Minimizing an Uncrossed Collection of Drawings. Online. In Bekos, M.A., Chimani, M. Graph Drawing 2023. 14465. vyd. Switzerland: Springer, Cham, 2023, s. 110-123. ISBN 978-3-031-49271-6. Dostupné z: https://dx.doi.org/10.1007/978-3-031-49272-3_8. info
  • BERGOUGNOUX, Benjamin, Jakub GAJARSKÝ, Grzegorz Jan GUSPIEL, Petr HLINĚNÝ, Filip POKRÝVKA a Marek SOKOŁOWSKI. Sparse Graphs of Twin-width 2 Have Bounded Tree-width. Online. In ISAAC 2023. 283. vyd. Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2023, s. "11:1"-"11:13", 13 s. ISBN 978-3-95977-289-1. Dostupné z: https://dx.doi.org/10.4230/LIPICS.ISAAC.2023.11. info
  • AGAOGLU CAGIRICI, Deniz a Petr HLINĚNÝ. Isomorphism Testing for T-graphs in FPT. In Mutzel, P., Rahman, M.S., Slamin. WALCOM: Algorithms and Computation. LNCS 13174. Cham: Springer, Cham, 2022, s. 239-250. ISBN 978-3-030-96730-7. Dostupné z: https://dx.doi.org/10.1007/978-3-030-96731-4_20. info
  • BALABÁN, Jakub, Petr HLINĚNÝ a Jan JEDELSKÝ. Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. In Michael A. Bekos and Michael Kaufmann. WG 2022: Graph-Theoretic Concepts in Computer Science. LNCS 13453. Cham: Springer Nature, 2022, s. 43-55. ISBN 978-3-031-15913-8. Dostupné z: https://dx.doi.org/10.1007/978-3-031-15914-5_4. URL URL info
  • BOKAL, Drago, Zdeněk DVOŘÁK, Petr HLINĚNÝ, Jesus LEANOS, Bojan MOHAR a Tilo WIEDERA. Bounded degree conjecture holds precisely for c-crossing-critical graphs with c<=12. COMBINATORICA. GERMANY: SPRINGER HEIDELBERG, 2022, roč. 42, č. 5, s. 701-728. ISSN 0209-9683. Dostupné z: https://dx.doi.org/10.1007/s00493-021-4285-3. DOI open access preprint info
  • HAMM, Thekla a Petr HLINĚNÝ. Parameterised Partially-Predrawn Crossing Number. Online. In Goaoc, Xavier and Kerber, Michael. 38th International Symposium on Computational Geometry (SoCG 2022). LIPIcs Vol. 224. Dagstuhl, Germany: Schloss Dagstuhl, 2022, s. "46:1"-"46:15", 15 s. ISBN 978-3-95977-227-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2022.46. DOI open access info
  • BEKOS, Michael A., Giordano DA LOZZO, Petr HLINĚNÝ a Michael KAUFMANN. Graph Product Structure for h-Framed Graphs. Online. In Bae, Sang Won and Park, Heejin. 33rd International Symposium on Algorithms and Computation (ISAAC 2022). LIPIcs 248. Dagstuhl, Germany: Schloss Dagstuhl, 2022, s. "23:1"-"23:15", 15 s. ISBN 978-3-95977-258-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ISAAC.2022.23. DOI open access info
  • BOK, Jan, Jiří FIALA, Petr HLINĚNÝ, Nikola JEDLIČKOVÁ a Jan KRATOCHVÍL. Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. Online. In Bonchi, Filippo and Puglisi, Simon J. 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Dagstuhl: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2021, s. "21:1"-"21:15", 15 s. ISBN 978-3-95977-201-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2021.21. URL info
  • BALABÁN, Jakub a Petr HLINĚNÝ. Twin-Width is Linear in the Poset Width. Online. In Golovach, Petr A. and Zehavi, Meirav. International Symposium on Parameterized and Exact Computation (IPEC). 214. vyd. Dagstuhl: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2021, s. "6:1"-"6:13", 13 s. ISBN 978-3-95977-216-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.IPEC.2021.6. URL info
  • HLINĚNÝ, Petr. A Short Proof of Euler–Poincaré Formula. In Nešetřil J., Perarnau G., Rué J., Serra O. Extended Abstracts EuroComb 2021. Trends in Mathematics. Cham: Birkhäuser, 2021, s. 92-96. ISBN 978-3-030-83822-5. Dostupné z: https://dx.doi.org/10.1007/978-3-030-83823-2_15. URL info
  • HLINĚNÝ, Petr a Michal KORBELA. On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees. In Nešetřil J., Perarnau G., Rué J., Serra O. Extended Abstracts EuroComb 2021. Trends in Mathematics. Cham: Birkhäuser, 2021, s. 50-56. ISBN 978-3-030-83822-5. Dostupné z: https://dx.doi.org/10.1007/978-3-030-83823-2_9. URL info
  • CHIMANI, Markus, Petr HLINĚNÝ a Gelasio SALAZAR. Toroidal grid minors and stretch in embedded graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2020, roč. 140, č. 1, s. 323-371. ISSN 0095-8956. Dostupné z: https://dx.doi.org/10.1016/j.jctb.2019.05.009. URL info
  • AGAOGLU, Deniz a Petr HLINĚNÝ. Isomorphism Problem for Sd-Graphs. Online. In Javier Esparza and Daniel Kral. 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 2020, s. "4:1"-"4:14", 14 s. ISBN 978-3-95977-159-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2020.4. info
  • CAGIRICI, Onur, Petr HLINĚNÝ, Filip POKRÝVKA a Abhisekh SANKARAN. Clique-Width of Point Configurations. In Graph-Theoretic Concepts in Computer Science, WG 2020. Cham: Springer, Lecture Notes in Computer Science, 2020, s. 54-66. ISBN 978-3-030-60439-4. Dostupné z: https://dx.doi.org/10.1007/978-3-030-60440-0_5. open access preprint URL info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK a M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. ACM Transactions on Computational Logic. New York, NY, USA: Association for Computing Machinery, 2020, roč. 21, č. 4, s. "28:1"-"28:23", 23 s. ISSN 1529-3785. Dostupné z: https://dx.doi.org/10.1145/3383206. URL info
  • HLINĚNÝ, Petr, Filip POKRÝVKA a Bodhayan ROY. FO model checking on geometric graphs. Computational geometry. Amsterdam: ELSEVIER SCIENCE BV, 2019, roč. 78, č. 1, s. 1-19. ISSN 0925-7721. Dostupné z: https://dx.doi.org/10.1016/j.comgeo.2018.10.001. URL open access preprint info
  • CAGIRICI, Onur, Subir GHOSH, Petr HLINĚNÝ a Bodhayan ROY. On conflict-free chromatic guarding of simple polygons. Online. In 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA'19). Cham: Springer, Lecture Notes in Computer Science, volume 11949, 2019, s. 601-612. ISBN 978-3-030-36411-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-36412-0_49. URL info
  • HLINĚNÝ, Petr a Michal KORBELA. On the achievable average degrees in 2-crossing-critical graphs. Acta Math. Univ. Comenianae. 2019, roč. 88, č. 3, s. 787-793. ISSN 0231-6986. URL info
  • BOKAL, Drago, Mojca BRACIC, Marek DERŇÁR a Petr HLINĚNÝ. On Degree Properties of Crossing-Critical Families of Graphs. Electronic Journal of Combinatorics. internet: -, 2019, roč. 26, č. 1, s. 1-28. ISSN 1077-8926. Dostupné z: https://dx.doi.org/10.37236/7753. URL info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Martin KOUTECKÝ a Shmuel ONN. Parameterized shifted combinatorial optimization. Journal of Computer and System Sciences. SAN DIEGO: Academic Press, 2019, roč. 99, č. 1, s. 53-71. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2018.06.002. DOI open access preprint info
  • GANIAN, Robert, Petr HLINĚNÝ, Jaroslav NEŠETŘIL, Jan OBDRŽÁLEK a Patrice OSSONA DE MENDEZ. Shrub-depth: Capturing Height of Dense Graphs. Logical Methods in Computer Science. BRAUNSCHWEIG: LOGICAL METHODS COMPUTER SCIENCE E V, 2019, roč. 15, č. 1, s. "7:1"-"7:25", 25 s. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.23638/LMCS-15(1:7)2019. URL info
  • HLINĚNÝ, Petr a Abhisekh SANKARAN. Exact Crossing Number Parameterized by Vertex Cover. In GD 2019: Graph Drawing and Network Visualization. Cham: Springer, Lecture Notes in Computer Science, volume 11904, 2019, s. 307-319. ISBN 978-3-030-35801-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-35802-0_24. URL open access preprint info
  • BOKAL, Drago, Zdeněk DVOŘÁK, Petr HLINĚNÝ, Jesus LEANOS, Bojan MOHAR a Tilo WIEDERA. Bounded degree conjecture holds precisely for c-crossing-critical graphs with c<=12. Online. In 35th International Symposium on Computational Geometry, SoCG 2019. Dagstuhl: Leibniz International Proceedings in Informatics, LIPIcs, 2019, s. "14:1"-"14:15", 15 s. ISBN 978-3-95977-104-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2019.14. open access info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ a Hans Raj TIWARY. Parameterized Extension Complexity of Independent Set and Related Problems. Discrete Applied Mathematics. Elsevier Science, 2018, roč. 248, SI, s. 56-67. ISSN 0166-218X. Dostupné z: https://dx.doi.org/10.1016/j.dam.2017.04.042. URL info
  • HLINĚNÝ, Petr, Filip POKRÝVKA a Bodhayan ROY. FO model checking of geometric graphs. Online. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). LIPIcs 89. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, s. "19:1"-"19:12", 12 s. ISBN 978-3-95977-051-4. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.IPEC.2017.19. info
  • CAGIRICI, Onur, Petr HLINĚNÝ a Bodhayan ROY. On Colourability of Polygon Visibility Graphs. Online. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). LIPIcs 93. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, s. "21:1"-"21:14", 14 s. ISBN 978-3-95977-055-2. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2017.21. info
  • HLINĚNÝ, Petr a Carsten THOMASSEN. Deciding Parity of Graph Crossing Number. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2018, roč. 32, č. 3, s. 1962-1965. ISSN 0895-4801. Dostupné z: https://dx.doi.org/10.1137/17M1137231. URL info
  • HLINĚNÝ, Petr. A Simpler Self-reduction Algorithm for Matroid Path-width. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2018, roč. 32, č. 2, s. 1425-1440. ISSN 0895-4801. Dostupné z: https://dx.doi.org/10.1137/17M1120129. URL info
  • DVOŘÁK, Zdeněk, Petr HLINĚNÝ a Bojan MOHAR. Structure and generation of crossing-critical graphs. Online. In 34th International Symposium on Computational Geometry, SoCG 2018. Dagstuhl: Leibniz International Proceedings in Informatics, LIPIcs, 2018, s. "33:1"-"33:14", 14 s. ISBN 978-3-95977-066-8. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2018.33. info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, Felix REIDL, Peter ROSSMANITH, Fernando VILLAAMIL a Somnath SIKDAR. Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences. SAN DIEGO: Elsevier, 2017, roč. 84, č. 1, s. 219-242. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2016.09.002. info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Tomáš KAISER, Daniel KRÁĽ, Martin KUPEC, Jan OBDRŽÁLEK, Sebastian ORDYNIAK a Vojtěch TŮMA. First order limits of sparse graphs: Plane trees and path-width. Random Structures & Algorithms. Wiley, 2017, roč. 50, č. 4, s. 612-635. ISSN 1042-9832. Dostupné z: https://dx.doi.org/10.1002/rsa.20676. info
  • CHIMANI, Markus a Petr HLINĚNÝ. A tighter insertion-based approximation of the crossing number. Journal of Combinatorial Optimization. Springer, 2017, roč. 33, č. 4, s. 1183-1225. ISSN 1382-6905. Dostupné z: https://dx.doi.org/10.1007/s10878-016-0030-z. info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Martin KOUTECKÝ a Shmuel ONN. Parameterized Shifted Combinatorial Optimization. In Y. Cao and J. Chen. International Computing and Combinatorics Conference COCOON 2017 (LNCS, volume 10392). Hong Kong: Springer International Publishing AG, 2017, s. 224-236. ISBN 978-3-319-62388-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-62389-4_19. info
  • HLINĚNÝ, Petr a Ondřej SLÁMEČKA. Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs. In Jan Kofroň, Tomáš Vojnar. Mathematical and Engineering Methods in Computer Science, Lecture Notes in Computer Science 9548. Switzerland: Springer, 2016, s. 54-66. ISBN 978-3-319-29816-0. Dostupné z: https://dx.doi.org/10.1007/978-3-319-29817-7_6. info
  • GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR a Peter ROSSMANITH. Are there any good digraph width measures? Journal of Combinatorial Theory, Ser B. Academic Press, 2016, roč. 116, č. 1, s. 250-286. ISSN 0095-8956. Dostupné z: https://dx.doi.org/10.1016/j.jctb.2015.09.001. info
  • CHIMANI, Markus a Petr HLINĚNÝ. Inserting Multiple Edges into a Planar Graph. Online. In 32nd International Symposium on Computational Geometry (SoCG 2016). Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016, s. "30:1"-"30:15", 15 s. ISBN 978-3-95977-009-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2016.30. URL info
  • DERŇÁR, Marek a Petr HLINĚNÝ. Crossing Number is Hard for Kernelization. Online. In 32nd International Symposium on Computational Geometry (SoCG 2016). Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016, s. "42:1"-"42:10", 10 s. ISBN 978-3-95977-009-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2016.42. URL info
  • HLINĚNÝ, Petr, O-joung KWON, Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Tree-depth and Vertex-minors. European Journal of Combinatorics. Elsevier, 2016, roč. 56, č. 1, s. 46-56. ISSN 0195-6698. Dostupné z: https://dx.doi.org/10.1016/j.ejc.2016.03.001. info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK a M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016. New York, NY, USA: ACM, 2016, s. 176-184. ISBN 978-1-4503-4391-6. Dostupné z: https://dx.doi.org/10.1145/2933575.2935314. URL info
  • DERKA, Martin a Petr HLINĚNÝ. Planar Emulators Conjecture Is Nearly True for Cubic Graphs. European Journal of Combinatorics. Elsevier, 2015, roč. 48, č. 1, s. 63-70. ISSN 0195-6698. Dostupné z: https://dx.doi.org/10.1016/j.ejc.2015.02.009. info
  • BOKAL, Drago, Mojca BRAČIČ, Marek DERŇÁR a Petr HLINĚNÝ. On Degree Properties of Crossing-critical Families of Graphs. In Emilio Di Giacomo, Anna Lubiw. Graph Drawing and Network Visualization 2015, Lecture Notes in Computer Science 9411. LNCS 9411. Berlin: Springer Verlag, 2015, s. 75-86. ISBN 978-3-319-27260-3. Dostupné z: https://dx.doi.org/10.1007/978-3-319-27261-0_7. info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, M.S. RAMANUJAN, Daniel LOKSHTANOV a Saket SAURABH. FO Model Checking on Posets of Bounded Width. Online. In Venkatesan Guruswami. 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Berkeley, CA, USA: IEEE Computer Society, 2015, s. 963-974. ISBN 978-1-4673-8191-8. Dostupné z: https://dx.doi.org/10.1109/FOCS.2015.63. sborník info
  • GAJARSKÝ, Jakub a Petr HLINĚNÝ. Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, č. 1, s. 1-26. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-11(1:19)2015. URL info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Faster Existential FO Model Checking on Posets. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, č. 4, s. 1-13. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-11(4:8)2015. URL info
  • GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, 4:11, s. 1-20. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-11(4:11)2015. URL info
  • HLINĚNÝ, Petr a Gelasio SALAZAR. On Hardness of the Joint Crossing Number. In Khaled Elbassioni, Kazuhisa Makino. International Symposium on Algorithms and Computation (ISAAC 2015), Lecture Notes in Computer Science 9472. LNCS 9472. Berlin: Springer Verlag, 2015, s. 603-613. ISBN 978-3-662-48970-3. Dostupné z: https://dx.doi.org/10.1007/978-3-662-48971-0_51. info
  • GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH a Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. Journal of Computer and System Sciences. Elsevier, 2014, roč. 80, č. 1, s. 180-194. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2013.07.005. info
  • GANIAN, Robert, Petr HLINĚNÝ, Joachim KNEIS, Alexander LANGER, Jan OBDRŽÁLEK a Peter ROSSMANITH. Digraph width measures in parameterized algorithmics. Discrete Applied Mathematics. Elsevier B.V., 2014, roč. 168, č. 1, s. 88-107. ISSN 0166-218X. Dostupné z: https://dx.doi.org/10.1016/j.dam.2013.10.038. info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Faster Existential FO Model Checking on Posets. In Hee-Kap Ahn, Chan-Su Shin. ISAAC 2014, LNCS 8889. Berlin: Springer International Publishing, 2014, s. 441-451. ISBN 978-3-319-13074-3. Dostupné z: https://dx.doi.org/10.1007/978-3-319-13075-0_35. info
  • CABELLO, Sergio, Markus CHIMANI a Petr HLINĚNÝ. Computing the stretch of an embedded graph. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2014, roč. 28, č. 3, s. 1391-1401. ISSN 0895-4801. Dostupné z: https://dx.doi.org/10.1137/130945636. info
  • HLINĚNÝ, Petr, Martin DERKA, Markus CHIMANI a Matěj KLUSÁČEK. How Not to Characterize Planar-emulable Graphs. Advances in Applied Mathematics. Holandsko: Elsevier, 2013, roč. 50, č. 1, s. 46-68. ISSN 0196-8858. Dostupné z: https://dx.doi.org/10.1016/j.aam.2012.06.004. info
  • GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width. European Journal of Combinatorics. Elsevier, 2013, roč. 34, č. 3, s. 680-701. ISSN 0195-6698. Dostupné z: https://dx.doi.org/10.1016/j.ejc.2012.07.024. info
  • HLINĚNÝ, Petr a Martin DERKA. Planar Emulators Conjecture Is Nearly True for Cubic Graphs. In J. Nešetřil, M. Pellegrini. The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013. Pisa, Italy: Scuola Normale Superiore Pisa, 2013, s. 245-250. ISBN 978-88-7642-474-8. conference info
  • GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Better algorithms for satisfiability problems for formulas of bounded rank-width. Fundamenta Informaticae. Poland: IOS Press, The Netherlands, 2013, roč. 123, č. 1, s. 59-76. ISSN 0169-2968. Dostupné z: https://dx.doi.org/10.3233/FI-2013-800. info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, Felix REIDL, Peter ROSSMANITH, Fernando Sanchez VILLAAMIL a Somnath SIKDAR. Kernelization Using Structural Parameters on Sparse Graph Classes. In Hans L. Bodlaender a Giuseppe F. Italiano. ESA 2013. Berlin Heidelberg: Springer, 2013, s. 529-540. ISBN 978-3-642-40449-8. Dostupné z: https://dx.doi.org/10.1007/978-3-642-40450-4_45. info
  • GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg. ICALP (2) 2013. Berlin Heidelberg: Springer, 2013, s. 250-262. ISBN 978-3-642-39211-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39212-2_24. info
  • HLINĚNÝ, Petr a Ondrej MORIŠ. Generalized Maneuvers in Route Planning. In MEMICS 2011 Proceedings. Berlin Heidelberg: LNCS, Springer-Verlag, 2012, s. 155-166. ISBN 978-3-642-25928-9. Dostupné z: https://dx.doi.org/10.1007/978-3-642-25929-6_15. info
  • HLINĚNÝ, Petr, Markus CHIMANI a Petra MUTZEL. Vertex insertion approximates the crossing number of apex graphs. European Journal of Combinatorics. Elsevier, 2012, roč. 33, č. 3, s. 326-335. ISSN 0195-6698. Dostupné z: https://dx.doi.org/10.1016/j.ejc.2011.09.009. info
  • HLINĚNÝ, Petr a Ondrej MORIŠ. Generalized Maneuvers in Route Planning. Computing and Informatics. Bratislava: Slovak Academy of Sciences, 2012, roč. 31, č. 3, s. 531-549. ISSN 1335-9150. Dostupné z: https://dx.doi.org/10.1007/978-3-642-25929-6_15. paper info
  • GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH a Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. Online. In 29th International Symposium on Theoretical Aspects of Computer Science STACS2012. 2012. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012, s. 326-337. ISBN 978-3-939897-35-4. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2012.326. STACS2012 info
  • GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ a Reshma RAMADURAI. When Trees Grow Low: Shrubs and Fast MSO1. In Math Foundations of Computer Science MFCS 2012. 7464. vyd. Německo: Lecture Notes in Computer Science, Springer-Verlag, 2012, s. 419-430. ISBN 978-3-642-32588-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-32589-2_38. info
  • GAJARSKÝ, Jakub a Petr HLINĚNÝ. Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. Online. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). 2012. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012, s. 112-123. ISBN 978-3-939897-47-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.112. URL info
  • HLINĚNÝ, Petr a Ondrej MORIŠ. Scope-Based Route Planning. In ESA’11: Proceedings of the 19th conference on Annual European Symposium. Berlin Heidelberg: LNCS 6942, Springer-Verlag, 2011, s. 445-456. ISBN 978-3-642-23718-8. Dostupné z: https://dx.doi.org/10.1007/978-3-642-23719-5_38. preprint info
  • GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Clique-width: When Hard Does Not Mean Impossible. Online. In Thomas Schwentick and Christoph D{\"u}rr. 28th International Symposium on Theoretical Aspects of Computer Science STACS2011. 2011. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2011, s. 404-415. ISBN 978-3-939897-25-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2011.404. DOI STACS2011 info
  • CHIMANI, Markus a Petr HLINĚNÝ. A Tighter Insertion-based Approximation of the Crossing Number. In Luca Aceto, Monika Henzinger and Jirí Sgall. Automata, Languages and Programming 38th International Colloquium, ICALP 2011. Gremany: Springer, 2011, s. 122-134. ISBN 978-3-642-22005-0. Dostupné z: https://dx.doi.org/10.1007/978-3-642-22006-7_11. DOI info
  • HLINĚNÝ, Petr, Eva JELÍNKOVÁ, Jan KRATOCHVÍL a Ondřej SUCHÝ. Parameterized Problems Related to Seidel's Switching. Discrete Mathematics & Theoretical Computer Science. France: DMTCS, 2011, roč. 13, č. 2, s. 19-42. ISSN 1365-8050. paper info
  • HLINĚNÝ, Petr, Martin DERKA, Markus CHIMANI a Matěj KLUSÁČEK. How Not to Characterize Planar-emulable Graphs. In Costas S. Iliopoulos and William F. Smyth. COMBINATORIAL ALGORITHMS, Lecture Notes in Computer Science 7056. Německo: Springer Verlag, 2011, s. 106-120. ISBN 978-3-642-25010-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-25011-8_9. info
  • HLINĚNÝ, Petr a Markus CHIMANI. Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. Online. In ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). USA, internet: SIAM / ACM, 2010, s. 918-927. ISBN 978-0-89871-698-6. Proceedings address conference info
  • GANIAN, Robert a Petr HLINĚNÝ. On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Applied Mathematics. Amsterdam: Elsevier B.V., 2010, roč. 158, č. 1, s. 851-867. ISSN 0166-218X. DOI info
  • GANIAN, Robert a Petr HLINĚNÝ. New results on the complexity of oriented colouring on restricted digraph classes. In SOFSEM 2010, Lecture Notes in Computer Science 5901. 5901. vyd. Berlin: Springer, 2010, s. 428-439. ISBN 978-3-642-11265-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-11266-9_36. DOI info
  • HLINĚNÝ, Petr a Antonín KUČERA. 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010). 2010. info
  • GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR a Peter ROSSMANITH. Are there any good digraph width measures? In Parameterized and exact computation, IPEC 2010. 6478. vyd. India: Lecture Notes in Computer Science, Springer-Verlag, 2010, s. 135-146. ISBN 978-3-642-17492-6. Dostupné z: https://dx.doi.org/10.1007/978-3-642-17493-3_14. DOI info
  • GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Better algorithms for satisfiability problems for formulas of bounded rank-width. Online. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). 2010. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2010, s. 73-83. ISBN 978-3-939897-23-1. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.73. DOI URL info
  • HLINĚNÝ, Petr a Gelasio SALAZAR. Stars and Bonds in Crossing-Critical Graphs. Journal of Graph Theory. New York: John Wiley & Sons, 2010, roč. 65, č. 3, s. 198-215. ISSN 0364-9024. DOI info
  • HLINĚNÝ, Petr. 20 years of Negami's planar cover conjecture. Graphs and Combinatorics. Tokyo: Springer Japan, 2010, roč. 26, č. 4, s. 525-536. ISSN 0911-0119. Dostupné z: https://dx.doi.org/10.1007/s00373-010-0934-9. info
  • HLINĚNÝ, Petr, Markus CHIMANI a Petra MUTZEL. Approximating the Crossing Number of Apex Graphs. In Symposium Graph Drawing 2008, Lecture Notes in Computer Science. 5417. vyd. Berlin: Springer Verlag, 2009, s. 432-434. ISBN 978-3-642-00218-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-00219-9_42. conference info
  • HLINĚNÝ, Petr a Geoff WHITTLE. Addendum to Matroid Tree-Width. European Journal of Combinatorics. Elsevier, 2009, roč. 30, č. 4, s. 1036-1044. ISSN 0195-6698. doi info
  • GANIAN, Robert a Petr HLINĚNÝ. Better Polynomial Algorithms on Graphs of Bounded Rank-width. In IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874. 5874. vyd. Berlin: Springer, 2009, s. 266-277. ISBN 978-3-642-10216-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-10217-2. DOI info
  • GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Joachim KNEIS a Peter ROSSMANITH. On Digraph Width Measures in Parameterized Algorithmics. In IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science. 5917. vyd. Berlin: Springer Verlag, 2009, s. 185-197. ISBN 978-3-642-11268-3. Dostupné z: https://dx.doi.org/10.1007/978-3-642-11269-0_15. DOI Conference info
  • HLINĚNÝ, Petr, Gelasio SALAZAR, Isidoro GITLER a Jesus LEANOS. The crossing number of a projective graph is quadratic in the face--width. Electronic Journal of Combinatorics. internet: -, 2008, roč. 15, č. 1, s. R46, 8 s. ISSN 1077-8926. online paper info
  • HLINĚNÝ, Petr. Approaching tree-width of graphs from matroidal perspective. In 43. česko-slovenská konference Grafy 2008. 2008. conference info
  • HLINĚNÝ, Petr a Gelasio SALAZAR. Stars and Bonds in Crossing-Critical Graphs. Electronic Notes in Discrete Mathematics. Elsevier, 2008, roč. 31, č. 1, s. 271-275. ISSN 1571-0653. conference DOI info
  • HLINĚNÝ, Petr a Sang-il OUM. Finding branch-decomposition and rank-decomposition. SIAM Journal on Computing. USA: SIAM, 2008, roč. 38, č. 3, s. 1012-1032. ISSN 0097-5397. doi info
  • HLINĚNÝ, Petr a Robert GANIAN. Automata Approach to Graphs of Bounded Rank-width. In Mirka Miller and Koichi Wada. International Workshop on Combinatorial Algorithms IWOCA 2008. United Kingdom: Proceedings of the International Workshop on Combinatorial Algorithms 2008, College Publications, 2008, s. 4-15. ISBN 978-1-904987-74-1. conference info
  • HLINĚNÝ, Petr. 20 years of Negami's planar cover conjecture. In 20th Workshop on topological graph theory in Yokohama. 2008. conference info
  • HLINĚNÝ, Petr. New infinite families of almost-planar crossing-critical graphs. Electronic Journal of Combinatorics. internet: -, 2008, roč. 15, č. 1, s. R102, 12 s. ISSN 1077-8926. online paper info
  • HLINĚNÝ, Petr. Some Hard Problems on Matroid Spikes. Theory of Computing Systems. New York: Springer, 2007, roč. 41, č. 1, s. 551-562. ISSN 1432-4350. doi info
  • HLINĚNÝ, Petr a Gelasio SALAZAR. On the Crossing Number of Almost Planar Graphs. In Graph Drawing, Symposium GD2006. 4372. vyd. Berlin: Springer Verlag, 2007, s. 162-173. ISBN 3-540-70903-7. conference info
  • HLINĚNÝ, Petr, Georg GOTTLOB, Detlef SEESE a Sang-il OUM. Width Parameters Beyond Tree-width and Their Applications. Computer Journal. UK: Oxford University Press, 2007, roč. 51, č. 3, s. 326-362. ISSN 0010-4620. doi info
  • HLINĚNÝ, Petr a Gelasio SALAZAR. Approximating the Crossing Number of Toroidal Graphs. In International Symposium on Algorithms and Computation (ISAAC 2007). Berlin: Springer Verlag, 2007, s. 148-159. ISBN 978-3-540-77118-0. conference doi info
  • HLINĚNÝ, Petr, Gelasio SALAZAR, Isidoro GITLER a Jesus LEANOS. The crossing number of a projective graph is quadratic in the face--width (Extended abstract). Electronic Notes in Discrete Mathematics. Elsevier, 2007, roč. 29, C, s. 219-223. ISSN 1571-0653. conference doi info
  • HLINĚNÝ, Petr a Sang-il OUM. Finding branch-decomposition and rank-decomposition (Extended abstract). In European Symposium on Algorithms (ESA 2007). Berlin: Springer Verlag, 2007, s. 163-174. ISBN 978-3-540-75519-7. conference doi info
  • HLINĚNÝ, Petr. The Tutte Polynomial for Matroids of Bounded Branch-Width. Combin. Prob. Computing. UK: Cambridge Univ. Press, 2006, roč. 15, č. 3, s. 397-409. ISSN 0963-5483. doi URL info
  • HLINĚNÝ, Petr. Crossing Number is Hard for Cubic Graphs. Journal of Combinatorial Theory, Ser B. Amsterdam: Elsevier B.V., 2006, roč. 96, č. 4, s. 455-471. ISSN 0095-8956. URL info
  • HLINĚNÝ, Petr. Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. Journal of Combinatorial Theory, Ser B. Amsterdam: Elsevier B.V., 2006, roč. 96, č. 3, s. 325-351. ISSN 0095-8956. URL info
  • HLINĚNÝ, Petr a Detlef SEESE. Trees, grids, and MSO decidability: From graphs to matroids. Theoretical Computer Science. Amsterdam: Elsevier, 2006, roč. 351, č. 3, s. 372-393. ISSN 0304-3975. URL info
  • HLINĚNÝ, Petr. Equivalence-free exhaustive generation of matroid representations. Discrete Applied Mathematics. Amsterdam: Elsevier B.V., 2006, roč. 154, č. 8, s. 1210-1222. ISSN 0166-218X. URL info
  • HLINĚNÝ, Petr. Combinatorial Generation of Matroid Representations: Theory and Practice. Acta Universitatis Matthiae Belii, Series Mathematics. Banska Bystrica, Slovakia: Matej Bel University, 2006, roč. 12, č. 1, s. 31-41. URL info
  • GIMENEZ, Omer, Petr HLINĚNÝ a Marc NOY. Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2006, roč. 20, č. 4, s. 932-946. ISSN 0895-4801. doi info
  • HLINĚNÝ, Petr a Geoff WHITTLE. Matroid Tree-Width. European Journal of Combinatorics. Elsevier, 2006, roč. 27, č. 7, s. 1117-1128. ISSN 0195-6698. doi info
  • HLINĚNÝ, Petr, Winfried HOCHSTATTLER a Luis GODDYN. Balanced Signings and the Chromatic Number of Oriented Matroids. Combin. Prob. Computing. UK: Cambridge Univ. Press, 2006, roč. 15, č. 4, s. 523-539. ISSN 0963-5483. doi info
  • HLINĚNÝ, Petr. On Matroid Representability and Minor Problems. In 31st International Symposium, MFCS 2006. 4162. vyd. Berlin: Springer Verlag, 2006, s. 505-516. ISBN 3-540-37791-3. URL info
  • HLINĚNÝ, Petr, Jim GEELEN a Geoff WHITTLE. Bridging Separations in Matroids. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2005, roč. 18, č. 3, s. 638-646. ISSN 0895-4801. info
  • HLINĚNÝ, Petr. MACEK: A software package for real structural computations with representable matroids. verze 1.2. 2005. Current home page of MACEK, with an online trial interface. info
  • GIMENEZ, Omer, Petr HLINĚNÝ a Marc NOY. Computing the Tutte Polynomial on Graphs of Bounded Clique-Width (extended abstract). D. Kratsch (Ed.). In WG 2005. Berlin: Springer Verlag, 2005, s. 59-68. ISBN 978-3-540-31000-6. conference doi info
  • HLINĚNÝ, Petr. A Parametrized Algorithm for Matroid Branch-Width. SIAM Journal on Computing. USA: SIAM, 2005, roč. 35, č. 2, s. 259 - 277. ISSN 0097-5397. URL info
  • HLINĚNÝ, Petr a Robin THOMAS. On possible counterexamples to Negami's planar cover conjecture. Journal of Graph Theory. New York: John Wiley & Sons, 2004, roč. 46, č. 3, s. 183-206. ISSN 0364-9024. URL info
  • HLINĚNÝ, Petr. Crossing Number is Hard for Cubic Graphs (extended abstract). Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 2004, roč. 3153, s. 772-781. ISSN 0302-9743. info
  • HLINĚNÝ, Petr a Detlef SEESE. On Decidability of MSO Theories of Representable Matroids. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 2004, roč. 3162, s. 96-107. ISSN 0302-9743. info
  • HLINĚNÝ, Petr. Using a Computer in Matroid Theory Research. Acta Math. Univ. M. Belii. Slovensko: UMB BB, 2004, roč. 11, č. 1, s. 27-44. URL info
  • HLINĚNÝ, Petr. On Matroid Properties Definable in the MSO Logic. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 2003, roč. 2747, s. 470-479. ISSN 0302-9743. info
  • HLINĚNÝ, Petr. Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids (Extended Abstract). Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 2003, roč. 2607, s. 319-330. ISSN 0302-9743. info
  • HLINĚNÝ, Petr. Crossing-Number Critical Graphs have Bounded Pathwidth. Journal of Combinatorial Theory, Ser B. .: Elsevier B.V., 2003, roč. 88, č. 3, s. 347-367. ISSN 0095-8956. info
  • HLINĚNÝ, Petr. A new proof for chordal graphs. Acta Math. Univ. M. Belii. Slovensko: UMB BB, 2003, roč. 10, č. 1, s. 17-19. URL info
  • HLINĚNÝ, Petr. Crossing-Critical Graphs and Path-Width. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 2002, roč. 2265, č. 2265, s. 102-113. ISSN 0302-9743. info
  • HLINĚNÝ, Petr. On the Excluded Minors for Matroids of Branch-Width Three. Electronic Journal of Combinatorics. internet: -, 2002, roč. 9, R32, s. 0-11. ISSN 1077-8926. URL info
  • HLINĚNÝ, Petr. Another two graphs with no planar covers. Journal of Graph Theory. New York: John Wiley & Sons, 2001, roč. 37, č. 4, s. 227-242. ISSN 0364-9024. URL info
  • HLINĚNÝ, Petr a Jan KRATOCHVÍL. Representing graphs by disks and balls (a survey of recognition complexity results). Discrete Mathematics. .: Elsevier B.V., 2001, roč. 229, č. 1, s. 101-124. ISSN 0166-218X. info
  • HLINĚNÝ, Petr. An Addition to Art Galleries with Interior Walls. Discrete and Computational Geometry. .: Springer, 2001, roč. 25, č. 3, s. 311-314. ISSN 0179-5376. info
  • HLINĚNÝ, Petr. Contact graphs of line segments are NP-complete. Discrete Mathematics. .: Elsevier B.V., 2001, roč. 235, č. 1, s. 95-106. ISSN 0166-218X. info
  • HLINĚNÝ, Petr. A note on possible extensions of Negami's conjecture. Journal of Graph Theory. New York: John Wiley & Sons, 1999, roč. 32, č. 3, s. 234-240. ISSN 0364-9024. URL info
  • HLINĚNÝ, Petr. K4,4-e has no finite planar cover. Journal of Graph Theory. New York: John Wiley & Sons, 1998, roč. 27, č. 1, s. 51-60. ISSN 0364-9024. URL info
  • HLINĚNÝ, Petr. The maximal clique and colourability of curve contact graphs. Discrete Applied Mathematics. .: Elsevier B.V., 1998, roč. 81, č. 1, s. 59-68. ISSN 0166-218X. info
  • HLINĚNÝ, Petr. Classes and recognition of curve contact graphs. Journal of Combinatorial Theory, Ser B. .: Elsevier B.V., 1998, roč. 74, č. 1, s. 87-103. ISSN 0095-8956. info
  • HLINĚNÝ, Petr a Jan KRATOCHVIL. Computational complexity of the Krausz dimension of graphs. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 1997, roč. 1335, s. 214-228. ISSN 0302-9743. info
  • HLINĚNÝ, Petr. Touching graphs of unit balls. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 1997, roč. 1353, s. 350-358. ISSN 0302-9743. info
  • HLINĚNÝ, Petr. Contact graphs of curves (extended abstract). Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 1996, roč. 1027, s. 312-323. ISSN 0302-9743. info
  • HLINĚNÝ, Petr a Aleš KUBĚNA. A note on intersection dimensions of graph classes. Comment. Math. Univ. Carolinae. Praha: MFF UK, 1995, roč. 36, č. 1, s. 255-260. ISSN 0010-2628. info

2018/12/21

Supervision
Qualifications
Publications
Projects
Teaching

You are running an old browser version. We recommend updating your browser to its latest version.

More info