No. |
Title |
Author |
Year |
1 |
Dynamic Data Structures for Parameterized String Problems |
Olkowski, Jędrzej et al. |
2023 |
2 |
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number |
Majewski, Konrad et al. |
2023 |
3 |
On Rational Recursive Sequences |
Clemente, Lorenzo et al. |
2023 |
4 |
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures |
Pilipczuk, Michał et al. |
2022 |
5 |
Compact Representation for Matrices of Bounded Twin-Width |
Pilipczuk, Michał et al. |
2022 |
6 |
Computing Treedepth in Polynomial Space and Linear FPT Time |
Nadara, Wojciech et al. |
2022 |
7 |
Isolation Schemes for Problems on Decomposable Graphs |
Nederlof, Jesper et al. |
2022 |
8 |
On the Complexity of Problems on Tree-Structured Graphs |
Bodlaender, Hans L. et al. |
2022 |
9 |
Polynomial Kernel for Immersion Hitting in Tournaments |
Bożyk, Łukasz et al. |
2022 |
10 |
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391) |
Král’, Daniel et al. |
2022 |
11 |
Twin-Width and Types |
Gajarský, Jakub et al. |
2022 |
12 |
Dynamic Data Structures for Timed Automata Acceptance |
Grez, Alejandro et al. |
2021 |
13 |
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity |
Cslovjecsek, Jana et al. |
2021 |
14 |
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes |
Chudnovsky, Maria et al. |
2020 |
15 |
On Polynomial Recursive Sequences |
Cadilhac, Michaël et al. |
2020 |
16 |
VC Density of Set Systems Definable in Tree-Like Graphs |
Paszke, Adam et al. |
2020 |