Welcome to my academic pages!
Prof. RNDr. Petr Hliněný, Ph.D.
Scientific research - overview (read more)
- The theory research group - Formal Methods, Logic and
FI MU Brno, CZ,
and the official research topics.
- My research directions in brief (and current news):
- discrete mathematics, graph theory (structural and topological),
- theoretical computer science (combinatorial algorithms, parameterized complexity, logic).
- Current Ph.D. students (official listing):
Ondrej Moriš (since 2010-), Jakub Gajarský (since 2012-), Marek Derňár (since 2012-).
- Selected past students:
Robert Ganian (Ph.D. 2012) - now TU Wien, Martin Derka (Mgr. 2013) - now Univ. Waterloo.
- Faculty collaborators: Jan Obdržálek,
Michal Kotrbčík (till 2015), Sebastian Ordyniak (till 2015),
and an overview of research collaboration.
- Research opportunities for students (more details):
- try those various bonus assignments offered in my mass courses, and continue in my advanced courses,
- visit the seminar FI:IV119 Seminar on Discrete Mathematical Methods (already for first-year students),
- see an offer of bachelor/master thesis topics
related to my research (IS listing),
and 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) and into graph algorithms (with emphasis on parameterized complexity) can be discussed. See the current research topics.
- A short list of selected recent publications
- 2015 (co-author G. Salazar): On Hardness of the Joint Crossing Number. In: ISAAC 2015, Lecture Notes in Computer Science 9472, Springer (2015), to appear. URL: arxiv.org/abs/1509.01787.
- 2015 (co-authors R. Ganian, J. Kneis, D. Meister, J. Obdržálek, P. Rossmanith, S. Sikdar): Are there any good digraph width measures?. J. of Combinatorial Theory ser. B (2015?), to appear. URL: arxiv.org/abs/1004.1485. DOI 10.1016/j.jctb.2015.09.001.
- 2015 (co-authors J. Gajarský, J. Obdržálek, S. Ordyniak): Faster Existential FO Model Checking on Posets. Logical Methods in Computer Science (2015), to appear. URL: arxiv.org/abs/1409.4433.
- 2015 (co-authors R. Ganian, D. Král', J. Obdržálek, J. Schwartz, J. Teska): FO Model Checking of Interval Graphs. Logical Methods in Computer Science (2015), to appear. URL: arxiv.org/abs/1302.6043.
- 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: FOCS 2015, ACM (2015), to appear. URL: arxiv.org/abs/1504.04115.
- 2015 (co-author J. Gajarský): Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Logical Methods in Computer Science 11 (2015), paper 19. URL: arxiv.org/abs/1204.5194. DOI 10.2168/LMCS-11(1:19)2015.
- 2015 (co-author M. Derka): Planar Emulators Conjecture Is Nearly True for Cubic Graphs. European J. Combinatorics 8 (2015), 63-70. DOI 10.1016/j.ejc.2015.02.009. © Elsevier B.V. Preprint/file.
- 2014 (co-authors S. Cabello, M. Chimani): Computing the stretch of an embedded graph. SIAM J. Discrete Mathematics 28 (2014), 1391-1401. URL: www.fmf.uni-lj.si/~cabello/publications/cch-stretch-2013.pdf. DOI 10.1137/130945636. © Society for Industrial and Applied Mathematics.
- 2014 (co-authors R. Ganian, J. Kneis, A. Langer, J. Obdržálek, P. Rossmanith): Digraph Width Measures in Parameterized Algorithmics. Discrete Applied Mathematics 168 (2014), 88-107. DOI 10.1016/j.dam.2013.10.038. Preprint/file.
- 2014 (co-authors R. Ganian, A. Langer, J. Obdržálek, P. Rossmanith, S. Sikdar): Lower Bounds on the Complexity of MSO1 Model-Checking. Journal of Computer and System Sciences 80 (2014), 180-194. URL: arxiv.org/abs/1109.5804. DOI 10.1016/j.jcss.2013.07.005. © Elsevier B.V.
- 2013 (co-authors 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. In: ESA 2013, Lecture Notes in Computer Science 8125, Springer (2013), 529-540. URL: arxiv.org/abs/1302.6863. DOI 10.1007/978-3-642-40450-4_45. © Springer-Verlag.
- 2013 (co-authors R. Ganian, D. Král', J. Obdržálek, J. Schwartz, J. Teska): FO Model Checking of Interval Graphs. In: ICALP 2013, Lecture Notes in Computer Science 7966, Springer (2013), 250-262. URL: arxiv.org/abs/1302.6043. DOI 10.1007/978-3-642-39212-2_24. © Springer-Verlag.
- 2013 (co-authors R. Ganian, J. Obdržálek): Better algorithms for satisfiability problems for formulas of bounded rank-width. Fundamenta Informaticae 123 (2013), 59-76. URL: arxiv.org/abs/1006.5621. DOI 10.3233/FI-2013-800.
- 2013 (co-authors R. Ganian, J. Obdržálek): Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width. European J. Combinatorics 34 (2013), 680-701. DOI 10.1016/j.ejc.2012.07.024. © Elsevier B.V. Preprint/file.
- 2013 (co-authors M. Chimani, M. Derka, M. Klusáček): How Not to Characterize Planar-emulable Graphs. Advances in Applied Mathematics 50 (2013), 46-68. URL: arxiv.org/abs/1107.0176. DOI 10.1016/j.aam.2012.06.004. © Elsevier B.V. Addendum.
Teaching and Academic matters (read more)
Petr Hliněný: official faculty personal page at FI MU Brno, CZ
- My courses
(official info, -
- Autumn: "mass" courses
FI:MA010 Graph Theory, syllabus
FI:IB000 Mathematical Foundations of CS, syllabus
refer to this calendar for teaching hours, exams, etc.
- Spring: selective seminar groups in
FI:IV125 Formela lab seminar (see in IS)
and an offer for interested young students
FI:IV119 Seminar on Discrete Mathematical Methods (in IS).
- Autumn: "mass" courses
- Study programme of Mathematical Informatics
- bachelor degree program offered for students who want to know more on mathematical background of Computer Science, and who would, perhaps, like to continue an academic career in theoretical CS,
- great opportunities for theory research are offered to students already at the Bachelor level, among others within our research group.
- Once again, an offer of my Bc/Ms thesis topics,
- possibility of a PhD study at FI MU Brno, CZ - with stipend,
- and numerous opportunities for students to join our theoretical research.