Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
1
Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design
Parallel Problem Solving from Nature–PPSN XII
(C. A. Coello Coello, others, eds.), volume 7492 of
LNCS
, pages 458–467, 2012, Springer.
Christian Schauer
,
Günther Raidl
PDF
bib
When Trees Grow Low: Shrubs and Fast MSO1
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings
, volume 7464 of
Lecture Notes in Computer Science
, pages 419–430, 2012, Springer.
Robert Ganian
,
Petr Hlinený
,
Jaroslav Nesetril
,
Jan Obdrzálek
,
Patrice Ossona De Mendez
,
Reshma Ramadurai
bib
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
Network Optimization: 5th International Conference, INOC 2011
(J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of
LNCS
, pages 124–138, June 2011, Springer.
Markus Leitner
,
Mario Ruthmair
,
Günther Raidl
PDF
bib
Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem
Proceedings of the VII ALIO/EURO – Workshop on Applied Combinatorial Optimization
, pages 250–253, May 2011.
Markus Leitner
,
Mario Ruthmair
,
Günther Raidl
PDF
bib
A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application
Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS)
(M. Ganzha, others, eds.), pages 239–246, 2011, IEEE Digital Library.
Andreas M. Chwatal
,
Corina Thöni
,
Karin Oberlechner
,
Günther Raidl
PDF
bib
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV)
(O. Günlük, G.J. Woeginger, eds.), volume 6655 of
LNCS
, pages 376–388, 2011, Springer, Heidelberg.
Mario Ruthmair
,
Günther Raidl
PDF
bib
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory
(Alexis Quesada-Arencibia, others, eds.), pages 247–249, 2011.
Martin Berlakovich
,
Mario Ruthmair
,
Günther Raidl
PDF
bib
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings
, pages 333–343, 2011.
Pranabendu Misra
,
Venkatesh Raman
,
M. S. Ramanujan
,
Saket Saurabh
bib
A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables
Proceedings of the 9th Metaheuristics International Conference
(Luca Di~Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 349–358, 2011.
Michael Pimmer
,
Günther Raidl
PDF
bib
Adjacency-Preserving Spatial Treemaps
Algorithms and Data Structures (WADS'11)
(Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of
LNCS
, pages 159–170, 2011, Springer Berlin Heidelberg.
Kevin Buchin
,
David Eppstein
,
Maarten Löffler
,
Martin Nöllenburg
,
Rodrigo I. Silveira
PDF
bib
DOI
«
»
bib
×