| No. |
Title |
Author |
Year |
| 1 |
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths |
Curticapean, Radu et al. |
2021 |
| 2 |
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk) |
Husfeldt, Thore |
2020 |
| 3 |
Multivariate Analysis of Orthogonal Range Searching and Graph Distances |
Bringmann, Karl et al. |
2019 |
| 4 |
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving |
Björklund, Andreas et al. |
2018 |
| 5 |
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm |
Björklund, Andreas et al. |
2018 |
| 6 |
Computing Graph Distances Parameterized by Treewidth and Diameter |
Husfeldt, Thore |
2017 |
| 7 |
The First Parameterized Algorithms and Computational Experiments Challenge |
Dell, Holger et al. |
2017 |
| 8 |
Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors |
Husfeldt, Thore et al. |
2015 |
| 9 |
LIPIcs, Volume 43, IPEC'15, Complete Volume |
Husfeldt, Thore et al. |
2015 |
| 10 |
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331) |
Husfeldt, Thore et al. |
2013 |
| 11 |
10441 Abstracts Collection -- Exact Complexity of NP-hard Problems |
Husfeldt, Thore et al. |
2011 |
| 12 |
Trimmed Moebius Inversion and Graphs of Bounded Degree |
Björklund, Andreas et al. |
2008 |
