My Research

My name is Tomáš Masařík and I am currently Postdoc at the University of Warsaw in the project CUTACOMBS supervised by Marcin Pilipczuk.

I did my PhD at the Department of Applied Mathematics of the Faculty of Mathematics and Physics at the Charles University, Prague, Czech Republic under the supervision of Jiří Fiala. I was also affiliated with the Computer Science Institute of Charles University and I participated in the Center of Excellence - Institute for Theoretical Computer Science.

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. FPT Algorithms for Diverse Collections of Hitting Sets (J. Baste, L. Jaffke, TM, G. Philip, G. Rote):
  2. Packing directed circuits quarter-integrally (TM, I. Muzi, Ma. Pilipczuk, P. Rzążewski, M. Sorge):
  3. Diversity in Combinatorial Optimization (J. Baste, M.R. Fellows, L. Jaffke, TM, M. de Oliveira Oliveira, G. Philip, F.A. Rosamond):
  4. Flexibility of planar graphs without 4-cycles (TM): [PDF]
  5. Flexibility of planar graphs of girth at least six (Z. Dvořák, TM, J. Musílek, O. Pangrác): [PDF]
  6. Flexibility of triangle-free planar graphs (Z. Dvořák, TM, J. Musílek, O. Pangrác):
  7. Steiner Tree Heuristics [PACE 2018 TRACK C] (R. Hušek, T. Toufar, D. Knop, TM, E. Eiben): [PDF]
  8. Colouring (P_r+P_s)-Free Graphs (T. Klimošová, J. Malík, TM, J. Novotná, D. Paulusma, V. Slívová):
  9. Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (P. Dvořák, A.E. Feldmann, D. Knop, TM, T. Toufar, P. Veselý):
  10. On difference graphs and the local dimension of posets (J. Kim, R.R. Martin, TM, W. Shull, H.C. Smith, A. Uzzell, Z. Wang):
  11. Notes on complexity of packing coloring (M. Kim, B. Lidický, TM, F. Pfender):
  12. Duality gap in interval linear programming (J. Novotná, M. Hladík, TM):
  13. Parameterized Complexity of Fair Vertex Evaluation Problems (D. Knop, TM, T. Toufar): [PDF]
  14. Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity (D. Knop, M. Koutecký, TM, T. Toufar):
  15. Parameterized complexity of fair deletion problems (TM, T. Toufar):
  16. Anti-Path Cover on Sparse Graph Classes (P. Dvořák, D. Knop, TM):
  17. Triangle-free planar graphs with the smallest independence number (Z. Dvořak, TM, J. Musílek, O. Pangrác):
  18. Computational complexity of Distance Edge labeling (D. Knop, TM):

Internships / Research Collaboration

Organization

Other (reports, ed.)

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

masarik<a>kam.mff.cuni.cz


Room 320, KAM MFF, Malostranské náměstí 25, Praha 1, 11800, Czech Republic
Room 1650, MIMUW, Banacha 2, Warsaw, 02-097, Poland
tel +420 22191 4294

Profile for TarkenCZE-Maso sDýní