People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
1
The Parameterized Complexity of Local Consistency
Serge Gaspers
,
Stefan Szeider
PDF
Cite
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Robert Ganian
Cite
Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Mario Ruthmair
,
Andreas Hubmer
,
Günther Raidl
PDF
Cite
Variable Neighborhood Search for Capacitated Connected Facility Location
Markus Leitner
,
Günther Raidl
PDF
Cite
A Brief Survey on Hybrid Metaheuristics
Christian Blum
,
Jakob Puchinger
,
Günther Raidl
PDF
Cite
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents
Christian Schauer
,
Matthias Prandtstetter
,
Günther Raidl
PDF
Cite
A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem
Anna Pagacz
,
Bin Hu
,
Günther Raidl
PDF
Cite
Algorithms and Complexity Results for Exact Bayesian Structure Learning
Sebastian Ordyniak
,
Stefan Szeider
Cite
An Improved Algorithm for the Metro-Line Crossing Minimization Problem
Martin Nöllenburg
Cite
DOI
Are There Any Good Digraph Width Measures?
Robert Ganian
Cite
«
»
Cite
×