My research

My research interests are in Graph Theory: mostly coloring problems, computational complexity and parameterized complexity. A list of my publications is also presented at google scholar and orcid. My preprints are usually available at arXiv.

Papers

  1. Flexibility of triangle-free planar graphs (Z. Dvořák, TM, J. Musílek, O. Pangrác):
  2. Parameterized complexity of fair deletion problems II. (D. Knop, TM, T. Toufar):
  3. Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity (D. Knop, M. Koutecký, TM, T. Toufar):
  4. Computational complexity of Distance Edge labeling [extended version] (D. Knop, TM):
  5. Parameterized complexity of fair deletion problems (TM, T. Toufar):
  6. Anti-Path Cover on Sparse Graph Classes (P. Dvořák, D. Knop, TM):
  7. Triangle-free planar graphs with the smallest independence number (Z. Dvořak, TM, J. Musílek, O. Pangrác):
  8. Computational complexity of Distance Edge labeling (D. Knop, TM):

Internships / research colaboration

Organizing

Other publications (editorial)

  1. Czech-Slovak conference on Graph Theory 2017 printed in ITI-series.
  2. Spring School 2017 printed in ITI-series.
  3. Spring School 2016 printed in ITI-series.
  4. The report from REU 2015 printed in ITI-series.

Profile for TarkenCZE-Maso sDn