Tomáš Masařík

Available identifiers

zbMath Open masarik.tomasWikidataQ62056486 ScholiaQ62056486MaRDI QIDQ1641148

List of research outcomes

Publication	Date of Publication	Type
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\)	2024-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q6147358	2024-01-15	Paper
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor	2023-12-13	Paper
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View	2023-11-13	Paper
Clique‐width: Harnessing the power of atoms	2023-11-06	Paper
Flexibility of triangle‐free planar graphs	2023-09-29	Paper
The Phase Transition of Discrepancy in Random Hypergraphs	2023-09-06	Paper
Minimizing an Uncrossed Collection of Drawings	2023-06-15	Paper
Tuza's Conjecture for Threshold Graphs	2023-05-30	Paper
Clique-width: harnessing the power of atoms	2022-12-21	Paper
On weak flexibility in planar graphs	2022-11-04	Paper
Colouring (P_r+P_s)-Free Graphs	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5092394	2022-07-21	Paper
Random 2-cell embeddings of multistars	2022-07-08	Paper
Linear bounds for cycle-free saturation games	2022-07-04	Paper
Robust Connectivity of Graphs on Surfaces	2022-06-23	Paper
On 3-coloring of \((2P_4,C_5)\)-free graphs	2022-06-08	Paper
On 3-coloring of \((2P_4,C_5)\)-free graphs	2022-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q5075819	2022-05-11	Paper
Constant Congestion Brambles in Directed Graphs	2022-04-20	Paper
Flexibility of planar graphs of girth at least six	2022-03-31	Paper
Max Weight Independent Set in graphs with no long claws: An analog of the Gy\'arf\'as' path argument	2022-03-09	Paper
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory	2022-03-02	Paper
Flexibility of planar graphs -- sharpening the tools to get lists of size four	2021-11-11	Paper
Jones' conjecture in subcubic graphs	2021-10-26	Paper
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices	2021-03-30	Paper
https://portal.mardi4nfdi.de/entity/Q3304124	2020-08-05	Paper
Clique-Width: Harnessing the Power of Atoms	2020-06-05	Paper
Colouring \((P_r + P_s)\)-free graphs	2020-05-21	Paper
Parameterized complexity of fair deletion problems	2020-04-21	Paper
On difference graphs and the local dimension of posets	2020-04-09	Paper
Duality gap in interval linear programming	2020-02-26	Paper
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity	2020-01-03	Paper
Packing Directed Cycles Quarter- and Half-Integrally	2019-07-04	Paper
Triangle‐free planar graphs with the smallest independence number	2019-03-28	Paper
Flexibility of planar graphs without 4-cycles	2019-03-04	Paper
Flexibility of triangle-free planar graphs	2019-02-08	Paper
Computational complexity of distance edge labeling	2018-06-27	Paper
Notes on complexity of packing coloring	2018-06-15	Paper
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity	2018-01-04	Paper
Parameterized complexity of fair deletion problems	2017-05-19	Paper
Computational complexity of distance edge labeling	2016-04-04	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Tomáš Masařík