Combinatorial Algorithms

Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings (Lecture Notes in Computer Science)

This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016.
The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.

Table of Contents

Chapter 1. On the Complexity of Computing Treebreadth
Chapter 2. Online Chromatic Number is PSPACE-Complete
Chapter 3. Bounded Embeddings of Graphs in the Plane
Chapter 4. Crushing Disks Efficiently
Chapter 5. Essential Constraints of Edge-Constrained Proximity Graphs
Chapter 6. Plane Bichromatic Trees of Low Degree
Chapter 7. Directing Road Networks by Listing Strong Orientations
Chapter 8. Evangelism in Social Networks
Chapter 9. Distance Queries in Large-Scale Fully Dynamic Complex Networks
Chapter 10. Minimax Regret 1-Median Problem in Dynamic Path Networks
Chapter 11. On Maximal Chain Subgraphs and Covers of Bipartite Graphs
Chapter 12. Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations
Chapter 13. Reconfiguration of Steiner Trees in an Unweighted Graph
Chapter 14. Weighted Online Problems with Advice
Chapter 15. Finding Gapped Palindromes Online
Chapter 16. Advice Complexity of the Online Search Problem
Chapter 17. Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
Chapter 18. A Boundary Property for Upper Domination
Chapter 19. Upper Domination: Complexity and Approximation
Chapter 20. Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
Chapter 21. Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
Chapter 22. Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
Chapter 23. Speeding up Dynamic Programming in the Line-Constrained k-median
Chapter 24. SOBRA – Shielding Optimization for BRAchytherapy
Chapter 25. A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
Chapter 26. Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem
Chapter 27. Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
Chapter 28. Finding Cactus Roots in Polynomial Time
Chapter 29. Computing Giant Graph Diameters
Chapter 30. Faster Computation of Path-Width
Chapter 31. The Solution Space of Sorting with Recurring Comparison Faults
Chapter 32. Monotone Paths in Geometric Triangulations
Chapter 33. On Computing the Total Displacement Number via Weighted Motzkin Paths
Chapter 34. Partial Covering Arrays: Algorithms and Asymptotics
Chapter 35. Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently