default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomas Gavenciak
Person information
- unicode name: Tomáš Gavenčiak
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Raymond Douglas, Andis Draguns, Tomas Gavenciak:
Mitigating the Problem of Strong Priors in LMs with Context Extrapolation. CoRR abs/2401.17692 (2024)- [i10]Walter Laurito, Benjamin Davis, Peli Grietzer, Tomas Gavenciak, Ada Böhm, Jan Kulveit:
AI AI Bias: Large Language Models Favor Their Own Generated Content. CoRR abs/2407.12856 (2024) - 2022
- [j9]Tomas Gavenciak
, Martin Koutecký, Dusan Knop:
Integer programming in parameterized complexity: Five miniatures. Discret. Optim. 44(Part): 100596 (2022) - [j8]Tomas Gavenciak, Joshua Teperowski Monrad, Gavin Leech, Mrinank Sharma, Sören Mindermann, Samir Bhatt, Jan Markus Brauner, Jan Kulveit:
Seasonal variation in SARS-CoV-2 transmission in temperate climates: A Bayesian modelling study in 143 European regions. PLoS Comput. Biol. 18(8) (2022) - 2021
- [c12]Jakub Tetek, Marek Sklenka, Tomas Gavenciak:
Performance of Bounded-Rational Agents With the Ability to Self-Modify. SafeAI@AAAI 2021 - 2020
- [c11]Mrinank Sharma, Sören Mindermann, Jan Markus Brauner, Gavin Leech, Anna B. Stephenson, Tomas Gavenciak, Jan Kulveit, Yee Whye Teh, Leonid Chindelevitch, Yarin Gal:
How Robust are the Estimated Effects of Nonpharmaceutical Interventions against COVID-19? NeurIPS 2020 - [i9]Mrinank Sharma, Sören Mindermann, Jan Markus Brauner, Gavin Leech, Anna B. Stephenson, Tomas Gavenciak, Jan Kulveit, Yee Whye Teh, Leonid Chindelevitch, Yarin Gal:
On the robustness of effectiveness estimation of nonpharmaceutical interventions against COVID-19 transmission. CoRR abs/2007.13454 (2020) - [i8]Jakub Tetek, Marek Sklenka, Tomas Gavenciak:
Performance of Bounded-Rational Agents With the Ability to Self-Modify. CoRR abs/2011.06275 (2020)
2010 – 2019
- 2019
- [j7]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by Swaps with Noisy Comparisons. Algorithmica 81(2): 796-827 (2019) - [j6]Dariusz Dereniowski, Tomas Gavenciak, Jan Kratochvíl:
Cops, a fast robber and defensive domination on interval graphs. Theor. Comput. Sci. 794: 47-58 (2019) - [c10]Tomas Gavenciak, Jakub Tetek:
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. TAMC 2019: 222-241 - 2018
- [j5]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. 248: 46-55 (2018) - [j4]Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on intersection graphs. Eur. J. Comb. 72: 45-69 (2018) - [c9]Daniel Kondratyuk, Tomas Gavenciak, Milan Straka, Jan Hajic:
LemmaTag: Jointly Tagging and Lemmatizing for Morphologically Rich Languages with BRNNs. EMNLP 2018: 4921-4928 - [c8]Tomas Gavenciak, Dusan Knop, Martin Koutecký:
Integer Programming in Parameterized Complexity: Three Miniatures. IPEC 2018: 21:1-21:16 - [i7]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by Swaps with Noisy Comparisons. CoRR abs/1803.04509 (2018) - [i6]Daniel Kondratyuk, Tomas Gavenciak, Milan Straka, Jan Hajic:
LemmaTag: Jointly Tagging and Lemmatizing for Morphologically-Rich Languages with BRNNs. CoRR abs/1808.03703 (2018) - [i5]Tomas Gavenciak, Jakub Tetek:
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. CoRR abs/1811.06749 (2018) - 2017
- [c7]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by swaps with noisy comparisons. GECCO 2017: 1375-1382 - [i4]Tomas Gavenciak, Dusan Knop, Martin Koutecký:
Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. CoRR abs/1711.02032 (2017) - 2016
- [c6]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON 2016: 67-78 - [i3]Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on Intersection Graphs. CoRR abs/1607.08058 (2016) - 2015
- [c5]Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on String Graphs. ISAAC 2015: 355-366 - [i2]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR abs/1507.00640 (2015) - 2014
- [j3]Tomas Gavenciak, Jan Kratochvíl, Pawel Pralat:
Firefighting on square, hexagonal, and triangular grids. Discret. Math. 337: 142-155 (2014) - 2013
- [c4]Tomas Gavenciak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on Intersection Graphs. ISAAC 2013: 174-184 - 2012
- [j2]Isolde Adler, Tomas Gavenciak, Tereza Klimosová:
Hypertree-depth and minors in hypergraphs. Theor. Comput. Sci. 463: 84-95 (2012) - [c3]Tomas Gavenciak, Daniel Král, Sang-il Oum:
Deciding First Order Properties of Matroids. ICALP (2) 2012: 239-250 - 2011
- [c2]Tomas Gavenciak:
Catching a Fast Robber on Interval Graphs. TAMC 2011: 353-364 - [i1]Tomas Gavenciak, Daniel Král, Sang-il Oum:
Deciding first order logic properties of matroids. CoRR abs/1108.5457 (2011) - 2010
- [j1]Tomas Gavenciak:
Cop-win graphs with maximum capture-time. Discret. Math. 310(10-11): 1557-1563 (2010)
2000 – 2009
- 2008
- [c1]Tomas Gavenciak:
Cop-Win Graphs with Maximal Capture-Time. IWOCA 2008: 115-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
