The following pages link to Tomáš Gavenčiak (Q465288):
Displayed 16 items.
- Firefighting on square, hexagonal, and triangular grids (Q465289) (← links)
- Cop-win graphs with maximum capture-time (Q968433) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Sorting by swaps with noisy comparisons (Q1725654) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- Compact I/O-efficient representation of separable graphs and optimal tree layouts (Q2327474) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Catching a Fast Robber on Interval Graphs (Q3010416) (← links)
- (Q3104264) (← links)
- Deciding First Order Properties of Matroids (Q3167015) (← links)
- Cops and Robbers on String Graphs (Q3459875) (← links)
- (Q5009484) (← links)
- (Q5298910) (← links)