Tomáš Gavenčiak

From MaRDI portal
Person:465288

Available identifiers

zbMath Open gavenciak.tomasDBLP00/8050WikidataQ62056487 ScholiaQ62056487MaRDI QIDQ465288

List of research outcomes





PublicationDate of PublicationType
Integer programming in parameterized complexity: five miniatures2022-06-09Paper
Integer programming in parameterized complexity: three miniatures2021-08-04Paper
Cops, a fast robber and defensive domination on interval graphs2019-10-16Paper
Compact I/O-efficient representation of separable graphs and optimal tree layouts2019-10-15Paper
Sorting by swaps with noisy comparisons2019-02-14Paper
Parameterized complexity of distance labeling and uniform channel assignment problems2018-09-17Paper
Cops and robbers on intersection graphs2018-06-28Paper
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems2016-09-02Paper
Cops and Robbers on String Graphs2016-01-11Paper
Firefighting on square, hexagonal, and triangular grids2014-10-31Paper
Cops and robbers on intersection graphs2014-01-14Paper
https://portal.mardi4nfdi.de/entity/Q52989102013-06-25Paper
Hypertree-depth and minors in hypergraphs2013-01-07Paper
Deciding first order properties of matroids2012-11-01Paper
https://portal.mardi4nfdi.de/entity/Q31042642011-12-19Paper
Catching a fast robber on interval graphs2011-07-01Paper
Cop-win graphs with maximum capture-time2010-05-05Paper

This page was built for person: Tomáš Gavenčiak