People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
1
A Linear-Time Parameterized Algorithm for Node Unique Label Cover
Daniel Lokshtanov
,
M. S. Ramanujan
,
Saket Saurabh
PDF
Cite
DOI
A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem
Johannes Maschler
,
Günther Raidl
PDF
Cite
A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem
Frederico Dusberger
,
Günther Raidl
PDF
Cite
Backdoor Trees for Answer Set Programming
Stefan Szeider
PDF
Cite
Backdoor Treewidth for SAT
Robert Ganian
,
M. S. Ramanujan
,
Stefan Szeider
PDF
Cite
DOI
Circuit Treewidth, Sentential Decision, and Query Compilation
Simone Bova
,
Stefan Szeider
PDF
Cite
DOI
Combining Treewidth and Backdoors for CSP
Robert Ganian
,
M. S. Ramanujan
,
Stefan Szeider
PDF
Cite
DOI
Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures
Ronald De Haan
,
Marija Slavkovik
PDF
Cite
Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure
Ronald De Haan
PDF
Cite
Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control
Kim, Bong-Min
,
Kloimüllner, Christian
,
Günther Raidl
PDF
Cite
«
»
Cite
×