People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
1
A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size
Frederico Dusberger
,
Günther Raidl
PDF
Cite
A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size
Frederico Dusberger
,
Günther Raidl
PDF
Cite
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
Benjamin Biesinger
,
Bin Hu
,
Günther Raidl
PDF
Cite
Project
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
Klawitter, Jonathan
,
Martin Nöllenburg
,
Ueckerdt, Torsten
PDF
Cite
DOI
Community Structure Inspired Algorithms for SAT and #SAT
Robert Ganian
,
Stefan Szeider
PDF
Cite
DOI
Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young
Ulle Endriss
,
Ronald De Haan
PDF
Cite
CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem
David Markvica, Christian Schauer
,
Günther Raidl
Cite
First-Order Queries on Finite Abelian Groups
Simone Bova and Barnaby Martin
PDF
Cite
Fixed-parameter Tractable Reductions to SAT for Planning
Ronald De Haan
,
Martin Kronegger
,
Andreas Pfandler
PDF
Cite
FO Model Checking on Posets of Bounded Width
Jakub Gajarský and Petr Hlinený and Daniel Lokshtanov and Jan Obdrzálek and Sebastian Ordyniak and M. S. Ramanujan and Saket Saurabh
PDF
Cite
DOI
«
»
Cite
×