Tomáš Gavenčiak
Tomáš Gavenčiak
Verified email at kam.mff.cuni.cz - Homepage
Title
Cited by
Cited by
Year
Cop-win graphs with maximum capture-time
T Gavenčiak
Discrete Mathematics 310 (10-11), 1557-1563, 2010
312010
LemmaTag: Jointly tagging and lemmatizing for morphologically-rich languages with BRNNs
D Kondratyuk, T Gavenčiak, M Straka, J Hajič
arXiv preprint arXiv:1808.03703, 2018
142018
Cops-and-robbers: remarks and problems
M Boyer, S El Harti, A El Ouarari, R Ganian, T Gavenciak, G Hahn, ...
Journal of Combinatorial Mathematics and Combinatorial Computing 85, 141-159, 2013
122013
Cops and robbers on intersection graphs
T Gavenčiak, P Gordinowicz, V Jelínek, P Klavík, J Kratochvíl
European Journal of Combinatorics 72, 45-69, 2018
112018
Firefighting on square, hexagonal, and triangular grids
T Gavenčiak, J Kratochvíl, P Prałat
Discrete Mathematics 337, 142-155, 2014
82014
Deciding first order properties of matroids
T Gavenčiak, D Král, S Oum
International Colloquium on Automata, Languages, and Programming, 239-250, 2012
82012
Sorting by swaps with noisy comparisons
T Gavenčiak, B Geissmann, J Lengler
Algorithmica 81 (2), 796-827, 2019
72019
Parameterized complexity of distance labeling and uniform channel assignment problems
J Fiala, T Gavenčiak, D Knop, M Koutecký, J Kratochvíl
Discrete Applied Mathematics 248, 46-55, 2018
72018
Integer programming in parameterized complexity: three miniatures
T Gavenčiak, D Knop, M Koutecký
arXiv preprint arXiv:1711.02032, 2017
72017
Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems
J Fiala, T Gavenčiak, D Knop, M Koutecký, J Kratochvíl
International Computing and Combinatorics Conference, 67-78, 2016
72016
Catching a fast robber on interval graphs
T Gavenčiak
International Conference on Theory and Applications of Models of Computation …, 2011
72011
Cops and robbers on string graphs
T Gavenčiak, P Gordinowicz, V Jelínek, P Klavík, J Kratochvíl
International Symposium on Algorithms and Computation, 355-366, 2015
42015
Hypertree-depth and minors in hypergraphs
I Adler, T Gavenčiak, T Klimošová
Theoretical Computer Science 463, 84-95, 2012
42012
Cops, a fast robber and defensive domination on interval graphs
D Dereniowski, T Gavenčiak, J Kratochvíl
Theoretical Computer Science 794, 47-58, 2019
22019
Applying convex integer programming: Sum multicoloring and bounded neighborhood diversity
T Gavenciak, D Knop, M Koutecký
arXiv preprint arXiv:1711.02032, 2017
22017
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts
T Gavenčiak, J Tětek
International Conference on Theory and Applications of Models of Computation …, 2019
12019
Structural and complexity questions of graph theory
T Gavenčiak
Univerzita Karlova, Matematicko-fyzikální fakulta, 2016
12016
Firefighting on square and hexagonal grids
T GAVENCIAK, JAN KRATOCHVÍL
arXiv preprint arXiv:1305.7076, 2013
12013
Integer programming in parameterized complexity: Five miniatures
T Gavenčiak, M Koutecký, D Knop
Discrete Optimization, 100596, 2020
2020
Analysis of greedy algorithms on graphs with bounded degrees, EuroComb’01 (Barcelona)
A Bonato, P Pawel, M Aigner, M Fromme, N Alon, FRK Chung, N Alon, ...
Graph Searching Games and Probabilistic Methods 8 (2), 1-28, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20