People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
1
Breaking Symmetries in Quantified Graph Search: A Comparative Study
Markus Kirchweger
PDF
Cite
Project
Project
DOI
Bridging Language Models and Symbolic Solvers via the Model Context Protocol
Stefan Szeider
PDF
Cite
Project
Project
DOI
Crossing and Independent Families Among Polygons
Robert Ganian
PDF
Cite
Project
Project
DOI
Extracting Problem Structure with LLMs for Optimized SAT Local Search
André Schidler
,
Stefan Szeider
PDF
Cite
Project
Project
Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem
Huang, William
,
Mei, Yi
,
Günther Raidl
,
Tianwei Zhang
,
Laurenz Tomandl
,
Limmer, Steffen
,
Rodemann, Tobias
PDF
Cite
DOI
Geometry Matters in Planar Storyplans
Dobler, Alexander
,
Holzmüller, Maximilian
,
Martin Nöllenburg
Cite
Project
DOI
Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem
Maria Bresich
,
Günther Raidl
,
Limmer, Steffen
PDF
Cite
DOI
Large and Parallel Human Sorting Networks
Stefan Szeider
Cite
DOI
Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding
Huber, Marc
,
Günther Raidl
,
Blum, Christian
PDF
Cite
DOI
Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime
Maria Bresich
,
Günther Raidl
,
Limmer, Steffen
PDF
Cite
DOI
«
»
Cite
×