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
 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 page is under construction (as of Sep 2014)  wait a bit longer for the full version...
Teaching: Autumn, IB000 and MA010
Teaching: Spring selective seminars

FI:IV125 Formela lab seminar;
 uptodate seminar details.
 My research seminar topics are related to advanced structural or topological graph theory (replacing previous separate subjects MA051,2,3).
 And, the following IV119 seminar for young students...
FI:IV119 Seminar on Discrete Mathematical Methods
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 2017 seminar: in C417, Wednesday 810 every week
 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...

For every interested students, think about the following already before the first seminar:
What Euler's formula says for a polytope in 4D? How to prove it, knowing the 3D version?
Alternatively: Imagine a simplex in 3D, and several (or many) points inside it. Can you now cut the big simplex into smaller simplices such that their vertices will be the original vertices or the given internal points, and that every two of these points will share an edge of some simplex? (I.e., the net of this complex shall be the complete graph.) How would you describe such a cutting?  Come and see us (even if you participated in 2016  we will study different topics of The Book)...
 See also a list of past 2016 topics here.
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, 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:
 Characterizing DAGdepth of directed graphs, 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 our group.
Read about Ph.D. study in our group
Recent achievements of our students (2012)
 Rector's Awards MU:
J. Gajarsk&yaccute;, 2016 Rector's Award for the Best Students in Doctoral Programmes,
J. Gajarsk&yaccute;, 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
(Program rektora)
R. Ganian in 200911, M. Derka in 201011.  Best student papers of:
SOFSEM 2011 (R. Ganian), MEMICS 2011 (O. Moriš).  Selected publication coauthored with my students:
 2017 (coauthors F. Pokrývka, B. Roy): FO model checking of geometric graphs. In: IPEC 2017 (2017), to appear. URL: arxiv.org/abs/1709.03701.
 2017 (coauthors J. Gajarský, M. Koutecký, S. Onn): Parameterized Shifted Combinatorial Optimization. In: COCOON 2017, Lecture Notes in Computer Science 10392, Springer (2017), 224236. URL: arxiv.org/abs/1702.06844. DOI 10.1007/9783319623894_19. © SpringerVerlag.
 2017 (coauthors J. Gajarský, J. Obdržálek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Sánchez Villaamil, S. Sikdar): Kernelization Using Structural Parameters on Sparse Graph Classes. Journal of Computer and System Sciences 84 (2017), 219242. URL: arxiv.org/abs/1302.6863. DOI 10.1016/j.jcss.2016.09.002. © Elsevier B.V.
 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 M.Bračič, D. Bokal, M. Derňár): On Degree Properties of Crossingcritical Families of Graphs. In: Graph Drawing 2015, Lecture Notes in Computer Science 9411, Springer (2015), 7586. DOI 10.1007/9783319272610_7. © SpringerVerlag. Preprint/file.
 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.
 2015 (coauthor J. Gajarský): Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Logical Methods in Computer Science 11(1) (2015), paper 19. URL: arxiv.org/abs/1204.5194. DOI 10.2168/LMCS11(1:19)2015.
 2015 (coauthor M. Derka): Planar Emulators Conjecture Is Nearly True for Cubic Graphs. European J. Combinatorics 48 (2015), 6370. DOI 10.1016/j.ejc.2015.02.009. © Elsevier B.V. Preprint/file.
 2014 (coauthors R. Ganian, A. Langer, J. Obdržálek, P. Rossmanith, S. Sikdar): Lower Bounds on the Complexity of MSO1 ModelChecking. Journal of Computer and System Sciences 80 (2014), 180194. URL: arxiv.org/abs/1109.5804. DOI 10.1016/j.jcss.2013.07.005. © Elsevier B.V.
 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.
 2011 (coauthor O. Moriš): Scopebased route planning. In: ESA 2011, Lecture Notes in Computer Science 6942, Springer (2011), 445456. URL: arxiv.org/abs/1101.3182. DOI 10.1007/9783642237195_38. © SpringerVerlag.