1

Consistent Digital Rays

Computational Geometry (SoCG'08), pages 355-364, 2008, ACM.

Chun, Jinhee, Korman, Matias, Martin Nöllenburg, Tokuyama, Takeshi

Cover Contact Graphs

Graph Drawing (GD'07) (Hong, Seok-Hee and Nishizeki, Takao), volume 4875 of LNCS, pages 171-182, 2008, Springer Berlin Heidelberg.

Atienza, Nieves, De Castro, Natalia, Cort\'{e}s, Carmen, Garrido, M. Ángeles, Grima, Clara I., Hern\'{a}ndez, Gregorio, M\'{a}rquez, Alberto, Moreno, Auxiliadora, Martin Nöllenburg, Portillo, José Ramon, Reyes, Pedro, Valenzuela, Jes\'{u}s, Villar, Maria Trinidad, Wolff, Alexander

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem

Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008 (Jano van Hemert and Carlos Cotta), volume 4972 of LNCS, pages 36-47, 2008, Springer.
Note: best paper award winner

Bin Hu, Günther Raidl

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 and K. Schneider and R. Wagner), volume 26 of Schriftenreihe Informatik, pages 115-124, 2008, Trauner Verlag.

Sandro Pirkwieser, Ruben Ruiz-Torrubiano, Günther Raidl

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 and others), pages 323-330, 2008, ACM.

Sandro Pirkwieser, Günther Raidl

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.

Martin Gruber, Günther Raidl

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

Hybrid Metaheuristics 2008 (M. J. Blesa and others), volume 5296 of LNCS, pages 158-174, 2008, Springer.

Markus Leitner, Günther Raidl

Monadic Second Order Logic on Graphs with Local Cardinality Constraints

Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, volume 5162 of Lecture Notes in Computer Science, pages 601-612, 2008, Springer Verlag.

Not So Easy Problems For Tree Decomposable Graphs (invited talk)

ICDM 2008, International Conference on Discrete Mathematics, June 6-10, 2008, Mysore, India, Proceedings, pages 161-171, 2008.

Optimizing Active Ranges for Consistent Dynamic Map Labeling

Computational Geometry (SoCG'08), pages 10-19, 2008, ACM.

Been, Ken, Martin Nöllenburg, Poon, Sheung-Hung, Wolff, Alexander