Tomáš Masařík

From MaRDI portal
Person:1641148

Available identifiers

zbMath Open masarik.tomasWikidataQ62056486 ScholiaQ62056486MaRDI QIDQ1641148

List of research outcomes

PublicationDate of PublicationType
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\)2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61473582024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60682622023-11-13Paper
Clique‐width: Harnessing the power of atoms2023-11-06Paper
Flexibility of triangle‐free planar graphs2023-09-29Paper
The Phase Transition of Discrepancy in Random Hypergraphs2023-09-06Paper
Tuza's Conjecture for Threshold Graphs2023-05-30Paper
Clique-width: harnessing the power of atoms2022-12-21Paper
On weak flexibility in planar graphs2022-11-04Paper
https://portal.mardi4nfdi.de/entity/Q50909952022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50923942022-07-21Paper
Random 2-cell embeddings of multistars2022-07-08Paper
Linear bounds for cycle-free saturation games2022-07-04Paper
Robust Connectivity of Graphs on Surfaces2022-06-23Paper
On 3-coloring of \((2P_4,C_5)\)-free graphs2022-06-08Paper
On 3-coloring of \((2P_4,C_5)\)-free graphs2022-06-01Paper
https://portal.mardi4nfdi.de/entity/Q50758192022-05-11Paper
Constant Congestion Brambles in Directed Graphs2022-04-20Paper
Flexibility of planar graphs of girth at least six2022-03-31Paper
Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory2022-03-02Paper
Flexibility of planar graphs -- sharpening the tools to get lists of size four2021-11-11Paper
Jones' conjecture in subcubic graphs2021-10-26Paper
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices2021-03-30Paper
https://portal.mardi4nfdi.de/entity/Q33041242020-08-05Paper
Colouring \((P_r + P_s)\)-free graphs2020-05-21Paper
Parameterized complexity of fair deletion problems2020-04-21Paper
On difference graphs and the local dimension of posets2020-04-09Paper
Duality gap in interval linear programming2020-02-26Paper
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity2020-01-03Paper
Triangle‐free planar graphs with the smallest independence number2019-03-28Paper
Computational complexity of distance edge labeling2018-06-27Paper
Notes on complexity of packing coloring2018-06-15Paper
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity2018-01-04Paper
Parameterized complexity of fair deletion problems2017-05-19Paper
Computational complexity of distance edge labeling2016-04-04Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


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