People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
1
Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion
Maria Bresich
,
Günther Raidl
,
Limmer, Steffen
PDF
Cite
DOI
Minimizing Corners in Colored Rectilinear Grids
Thomas Depian
,
Alexander Dobler
,
Christoph Kern
,
Jules Wulms
Cite
Project
DOI
Minimizing Switches in Cased Graph Drawings
Robert Ganian
,
Martin Nöllenburg
,
Röder, Sebastian
Cite
Project
DOI
Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem
Maria Bresich
,
Johannes Varga
,
Günther Raidl
,
Limmer, Steffen
PDF
Cite
DOI
Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
Simon Wietheger
PDF
Cite
Project
DOI
Non-Clashing Teaching Maps for Balls in Graphs
Jérémie Chalopin and Victor Chepoi and Fionn Mc Inerney and Sébastien Ratel
PDF
Cite
Project
On the Complexity of Community-aware Network~Sparsification
Emanuel Herrendorf
,
Christian Komusiewicz
,
Nils Morawietz
,
Frank Sommer
Cite
PACE Solver Description: CRGone
Alexander Dobler
Cite
Project
DOI
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
Robert Ganian
PDF
Cite
Project
Project
DOI
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
Liana Khazaliya
PDF
Cite
Project
Project
DOI
«
»
Cite
×