A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. - Frederico Dusberger; Günther R. Raidl (Hybrid Metaheuristics, 2014)

The D-FLAT System for Dynamic Programming on Tree Decompositions. - Michael Abseher; Bernhard Bliem; Günther Charwat; Frederico Dusberger; Markus Hecher; Stefan Woltran (JELIA, 2014)

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size. - Frederico Dusberger; Günther R. Raidl (EUROCAST, 2015)

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. - Michael Abseher; Frederico Dusberger; Nysret Musliu; Stefan Woltran (IJCAI, 2015)

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem. - Frederico Dusberger; Günther R. Raidl (OR, 2015)

Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. - Frederico Dusberger; Günther R. Raidl (Electron. Notes Discret. Math., 2015)

Computing secure sets in graphs using answer set programming. - Michael Abseher; Bernhard Bliem; Günther Charwat; Frederico Dusberger; Stefan Woltran (J. Log. Comput., 2020)