Welcome to my academic pages!
Doc. RNDr. Petr Hliněný, Ph.D.
Associate professor
@ynenilhfi.muni.cz
Faculty of Informatics MU Brno, CZ
Botanická 68a, 602 00 Brno
Office G204
Chaloupeckého nám. in "Gotex" building B
Calendar of my teaching, office hours, and duties
Scientific research - overview (read more)
- Main research directions (actual information):
- discrete mathematics, graph theory (structural and topological)
- theoretical computer science (combinatorial algorithms, parameterized complexity)
- Our research group at FI MU Brno, CZ,
faculty - Petr Hliněný, Jan Obdržálek, Reshma Ramadurai,
and an overview of our research collaboration. - Current Ph.D. students (official listing):
Robert Ganian (2008-2012?), Ondrej Moriš (since 2010-), Jakub Gajarský (since 2012-) - New postdoc research position at FI MU Brno, CZ;
available since 1.7.2012 for 3 years in the areas of Structural graph theory and Parameterized algorithms. - Research opportunities for students (more details):
- try to do more, e.g. the various bonus assignments, in my courses,
- visit our student FI:IV119 Seminar on Discrete Mathematical Methods,
- see bachelor/master thesis topics related to our research
and read about scientific achievements of our students, - 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 our current research directions.
- A short list of selected recent publications
(full list):
Petr Hliněný- 2012 (co-authors M. Chimani, M. Derka, M. Klusáček): How Not to Characterize Planar-emulable Graphs. Advances in Applied Mathematics (2012), to appear, 26 p. URL: arxiv.org/abs/1107.0176.
- 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.
- 2012 (co-authors M. Chimani, P. Mutzel): Vertex Insertion approximates the Crossing Number for Apex Graphs. Europ. J. Combin. 33 (2012), 326-335. DOI 10.1016/j.ejc.2011.09.009. © Elsevier B.V. Preprint/file.
- 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-author M. Chimani): A Tighter Insertion-based Approximation of the Crossing Number. In: ICALP 2011, Part I, Lecture Notes in Computer Science 6755, Springer (2011), 122-134. DOI 10.1007/978-3-642-22006-7_11. © Springer-Verlag. Preprint/file.
- 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-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.
- 2010: 20 Years of Negami's Planar Cover Conjecture. Graphs and Combinatorics 26 (2010), 525-536. DOI 10.1007/s00373-010-0934-9. © Springer-Verlag. Preprint/file.
- 2010 (co-author M. Chimani): Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. In: SODA 2010, ACM-SIAM (2010), 918-927. URL: www.siam.org/proceedings/soda/2010/soda10.php. © Society for Industrial and Applied Mathematics. Preprint/file.
Teaching and Academic matters (read more)
Petr Hliněný: official faculty personal page at FI MU Brno, CZ
- My courses taught at FI MU Brno, CZ
(official info):
- Autumn: "mass" courses (read more)
FI:MA010 Graph Theory, syllabus
FI:IB000 Introduction to CS, syllabus
refer to this calendar for teaching hours, exams, etc. - Spring: selective seminar-like courses (read more);
FI:MA051 Advanced Graph Theory - Topological (2012)
FI:MA052 Advanced Graph Theory - Structural (2013)
etc ... see also the IS listing. - More for interested young students:
FI:IV119 Seminar on Discrete Mathematical Methods (in IS)
- Autumn: "mass" courses (read more)
- Study programme of Mathematical Informatics
(official info):
- 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, a selection of my Bc/Ms thesis topics at FI MU Brno, CZ,
- possibility of a PhD study at FI MU Brno, CZ - with stipend,
- and numerous opportunities for students to join our theoretical research.
