1

Automata approach to graphs of bounded rank-width
Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan, pages 4–15, 2008, College Publications.
bib
Backdoor Trees
AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13-17, 2008, pages 363-368, 2008, AAAI Press.
PDF bib
Boundary Labeling with Octilinear Leaders
Algorithm Theory (SWAT'08) (Joachim Gudmundsson, ed.), volume 5124 of LNCS, pages 234–245, 2008, Springer Berlin Heidelberg.
bib DOI
Combining Forces to Reconstruct Strip Shredded Text Documents
Hybrid Metaheuristics 2008 (M. J. Blesa, others, eds.), volume 5296 of LNCS, pages 175–189, 2008, Springer.
PDF bib
Consistent Digital Rays
Computational Geometry (SoCG'08), pages 355–364, 2008, ACM.
PDF bib DOI
Cover Contact Graphs
Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 171–182, 2008, Springer Berlin Heidelberg.
bib DOI
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008 (Jano van Hemert, Carlos Cotta, eds.), volume 4972 of LNCS, pages 36–47, 2008, Springer.
Note: best paper award winner
PDF bib
Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees
BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations (J. Küng, K. Schneider, R. Wagner, eds.), volume 26 of Schriftenreihe Informatik, pages 115–124, 2008, Trauner Verlag.
PDF bib
Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms
GECCO ‘08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (Maarten Keijzer, others, eds.), pages 323–330, 2008, ACM.
PDF bib
Heuristic Cut Separation in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 261–264, 2008, IEEE Computer Society.
PDF bib