Combinatorial Algorithms

- Invited Talks
- Branching Systems
- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
- Succinct Representations of Trees
- Kt Minors in Large t-Connected Graphs
- Intractability in Graph Drawing and Geometry: FPT Approaches
- Contributed Talks
- Evaluation of Recoverable-Robust Timetables on Tree Networks
- Weighted LCS
- Integrality Properties of Certain Special Balanceable Families
- Forbidden Subgraph Colorings and the Oriented Chromatic Number
- Polynomial Kernels for 3-Leaf Power Graph Modification Problems
- Approximating the Max Edge-Coloring Problem
- Three Complexity Results on Coloring P k -Free Graphs
- Fully Decomposable Split Graphs
- Feedback Vertex Set on Graphs of Low Cliquewidth
- Note on Decomposition of K n,n into (0,j)-prisms
- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
- LPF Computation Revisited
- Limiting Distribution for Distances in k-Trees
- Gray Code Compression
- Embedded Trees and the Support of the ISE
- Combinatorial Models for Cooperation Networks
- Polar Permutation Graphs
- A New Algorithm for Efficient Pattern Matching with Swaps
- The Height and Range of Watermelons without Wall
- Fast Convolutions and Their Applications in Approximate String Matching
- Better Polynomial Algorithms on Graphs of Bounded Rank-Width
- Minimax Trees in Linear Time with Applications
- Planar Biconnectivity Augmentation with Fixed Embedding
- Trivially-Perfect Width
- Lightweight Parameterized Suffix Array Construction
- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices
- Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees
- On the Maximal Number of Cubic Subwords in a String
- Solution of Peter Winkler's Pizza Problem
- An O(n)-Time Algorithm for the Paired-Domination Problem