Combinatorial Algorithms
Leena Salmela, Simon J. Puglisi, Veli Mäkinen · Lecture notes in computer science · 2016
Cited by 917 works. doi:10.1007/978-3-319-44543-4
Authors
References
- Partial Covering Arrays: Algorithms and Asymptotics
- Distance Queries in Large-Scale Fully Dynamic Complex Networks
- Plane Bichromatic Trees of Low Degree
- Crushing Disks Efficiently
- Advice Complexity of the Online Search Problem
- Upper Domination: Complexity and Approximation
- On the Complexity of Computing Treebreadth
- A Boundary Property for Upper Domination
- Reconfiguration of Steiner Trees in an Unweighted Graph
- Finding Gapped Palindromes Online