Jiří Fiala - Curriculum vitae

Personal information

Office address:	Institute of Theoretical Computer Science (ITI)
	and Department of Applied Mathematics (KAM)
	Faculty of Mathematics and Physics, Charles University,
	Malostranské nám. 25, Praha 1, 118 00, Czech republic
Email address:	fialakam.mff.cuni.cz
Phone:	+420 - 221 914 322
Education:	1997 - 2000, Charles University - graduated at Doctor degree (PhD.) in 2000
	1991 - 1997, Charles University - graduated at Master degree (Mgr.) in 1997
Past occupation	2001 - 2002, research postdoc position at University of Bergen, Norway
	2000 - 2001, research postdoc position at University of Kiel, Germany

Research interests

1. Graph homomorphisms and covering projections
2. Graph coloring and distance labeling
3. Graph algorithms for geometric intersection graphs (disk graphs)

Thesis

• Structure and Complexity of Locally Constrained Graph Homomorphisms,
  Habilitation Thesis, Charles University, 2007 (BibTeX)
   
• Locally injective homomorphisms,
  Doctoral Thesis, Charles University, 2000 (BibTeX)
   
• Pokrývání grafů (Graph covers),
  Master Thesis, Charles University, 1996 (in czech) (BibTeX)
   

List of publications

Majority of my papers (including bibliographic information) is available via DBLP Bibliography Server.

Preprints are freely available in KAM-DIMATIA series and ITI series.

Below are my papers that are not available via DBLP:

• The Subchromatic Index of Graphs,
  with Van Bang Le
  Tatra Mountain Mathematical Publications, 36 (2007), pp. 129-146. (BibTeX)
  © Tatra Mountain Mathematical Publications
   
• Block transitivity and degree matrices: (Extended abstract),
  with José Soto
  CS'06, ENDM 28, (2007), pp. 77-82. (BibTeX)
  © Elsevier
   
• On the computational complexity of partial covers of Theta graphs,
  with Jan Kratochvíl and Attila Pór
  GRACO'05, ENDM 19, (2005), pp. 79-85. (BibTeX)
  © Elsevier
   
• New lower bounds on the weighted chromatic number of a graph,
  with Massimiliano Caramia
  Discussiones Mathematicae Graph Theory, 24 (2), (2004), pp. 183-195. (BibTeX)
  © Discussiones Mathematicae Graph Theory
   
• Generalized H-coloring and H-covering of trees,
  with Pinar Heggernes, Petter Kristiansen and Jan Arne Telle
  Nordic Journal of Computing 10 (3), (2003), pp. 206-224.
  © Nordic Journal of Computing
   
• Graph Subcolorings: Complexity and Algorithms,
  with Klaus Jansen, Van Bang Le and Eike Seidel,
  SIAM Journal on Discrete Mathematics, 16 (4), (2003), pp. 635-650.
  © Society for Industrial and Applied Mathematics
   
• NP-completeness of the edge precoloring extension problem on bipartite graphs,
  Journal of Graph Theory, 43, (2003), pp. 156-160. (BibTeX)
  © Wiley
   
• On-line coloring of geometric intersection graphs,
  with Thomas Erlebach,
  Computational Geometry: Theory and Applications, 23 (2), (2002), pp. 243-255.
  © Elsevier North-Holland
   
• Partial covers of graphs,
  with Jan Kratochvíl,
  Discussiones Mathematicae Graph Theory, 22 (1), (2002), pp. 89-99. (BibTeX)
  © Discussiones Mathematicae Graph Theory
   
• Geometric separation and exact solutions for the parameterized independent set problem on disk graphs,
  with Jochen Alber
  IFIP TCS'02, IFIP Conference Proceedings 223, (2002), pp. 26-37.
  © Kluwer
   
• Fixed-parameter complexity of lambda-labelings,
  with Ton Kloks and Jan Kratochvíl,
  Discrete Applied Mathematics, 113 (1), (2001), pp. 59-72.
  © Elsevier North-Holland
   
• Note on the computational complexity of covering regular graphs,
  9th Annual Conference of Doctoral Students, WDS'00, (2000), pp. 89-90. (BibTeX)