My teaching and Information for students
Prof. RNDr. Petr Hliněný, Ph.D.
@ynenilhfi.muni.cz
Faculty of Informatics MU Brno, CZ
Office C418
in the FI building, 4th floor
Calendar of my teaching, exams, office hours
 Courses: "mass" IB000 (see in IS IB000),
 and further advanced courses and seminars (in IS IV119).
 Selection of Bc/Ms thesis topics.
 Recent student achievements.
Teaching: "Mass" course Autumn
 FI:IB000 Mathematical Foundations of CS in Czech;
Teaching: Advanced courses and seminars

FI:IV119 Seminar on Discrete Mathematical Methods;
 This is a Spring seminar for all students who like mathematics, and especially beatiful mathematical problems, solutions, and proofs  as presented to us by famous "Proofs from THE BOOK".
 What is required  to read, understand and then present one proof section from the mentioned book.

FI:IV131 Seminar of Discrete Methods and Algorithms Laboratory;
 My research seminar topics are related to advanced structural and geometric/topological graph theory.
 You have to apply for a permission in the IS to get into the seminar, but all students interested in theoretical research are welcome, especially if they consider to write research Bachelor/Master theses under my supervision.
Bc/Ms thesis topics at FI MU Brno, CZ
Generally, any chosen sufficiently interesting topic of graph theory or related algorithmic questions, including parameterized complexity, or combinatorial geometry, may be taken for thesis under my supervision  based on prior mutual agreement. The preference is for topics doing a least a bit of scientific research, and written up in English.
 Officially listed (generic) Bachelor thesis topic.
 For the master level, you may browse under my name the whole
list of Master thesis topics.
 The topics include, e.g, studying width parameters and related games, computing the decompositions, designing parameterized algorithms on graphs, studying crossing number questions, the practical routeplanning problem, etc...
 Selected most successful past thesis titles:
 Stack number and queue number of graphs, Constructive twinwidth for posets of small width, Crossingcritical graphs of high vertex degrees, FO properties of geometric graphs, Obstructions for graphs of low rankdepth, Efficient solvability of graph MSO properties, Partitioning of Weighted Graphs into k Connected Subgraphs, Construction of planar emulators of graphs, Efficient routeplanning in huge graphs, Planar graph emulators: Fellows' conjecture, Automataformalization for graphs of bounded rankwidth...
 A list of my all supervised students at FI MU Brno, CZ.
 See also the current research directions and results of my group.
Read about Ph.D. study in my group
Research achievements of my students
 Rector's Awards MU:
J. Gajarský, 2016 Rector's Award for the Best Students in Doctoral Programmes,
J. Gajarský, 2017 Rector's Award for an Outstanding Doctoral Thesis.  Undergraduate student scientific competition
SVOČ (in Math&CS):
1st prizes R. Ganian (2008), J. Balabán and J. Jedelský (2022)
2nd prizes O. Moriš (2008), M. Derka (2010), M. Klusáček (2011), J. Gajarský (2012), M. Bezek (2016).  Student research grants at MU:
R. Ganian in 200911, M. Derka in 201011.  Best student papers of:
SOFSEM 2011 (R. Ganian), MEMICS 2011 (O. Moriš), CSR 2020 (O. Cagirici).  Selected publication coauthored with my students:
 2023 (coauthors O. Cagirici, F. Pokrývka, A. Sankaran): CliqueWidth of Point Configurations. J. of Combinatorial Theory ser. B 158 (2023), 4373. URL: arxiv.org/abs/2004.02282. DOI 10.1016/j.jctb.2021.09.001.
 2023 (coauthor J. Jedelský): Twinwidth of Planar Graphs is at most 8, and at most 6 when Bipartite Planar. In: ICALP 2023 (2023), to appear. URL: arxiv.org/abs/2210.08620.
 2022 (coauthors J. Balabán, J. Jedelský): Twinwidth and Transductions of Proper kMixedThin Graphs. In: GraphTheoretic Concepts in Computer Science, WG 2022, Lecture Notes in Computer Science 13453, Springer (2022), 4355. URL: arxiv.org/abs/2202.12536. DOI 10.1007/9783031159145_4.
 2020 (coauthor D. Agaoglu): Isomorphism Problem for Sdgraphs. In: Math Foundations of Computer Science MFCS 2020, LIPiCS Vol. 170, Dagstuhl (2020), 4:14:14. URL: arxiv.org/abs/1907.01495. DOI 10.4230/LIPIcs.MFCS.2020.4.
 2019 (coauthors F. Pokrývka, B. Roy): FO model checking of geometric graphs. Computational Geometry: Theory and Applications 78 (2019), 119. URL: arxiv.org/abs/1709.03701. DOI 10.1016/j.comgeo.2018.10.001. © Elsevier B.V.
 2018 (coauthors O. Cagirici, B. Roy): On Colourability of Polygon Visibility Graphs. In: FSTTCS 2017, LIPIcs Vol. 93, Dagstuhl (2018), 21:121:14. DOI 10.4230/LIPIcs.FSTTCS.2017.21.
 2016 (coauthors J. Gajarský, D. Lokshtanov, J. Obdržálek, M.S. Ramanujan): A New Perspective on FO Model Checking of Dense Graph Classes. In: LICS 2016, ACM (2016), 176184. DOI 10.1145/2933575.2935314. Preprint/file.
 2016 (coauthor M. Derňár): Crossing Number is Hard for Kernelization. In: SoCG 2016, LIPIcs Vol. 51, Dagstuhl (2016), 42:142:10. URL: arxiv.org/abs/1512.02379. DOI 10.4230/LIPIcs.SoCG.2016.42.
 2015 (coauthors J. Gajarský, D. Lokshtanov, J. Obdržálek, S. Ordyniak, M.S. Ramanujan, S. Saurabh): FO Model Checking on Posets of Bounded Width. In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, IEEE (2015), 963974. URL: arxiv.org/abs/1504.04115. DOI 10.1109/FOCS.2015.63.
 2013 (coauthors M. Chimani, M. Derka, M. Klusáček): How Not to Characterize Planaremulable Graphs. Advances in Applied Mathematics 50 (2013), 4668. URL: arxiv.org/abs/1107.0176. DOI 10.1016/j.aam.2012.06.004. © Elsevier B.V. Addendum.