My Research
My name is Tomáš Masařík and I am a PhD student at the Department of Applied Mathematics of the Faculty of Mathematics and Physics at the Charles University, Prague, Czech Republic. My supervisor is Jiří Fiala. I am also affiliated with the Computer Science Institute of Charles University and I participated in the Center of Excellence  Institute for Theoretical Computer Science. Currently, I am on the internship at the University of Warsaw in the project CUTACOMBS supervised by Marcin Pilipczuk.
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

Packing directed circuits quarterintegrally (TM, I. Muzi, Ma. Pilipczuk, P. Rzążewski, M. Sorge):
 Accepted to ESA A 2019.
 An arXiv version.

Diversity in Combinatorial Optimization (J. Baste, M.R. Fellows, L. Jaffke, TM, M. de Oliveira Oliveira, G. Philip, F.A. Rosamond):
 An arXiv version.

Flexibility of planar graphs without 4cycles (TM): [PDF]
 Accepted to Eurocomb 2019.
 An arXiv version.
 DIMEA days 2019: A meeting with a poster.

Flexibility of planar graphs of girth at least six (Z. Dvořák, TM, J. Musílek, O. Pangrác):
[PDF]
 An arXiv version.
 DIMEA days 2019: A meeting with a poster.

Flexibility of trianglefree planar graphs (Z. Dvořák, TM, J. Musílek, O. Pangrác):
 Cycles and Colourings 2017: A workshop with a presentation.
 An arXiv version.
 DIMEA days 2019: A meeting with a poster.

Steiner Tree Heuristics [PACE 2018 TRACK C] (R. Hušek, T. Toufar, D. Knop, TM, E. Eiben): [PDF]
 PACE report 2018
 Ceremony at IPEC announcing the results: We were awarded by 4th place in Track C.
 Public repository with our implementation.
 Ranking on public instances.

Colouring (P_r+P_s)Free Graphs (T. Klimošová, J. Malík, TM, J. Novotná, D. Paulusma, V. Slívová):
 Acccepted to ISAAC 2018: A conference with proceedings and a presentation..
 An arXiv version.
 ALGO seminar presentation (J, Novotná) at the University of Bergen, May 2018.
 Noon lecture presentation at the Charles University, Prague, December 2018.

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ý):
 STACS 2018: A conference with proceedings and a presentation.
 PAAW 2018: A workshop by ICALP conference with a presentation.
 HALG 2018: poster (P. Dvořák).
 An arXiv version.

On difference graphs and the local dimension of posets (J. Kim, R.R. Martin, TM, W. Shull, H.C. Smith, A. Uzzell, Z. Wang):
 A noon lecture at the Charles University, Prague, May 2018.
 ALGO seminar presentation at the University of Bergen, Feb 2018.
 HOMONOLO 2017: A workshop with a presentation.
 An arXiv version.

Notes on complexity of packing coloring (M. Kim, B. Lidický, TM, F. Pfender):
 Warsaw University of Technology seminar presentation.
 Cycles and Colourings 2018: A workshop with a presentation.
 A journal version published in IPL journal.
 An arXiv version.

Duality gap in interval linear programming (J. Novotná, M. Hladík, TM):
 An extended journal version (submitted 2018).
 SOR 2017: A workshop with proceedings and a presentation (J. Novotná).
 An arXiv version.

Parameterized Complexity of Fair Vertex Evaluation Problems (D. Knop, TM, T. Toufar): [PDF]
 Parameterized complexity of fair deletion problems II.
 Accepted to MFCS 2019 with proceedings.
 CSGT 2017: A workshop with a presentation and book of abstarcts.
 MCGTC 2017: A workshop with a presentation.
 GROW 2017: A workshop with a presentation.
 Open problems seassion at ISAAC 2018 presentation.
 An arXiv version.

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity (D. Knop, M. Koutecký, TM, T. Toufar):
 A conference version was accepted in WG 2017 with proceedings and received there the Best Student Paper Award. Conference peresentation (D. Knop).
 MCW XXII (2017): A workshop with a presentation.
 An arXiv version.

Parameterized complexity of fair deletion problems (TM, T. Toufar):
 A journal version in Special issue of the Discrete Applied Mathematics journal.
 TAMC 2017: A conference with LNCS proceedings and a presentation (T. Toufar).
 An arXiv version.
 BGW 2016: A workshop with a presentation (T. Toufar).
 MEMICS 2016: A workshop with a poster.

AntiPath Cover on Sparse Graph Classes (P. Dvořák, D. Knop, TM):
 MEMICS 2016: A conference with an EPTCS proceedings and a presentation
 published on arXiv.
 BGW 2016: A workshop with a presentation.

Trianglefree planar graphs with the smallest independence number (Z. Dvořak, TM, J. Musílek, O. Pangrác):
 A journal version accepted in Journal of Graph Theory.
 An arXiv version.
 Cycles and Colourings 2016: A workshop with a presentation (J. Musílek).

Computational complexity of Distance Edge labeling (D. Knop, TM):
 Cycles and Colourings 2016: A workshop with a presentation.
 IWOCA 2015: A conference with LNCS proceedings, and my presentation.
 A presentation at KAM noon lectures 2015
 An arXiv version.
 An extended journal version in Special issue of the Discrete Applied Mathematics journal.
 A preprinted version in ITIseries.
 Diploma Thesis: Výpočetní složitost problémů kombinatorické optimalizace pro specifické třídy grafů (in czech) (2014).
Internships / Research Collaboration
 University of Warsaw, Poland sep 2018  sep 2019 (M. Pilipczuk, project CUTACOMBS)
 Durham University, UK nov 2018, aprmay 2019 (D. Paulusma)
 Warsaw University of Technology, Poland nov 2018
 University of Bergen, Norway janjul 2018 (Erasmus)
 LAMSADE, Université ParisDauphine, France dec 2017
 University of Denver, Colorado and University of Colorado Denver, US jul 2017 (GRWC)
 DIMACS, Rutgers, The State University of New Jersey, US junjul 2015 (REU)
 Department of Computer and Information Science, University of Oregon, US apr 2015
 Grenoble Alpes University  Laboratory GSCOP, France dec 2014
Organization
Other (reports, ed.)
 Spring School 2018 printed in ITIseries.
 CzechSlovak conference on Graph Theory 2017 printed in ITIseries.
 Spring School 2017 printed in ITIseries.
 Spring School 2016 printed in ITIseries.
 The report from REU 2015 printed in ITIseries.