Tomas Gavenciak

Orcid: 0000-0003-1119-2426

Affiliations:
  • Charles University, Prague, Czech Republic


According to our database1, Tomas Gavenciak authored at least 25 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mitigating the Problem of Strong Priors in LMs with Context Extrapolation.
CoRR, 2024

2022
Seasonal variation in SARS-CoV-2 transmission in temperate climates: A Bayesian modelling study in 143 European regions.
PLoS Comput. Biol., 2022

Integer programming in parameterized complexity: Five miniatures.
Discret. Optim., 2022

2021
Performance of Bounded-Rational Agents With the Ability to Self-Modify.
Proceedings of the Workshop on Artificial Intelligence Safety 2021 (SafeAI 2021) co-located with the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021), 2021

2020
On the robustness of effectiveness estimation of nonpharmaceutical interventions against COVID-19 transmission.
CoRR, 2020

How Robust are the Estimated Effects of Nonpharmaceutical Interventions against COVID-19?
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Cops, a fast robber and defensive domination on interval graphs.
Theor. Comput. Sci., 2019

Sorting by Swaps with Noisy Comparisons.
Algorithmica, 2019

Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
Cops and Robbers on intersection graphs.
Eur. J. Comb., 2018

Parameterized complexity of distance labeling and uniform channel assignment problems.
Discret. Appl. Math., 2018

Integer Programming in Parameterized Complexity: Three Miniatures.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

LemmaTag: Jointly Tagging and Lemmatizing for Morphologically Rich Languages with BRNNs.
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, October 31, 2018

2017
Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity.
CoRR, 2017

2016
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract).
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Distance constrained labeling on graphs with bounded neighborhood diversity.
CoRR, 2015

Cops and Robbers on String Graphs.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
Firefighting on square, hexagonal, and triangular grids.
Discret. Math., 2014

2013
Cops and Robbers on Intersection Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Hypertree-depth and minors in hypergraphs.
Theor. Comput. Sci., 2012

Deciding First Order Properties of Matroids.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Deciding first order logic properties of matroids
CoRR, 2011

Catching a Fast Robber on Interval Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2011

2010
Cop-win graphs with maximum capture-time.
Discret. Math., 2010

2008
Cop-Win Graphs with Maximal Capture-Time.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008


  Loading...