Welcome to my academic pages!
![[photo]](images/PHfoto-17small.png)
Prof. RNDr. Petr Hliněný, Ph.D.
Professor of CS
@ynenilhfi.muni.cz
Faculty of Informatics MU Brno, CZ
Botanická 68a, 602 00 Brno
Office C418
Main FI building, 4th floor
Calendar of my teaching, office hours, and duties
Scientific research - overview (read more)
- The theory research group - Discrete Methods and
Algorithms (DIMEA), FI MU Brno, CZ,
previously also Formal Methods, Logic and Algorithms (Formela). - My research directions in brief (and current research news):
- discrete mathematics, graph theory (structural and topological), discrete geometry,
- theoretical computer science - combinatorial algorithms, parameterized complexity, logic.
- Current Ph.D. students (official listing): Jakub Balabán (since 2024-), Jan Jedelský (since 2024-), Adam Straka (since 2025-), Lukáš Málik (since 2025-), Jeremi Gladkowski (since 2026-), Dávid Smolka (since 2026-).
- Selected past students: Robert Ganian (Ph.D. 2012) - now TU Wien, Martin Derka (Mgr. 2013) - now at Quantstamp, Inc.. Jakub Gajarský (Ph.D. 2016) - now back at FI MU. Onur Cagirici (Ph.D. 2021) - now Novanta Inc., Deniz Agaoglu Cagirici (Ph.D. 2024) - now SAP, Filip Pokrývka (Ph.D. 2024) - now at RedHat.
- Collaborators - see the research page...
- Research opportunities for students (more details):
- try the bonus assignments offered in IB000, and continue in my advanced seminars and courses;
- e.g., attend the seminar FI:IV119 Seminar on Discrete Mathematical Methods (already for the second-year students),
- see an offer of bachelor/master thesis topics (IS listing) related to my research, or come to ask to the FI:IV131 Seminar of Discrete Methods and Algorithms Laboratory, and also read about scientific achievements of my students,
- consider the opportunity of a PhD study
- with stipend (good foreign applicants welcome):
Generally speaking, any theoretical research into graphs (with emphasis on structural and topological graph theory), into graph algorithms (with emphasis on parameterized complexity and logic on graphs), and some discrete geometrical problems can be discussed. See the current research topics.
- A short list of selected recent publications
(full list):
Petr Hliněný- 2026 (co-author J. Jedelský): k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs. Discrete Mathematics & Theoretical Computer Science 28:4 (2026), accepted. URL: arxiv.org/abs/2506.08585.
- 2026 (co-author L. Málik): Conflict-Free Coloring Planar Graphs with 4 Colors. In: ESA 2026, LIPIcs Vol. 388, Dagstuhl (2026), 33:1--33:20. URL: arxiv.org/abs/2606.25988. DOI 10.4230/LIPIcs.ESA.2026.33.
- 2026 (co-authors J. Bok, J. Fiala, N. Jedličková, J. Kratochvíl): Computational complexity of covering multigraphs with semi-edges: Small cases. Journal of Computer and System Sciences 156 (2026), 103714. URL: arxiv.org/abs/2103.15214. DOI 10.1016/j.jcss.2025.103714. © Elsevier B.V.
- 2025 (co-author J. Jedelský): Twin-width of Planar Graphs is at most 8, and some Related Bounds. SIAM J. Discrete Mathematics 39 (2025), 2003--2048. URL: arxiv.org/abs/2210.08620. DOI 10.1137/23M1623823. © Society for Industrial and Applied Mathematics.
- 2025 (co-author E. Colin de Verdi`ere): A Unified FPT Framework for Crossing Number Problems. In: ESA, LIPIcs Vol. 351, Dagstuhl (2025), 21:1--21:18. URL: arxiv.org/abs/2410.00206. DOI 10.4230/LIPIcs.ESA.2025.21.
- 2025 (co-author J. Jedelský): Transductions of Graph Classes Admitting Product Structure. In: LICS, IEEE (2025), 843--855. URL: arxiv.org/abs/2501.18326. DOI 10.1109/LICS65433.2025.00069.
- 2025 (co-author M. Korbela): On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees. Discrete Mathematics 348 (2025), 114347. URL: arxiv.org/abs/2105.01104. DOI 10.1016/j.disc.2024.114347. © Elsevier B.V.
- 2025 (co-author A. Straka): Stack and Queue Numbers of Graphs Revisited. European J. Combinatorics 129 (2025), 104094. URL: arxiv.org/abs/2303.10116. DOI 10.1016/j.ejc.2024.104094. © Elsevier B.V.
- 2025: Twin-width of Planar Graphs; a Short Proof. European J. Combinatorics 129 (2025), 104036. URL: arxiv.org/abs/2302.08938. DOI 10.1016/j.ejc.2024.104036. © Elsevier B.V.
- 2024 (co-authors M. Bekos, G. Da Lozzo, M. Kaufmann): Graph Product Structure for h-Framed Graphs. Electronic J. Combinatorics 31 (2024), #P4.56. URL: arxiv.org/abs/2204.11495. DOI 10.37236/12123.
- 2024 (co-author J. Jedelský): H-Clique-Width and a Hereditary Analogue of Product Structure. In: MFCS 2024, LIPIcs Vol. 306, Dagstuhl (2024), 61:1--61:16. URL: arxiv.org/abs/2403.16789. DOI 10.4230/LIPIcs.MFCS.2024.61.
- 2024 (co-authors J. Balabán, J. Jedelský): Twin-width and Transductions of Proper k-Mixed-Thin Graphs. Discrete Mathematics 347 (2024), 113876. URL: arxiv.org/abs/2202.12536. DOI 10.1016/j.disc.2024.113876.
- 2024 (co-authors O. Cagirici, B. Roy): On Colourability of Polygon Visibility Graphs. European J. Combinatorics 117 (2024), 103820. URL: arxiv.org/abs/1906.01904. DOI 10.1016/j.ejc.2023.103820.
Teaching and Academic matters (read more)
Petr Hliněný: official faculty personal page at FI MU Brno, CZ
- My courses
(official info, -
read more)
- Autumn: "mass" course
FI:IB000 Mathematical Foundations of CS, syllabus
And master-level course
FI:MA010 Graph Theory, syllabus
Refer to this calendar for teaching hours, exams, etc. - Spring: graduate-level course
FI:MA026 Advanced Combinatorics.
Seminar group(s) of
FI:IV119 Seminar on Discrete Mathematical Methods. - And an all-year-round research seminar group within
FI:IV131 Seminar of Discrete Methods and Algorithms Laboratory.
- Autumn: "mass" course
- Guarantor of the Doctoral study programme Computer Science
(the program board):
- the one overall doctoral programme in all Computer Science at FI MU, Brno,
- great opportunities for everybody wishing to study CS on the highest level, from pure theory to methodology and industrial applications.
- Once again, an offer of my Bc/Ms thesis topics,
- and numerous opportunities for students to join our theoretical research.
![[ph]](./images/PHfoto-17small.png){kind=small}
