986 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Slovak Academy of SciencesSK20 papers
- Czech Technical University in PragueCZ18 papers
- University of WarsawPL16 papers
- Institute of Physics of the Slovak Academy of SciencesSK8 papers
- Comenius University BratislavaSK7 papers
- Institute of Experimental Physics of the Slovak Academy of SciencesSK6 papers
- University of BelgradeRS6 papers
- University of Pavol Jozef ŠafárikSK6 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Constantine the Philosopher University in NitraSK4 papers
- Département d'InformatiqueFR4 papers
- École Normale Supérieure - PSLFR4 papers
6 papers · 1 filter
Parameterized algorithms for block-structured integer programs with large entries
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota +2
We study two classic variants of block-structured integer programming. Two-stage stochastic programs are integer programs of the form $\{A_i \mathbf{x} + D_i \mathbf{y}_i = \mathbf…
Faster parameterized algorithms for modification problems to minor-closed classes
Laure Morelle, Ignasi Sau, Giannos Stamoulis +1
Let be a minor-closed graph class and let be an -vertex graph. We say that is a -apex of if contains a set of at most vertices such…
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk +1
In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality. In general graphs, this c…
Wavelet Trees Meet Suffix Trees
Maxim Babenko, Paweł Gawrychowski, Tomasz Kociumaka +1
We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n…
Faster deterministic Feedback Vertex Set
Tomasz Kociumaka, Marcin Pilipczuk
We present two new deterministic algorithms for the Feedback Vertex Set problem parameterized by the solution size. We begin with a simple algorithm, which runs in O*((2 + ϕ)^k) ti…
A Linear Time Algorithm for Seeds Computation
Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski +2
A seed in a word is a relaxed version of a period in which the occurrences of the repeating subword may overlap. We show a linear-time algorithm computing a linear-size representat…