People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
1
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
Vaidyanathan Peruvemba Ramaswamy
,
Stefan Szeider
PDF
Cite
Project
Project
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Bhore, Sujoy
,
Löffler, Maarten
,
Nickel, Soeren
,
Martin Nöllenburg
PDF
Cite
DOI
Casual Employee Scheduling with Constraint Programming and Metaheuristics
Nikolaus Frohner
,
Stephan Teuschl
,
Günther Raidl
PDF
Cite
A Beam Search Approach to the Traveling Tournament Problem
Nikolaus Frohner
,
Bernhard Neumann
,
Günther Raidl
PDF
Cite
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation
Djukanovic, Marko
,
Günther Raidl
,
Blum, Christian
PDF
Cite
DOI
A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility
Nikolaus Frohner
,
Günther Raidl
PDF
Cite
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Friedrich Slivovsky
,
Stefan Szeider
PDF
Cite
Project
Project
Project
A Time Leap Challenge for SAT-Solving
Johannes K. Fichte
,
Markus Hecher
,
Stefan Szeider
Cite
Project
Project
Breaking Symmetries with RootClique and LexTopsort
Johannes K. Fichte
,
Markus Hecher
,
Stefan Szeider
PDF
Cite
Project
Project
Building Large k-Cores from Sparse Graphs
Fedor v. Fomin
,
Danil Sagunov
,
Kirill Simonov
PDF
Cite
DOI
«
»
Cite
×