Petr Hliněný

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

@ynenilhfi.muni.cz
Faculty of Informatics MU Brno, CZ
Office G204 in "Gotex" building B
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-like courses MA051,52,...
• Selection of Bc/Ms thesis topics.
• Recent student achievements.

This page is under construction (as of Oct 2011) - wait a bit longer for the full version...

FI:MA051 Advanced Graph Theory - Topological  (2012)

Spring 2012: every Tuesday 13-16h in G215 (our seminar room in Gotex).
For all those who would like to dive into depths of serious graph theory, this time mostly focused on graph drawings on surfaces (topological).

FI:MA052 Advanced Graph Theory - Structural  (2013)

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! Even first year students with interest in math are most warmly welcome.

• Official seminar entry in IS
• Spring 2012 seminar: every Tuesday 10-12h, now in G123 (Gotex).
  • Want to think about some nice combinatorial problems...?
    OK, so how many balls can touch each other in 3D? 5 or 6?
    And how many convex polytopes may touch (face-to-face) each other in 3D? 10 or 100, or even more?
  • Come and see us!

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:
  
  • 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

• 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).
• Student research grants at MU (Program rektora)
  R. Ganian in 2009-11, M. Derka in 2010-11.
• Best student papers of:
  SOFSEM 2011 (R. Ganian), MEMICS 2011 (O. Moriš).
• Selected publication coauthored with my students:
  • 2012 (co-authors R. Ganian, A. Langer, J. Obdržálek, P. Rossmanith, S. Sikdar):   Lower Bounds on the Complexity of MSO1 Model-Checking.  In: STACS 2012, Leibniz International Proceedings in Informatics LIPIcs, Dagstuhl (2012), 326-337.   URL: arxiv.org/abs/1109.5804. DOI 10.4230/LIPIcs.STACS.2012.326.
  • 2011 (co-author O. Moriš):   Scope-based route planning.  In: ESA 2011, Lecture Notes in Computer Science 6942, Springer (2011), 445-456.   URL: arxiv.org/abs/1101.3182. DOI 10.1007/978-3-642-23719-5_38. © Springer-Verlag.
  • 2011 (co-authors M. Chimani, M. Derka, M. Klusáček):   How Not to Characterize Planar-emulable Graphs.  In: IWOCA 2011, Lecture Notes in Computer Science 7056, Springer (2011), 106-120.   URL: arxiv.org/abs/1107.0176. DOI 10.1007/978-3-642-25011-8_9. © Springer-Verlag.
  • 2011 (co-authors R. Ganian, J. Obdržálek):   Clique-width: When Hard Does Not Mean Impossible.  In: STACS 2011, Leibniz International Proceedings in Informatics LIPIcs Vol 9, Dagstuhl (2011), 404-415.   URL: drops.dagstuhl.de/opus/volltexte/2011/3030. DOI 10.4230/LIPIcs.STACS.2011.404.
  • 2010 (co-author R. Ganian):   On Parse Trees and Myhill-Nerode-type Tools for handling Graphs of Bounded Rank-width.  Discrete Applied Mathematics 158 (2010), 851-867.   DOI 10.1016/j.dam.2009.10.018. © Elsevier B.V. Preprint/file.
  • 2010 (co-authors R. Ganian, J. Kneis, D. Meister, J. Obdržálek, P. Rossmanith, S. Sikdar):   Are there any good digraph width measures?.  In: IPEC 2010, Lecture Notes in Computer Science 6478, Springer Verlag (2010), 135-146.   URL: arxiv.org/abs/1004.1485v1. DOI 10.1007/978-3-642-17493-3_14. © Springer-Verlag.