Better see my NEW PAGES,

   hurry, or you miss it...

    Dr. Petr Hlineny

Here is my current mailing address

Petr Hlineny
Faculty of Informatics MU,
Botanicka 68a,
602 00  Brno,
Czech Republic

and here is my academic position.

    My brief CV

• 1995, Mgr. (equivalent M.Sc.) in Computer Science,
  Faculty of Mathematics and Physics, Charles University, Czech Republic.
• 1999, PhD. in Algorithms, Combinatorics, and Optimization
  (advisor Prof. Robin Thomas),
  Dissertation `Planar Covers of Graphs: Negami's Conjecture',
  School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia, USA.
• 2000, PhD. in Combinatorics and Discrete Mathematics,
  (advisor Prof. Jan Kratochvíl),
  Dissertation `Contact Representations of Graphs',
  Faculty of Mathematics and Physics, Charles University, Czech Republic.
• 2003, Habilitation in Computer Science,
  Habilitation work `Computational Aspects of Representable Matroids',
  VŠB - Technical University of Ostrava, Czech Republic.

• Geometrical representations of graphs and their recognition, related algorithms.
• Graph embeddings on surfaces, and mainly crossing number problems - structural results and algorithmic complexity, approximation algorithms.
• Matroid representations, structural properties of matroid branch-width/tree-width. Matroid computations (MACEK), exhaustive generation via a computer.
• Parametrized complexity of combinatorial problems. Tree- and branch-decompositions of graphs, parameterized algorithms on tree-structured graphs (on their parse trees) and related formal tools.
• Alternative structural `width' parameters, rank-width and bi-rank-width and their parse trees, parameterized algorithms on graphs of bounded rank-width. Extensions of traditional width parameters on digraphs.

• Faculty of Mathematics and Physics, Charles University, Czech Republic, 1995-1997.
• School of Mathematics, Georgia Institute of Technology, USA, 1998-1999.
• The Fields Institute, University of Toronto, Canada, 1999-2000.
• School of Mathematical and Computing Sciences, Victoria University, New Zealand, 2000-2002.
• Institute of Theoretical Computer Science, Charles University, 2000-2004.

• Institute of Mathematics and Computer Science, Matej Bel University, Slovakia, 2002-2004.
• Department of Computer Science, Technical University Ostrava, Czech Republic, 2003-2007.
• Faculty of Informatics, Masaryk University Brno, Czech Republic, since 2005-.

• Bolzano prize in Computer Science for the work `Contact Graphs of Curves' at the Faculty of Mathematics and Physics, Charles University in 1995.
• Jerrold E. Marsden Distinguished Postdoctoral Fellowship at The Fields Institute, Toronto, Canada in 1999/2000.
• Research grant project VEGA 1/1002/04 (`Branch-Width of Graphs and Matroids in Relations to Logic and Parametrized Complexity'), 2004-2005.
• Research grant project GACR 201/05/0050 (`Structural properties and algorithmic complexity of discrete problems'), 2005-2007.
• Research grant project GACR 201/08/0308 (`Utilization of Structural and Width Parameters in Combinatorics and Algorithmic Complexity'), 2008-2010.
• Billateral research grant project GACR 201/09/J021 (`Structural Graph Theory and Parameterized Complexity'), with P. Rossmanith, RWTH Aachen, 2009-2010.
• Journal of Combinatorial Theory, ser. B, Top cited article 2005-2010 award.
• Research grant project GACR P202/11/0196 (`Well-structured combinatorial classes, width parameters, and design of efficient algorithms'), 2011-2013.

The coming full CV is available in a PDF format. If you do not see it on this page below, download the PDF file yourself.