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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI