| No. |
Title |
Author |
Year |
| 1 |
Arc-Flags Meet Trip-Based Public Transit Routing |
Großmann, Ernestine et al. |
2023 |
| 2 |
Faster Local Motif Clustering via Maximum Flows |
Chhabra, Adil et al. |
2023 |
| 3 |
FREIGHT: Fast Streaming Hypergraph Partitioning |
Eyubov, Kamal et al. |
2023 |
| 4 |
Decidability for Sturmian Words |
Hieronymi, Philipp et al. |
2022 |
| 5 |
Front Matter, Table of Contents, Preface, Conference Organization |
Schulz, Christian et al. |
2022 |
| 6 |
LIPIcs, Volume 233, SEA 2022, Complete Volume |
Schulz, Christian et al. |
2022 |
| 7 |
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk) |
Hanauer, Kathrin et al. |
2022 |
| 8 |
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set |
Großmann, Ernestine et al. |
2022 |
| 9 |
Deep Multilevel Graph Partitioning |
Gottesbüren, Lars et al. |
2021 |
| 10 |
O'Reach: Even Faster Reachability in Large Graphs |
Hanauer, Kathrin et al. |
2021 |
| 11 |
Dynamic Matching Algorithms in Practice |
Henzinger, Monika et al. |
2020 |
| 12 |
Faster Fully Dynamic Transitive Closure in Practice |
Hanauer, Kathrin et al. |
2020 |
| 13 |
Finding All Global Minimum Cuts in Practice |
Henzinger, Monika et al. |
2020 |
| 14 |
High-Quality Hierarchical Process Mapping |
Faraj, Marcelo Fonseca et al. |
2020 |
| 15 |
ILP-based Local Search for Graph Partitioning |
Henzinger, Alexandra et al. |
2018 |
| 16 |
Memetic Graph Clustering |
Biedermann, Sonja et al. |
2018 |
| 17 |
Better Process Mapping and Sparse Quadratic Assignment |
Schulz, Christian et al. |
2017 |
| 18 |
Graph Partitioning with Acyclicity Constraints |
Moreira, Orlando et al. |
2017 |
