No. Title Author Year
1 A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth Mannens, Isja et al. 2023
2 Polynomial-Time Approximation of Independent Set Parameterized by Treewidth Chalermsook, Parinya et al. 2023
3 Tight Lower Bounds for Problems Parameterized by Rank-Width Bergougnoux, Benjamin et al. 2023
4 Front Matter, Table of Contents, Preface, Conference Organization Dell, Holger et al. 2022
5 Isolation Schemes for Problems on Decomposable Graphs Nederlof, Jesper et al. 2022
6 LIPIcs, Volume 249, IPEC 2022, Complete Volume Dell, Holger et al. 2022
7 Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth Groenland, Carla et al. 2022
8 On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan Nederlof, Jesper et al. 2020
9 Equal-Subset-Sum Faster Than the Meet-in-the-Middle Mucha, Marcin et al. 2019
10 Computing the Chromatic Number Using Graph Decompositions via Matrix Rank Jansen, Bart M. P. et al. 2018
11 Dense Subset Sum May Be the Hardest Austrin, Per et al. 2016
12 Exponential Time Paradigms Through the Polynomial Time Lens Drucker, Andrew et al. 2016
13 Finding Large Set Covers Faster via the Representation Method Nederlof, Jesper 2016
14 Subexponential Time Algorithms for Embedding H-Minor Free Graphs Bodlaender, Hans L. et al. 2016
15 Subset Sum in the Absence of Concentration Austrin, Per et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 15

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