Petr Hliněný

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

• Autumn "mass" courses:  FI:IB000 (see in IS),  FI:MA010 (see in IS).
• Student FI:IV119 Seminar on Discrete Mathematical Methods (in IS).
• Spring selective seminar course within IV125 (Formela, in IS).
• Selection of Bc/Ms thesis topics.
• Recent student achievements.

This is an informal 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". If you have ever tried "Mathematical olympiad" or other math competitions at elementary and high schools, then drop by and see how easy is to get from math fun to serious real science. Especially first year students with interest in math are most warmly welcome!

• For all young students who like nice clean mathematics, no prerequisites required.
  Official seminar entry in IS
• Spring 2020 seminar: in C417, but now only online (COVID-19!).
  • So, which problems to deal with this year? We will (traditionally) begin with the number of primes, and we will also look this year at various proofs of Euler's formula... (see this) Then we will pick other nice problems (and their solutions) from number theory, discrete geometry, combinatorics and graphs...
  • Come and see us (even if you participated in a past year - we will study different topics of The Book)...
• See also a list of past 2019 topics here.

Generally, any chosen sufficiently interesting topic of graph theory or related algorithmic questions, including parameterized complexity, 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 route-planning problem, etc...
• Selected most successful past thesis titles:
  
  • FO properties of geometric graphs, Obstructions for graphs of low rank-depth, Characterizing DAG-depth of directed graphs, Efficient solvability of graph MSO properties, Partitioning of Weighted Graphs into k Connected Subgraphs, Construction of planar emulators of graphs, Efficient route-planning in huge graphs, Planar graph emulators: Fellows' conjecture, Automata-formalization for graphs of bounded rank-width...
• A list of my all supervised students at FI MU Brno, CZ.
• See also the current research directions and results of our group.

Read about  Ph.D. study in our group

• 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 prize R. Ganian (2008),
  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 2009-11, M. Derka in 2010-11.
• Best student papers of:
  SOFSEM 2011 (R. Ganian), MEMICS 2011 (O. Moriš), CSR 2020 (O. Cagirici).
• Selected publication coauthored with my students:
  • 2019 (co-authors O. Cagirici, S.K. Ghosh, B. Roy):   On conflict-free chromatic guarding of simple polygons.  In: COCOA 2019, Lecture Notes in Computer Science 11949, Springer (2019), 601--612.   URL: arxiv.org/abs/1904.08624. DOI 10.1007/978-3-030-36412-0_49.
  • 2019 (co-authors F. Pokrývka, B. Roy):   FO model checking of geometric graphs.  Computational Geometry: Theory and Applications 78 (2019), 1--19.   URL: arxiv.org/abs/1709.03701. DOI 10.1016/j.comgeo.2018.10.001. © Elsevier B.V.
  • 2018 (co-authors O. Cagirici, B. Roy):   On Colourability of Polygon Visibility Graphs.  In: FSTTCS 2017, LIPIcs Vol. 93, Dagstuhl (2018), 21:1--21:14.   DOI 10.4230/LIPIcs.FSTTCS.2017.21.
  • 2016 (co-authors 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), 176--184.   DOI 10.1145/2933575.2935314. Preprint/file.
  • 2016 (co-author M. Derňár):   Crossing Number is Hard for Kernelization.  In: SoCG 2016, LIPIcs Vol. 51, Dagstuhl (2016), 42:1--42:10.   URL: arxiv.org/abs/1512.02379. DOI 10.4230/LIPIcs.SoCG.2016.42.
  • 2015 (co-authors 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), 963--974.   URL: arxiv.org/abs/1504.04115. DOI 10.1109/FOCS.2015.63.
  • 2015 (co-author M. Derka):   Planar Emulators Conjecture Is Nearly True for Cubic Graphs.  European J. Combinatorics 48 (2015), 63--70.   DOI 10.1016/j.ejc.2015.02.009. © Elsevier B.V. Preprint/file.