Research:
Profiles: DBLP ↗, Google Scholar ↗, and ORCID ↗
-
On Controlling Knockout Tournaments Without Perfect Information
with
Sushmita Gupta, M.S. Ramanujan, and Peter Strulo
arXiv IPEC 2024 | tags:[ graph theory ]
-
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
with
Satyabrata Jana, M.S. Ramanujan, and Peter Strulo
arXiv IPEC 2024 Algorithmica 📺 IPEC 2024 | tags:[ parameterized complexity graph theory ]
-
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
with
Dušan Knop, Jan Pokorný, and Šimon Schierreich
arXiv MFCS 2024 | tags:[ graph theory ]
-
Constrained and Ordered Level Planarity Parameterized by the Number of Levels
with
Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, and Johannes Zink
arXiv wrap SoCG 2024 JoCG | tags:[ parameterized complexity graph drawing ]
-
On the smallest synchronizing terms of finite tree automata
with
Jan Janoušek and Štěpán Plachý
wrap CIAA 2023 | tags:[ stringology ]
-
Online Ramsey numbers: Long versus short cycles
with
Grzegorz Adamski and Małgorzata Bednarska-Bzdęga
arXiv SIDMA | tags:[ combinatorial games ]
-
Computing m-Eternal Domination Number of Cactus Graphs in Linear Time
with
Jan Matyáš Křišťan and Tomáš Valla
arXiv | tags:[ combinatorial games cactus graphs ]
-
The Parameterized Complexity of Network Microaggregation
with
Robert Ganian, Dušan Knop, Jan Pokorný, Šimon Schierreich, and Kirill Simonov
AAAI 2023 📺 G2OAT | tags:[ parameterized complexity graph theory ]
-
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
with
Pratibha Choudhary, Dušan Knop, Šimon Schierreich, Ondřej Suchý, and Tomáš Valla
arXiv ESA 2022 📺 G2OAT | tags:[ kernelization graph theory ]
-
Polynomial Kernels for Tracking Shortest Paths
with
Pratibha Choudhary, Dušan Knop, Jan Matyáš Křišťan, Ondřej Suchý, and Tomáš Valla
arXiv IPL | tags:[ kernelization graph theory ]
-
Efficient attack sequences in m-eternal domination
with
Jan Matyáš Křišťan and Tomáš Valla
arXiv | tags:[ combinatorial games ]
-
Controlling the Spread of Two Secrets in Diverse Social Networks
with
Dušan Knop and Šimon Schierreich
AAAI (ex.abs.) 2022 | tags:[ graph theory ]
-
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set
with
Pratibha Choudhary, Dušan Knop, Jan Matyáš Křišťan, Ondřej Suchý, and Tomáš Valla
arXiv WAOA 2021 DO 📺 WAOA 2021 | tags:[ approximation graph theory ]
-
Non-homotopic Loops with a Bounded Number of Pairwise Intersections
with
Michal Opler, Matas Šileikis, and Pavel Valtr
arXiv GD 2021 | tags:[ counting problems non-homotopic loops ]
-
Bears with Hats and Independence Polynomials
with
Pavel Dvořák and Michal Opler
arXiv WG 2021 DMTCS 📺 G2OAT | tags:[ combinatorial games ]
-
On the Intersections of Non-homotopic Loops
with
Michal Opler, Matas Šileikis, and Pavel Valtr
CALDAM 2021 📺 CALDAM 2021 📺 G2OAT | tags:[ counting problems non-homotopic loops ]
-
On the Edge-Length Ratio of 2-Trees
with
Jiří Fiala and Giuseppe Liotta
arXiv GD 2020 IJCGA 📺 GD 2020 📺 G2OAT | tags:[ edge-length ratio 2-tree graphs ]
-
On the m-eternal Domination Number of Cactus Graphs
with
Jan Matyáš Křišťan and Tomáš Valla
arXiv RP 2019 | tags:[ combinatorial games cactus graphs ]
-
On Induced Online Ramsey Number of Paths, Cycles, and Trees
with
Pavel Dvořák and Tomáš Valla
arXiv CSR 2019 | tags:[ induced subgraphs combinatorial games ]
-
A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching
with
Ondřej Suchý and Tomáš Valla
arXiv MACIS 2017 | tags:[ stringology experiments ]