The following pages link to Tomáš Masařík (Q1641148):
Displaying 43 items.
- Notes on complexity of packing coloring (Q1641149) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- On difference graphs and the local dimension of posets (Q1987070) (← links)
- On weak flexibility in planar graphs (Q2093108) (← links)
- Clique-width: harnessing the power of atoms (Q2110611) (← links)
- Linear bounds for cycle-free saturation games (Q2153400) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- Duality gap in interval linear programming (Q2302757) (← links)
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
- Triangle‐free planar graphs with the smallest independence number (Q4630003) (← links)
- Flexibility of planar graphs of girth at least six (Q5066932) (← links)
- Constant Congestion Brambles in Directed Graphs (Q5071097) (← links)
- (Q5075819) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- Random 2-cell embeddings of multistars (Q5086920) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- (Q5092394) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)
- Tuza's Conjecture for Threshold Graphs (Q6045403) (← links)
- The Phase Transition of Discrepancy in Random Hypergraphs (Q6046817) (← links)
- Flexibility of triangle‐free planar graphs (Q6055413) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- Flexibility of triangle-free planar graphs (Q6313788) (← links)
- Packing Directed Cycles Quarter- and Half-Integrally (Q6321542) (← links)
- Clique-Width: Harnessing the Power of Atoms (Q6342208) (← links)
- Single-conflict colorings of degenerate graphs (Q6504830) (← links)
- Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic (Q6506944) (← links)
- Proper Rainbow Saturation Numbers for Cycles (Q6527274) (← links)
- A tight quasi-polynomial bound for \textsc{Global Label Min-Cut} (Q6538538) (← links)
- Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation (Q6538653) (← links)
- Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument (Q6560891) (← links)
- List locally surjective homomorphisms in hereditary graph classes (Q6602450) (← links)
- Flexibility of planar graphs without 4-cycles (Q6621243) (← links)
- Random embeddings of graphs: the expected number of faces in most graphs is logarithmic (Q6645399) (← links)
- On the Uncrossed Number of Graphs (Q6738654) (← links)
