Benedikt Klocker

Recent Publications

Combinatorial Optimization Approaches for Graph Construction Problems
Benedikt Klocker
April 2020, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by Günther~R.~Raidl
PDF bib
A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three
Benedikt Klocker, Herbert Fleischner, Günther Raidl
Applied Mathematics and Computation, volume 380, number 125233, 2020.
PDF bib DOI
A Model for Finding Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther Raidl
Discrete Applied Mathematics, volume 228, pages 242-264, 2020.
PDF bib DOI
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
Benedikt Klocker
April 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
PDF bib
A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three
Benedikt Klocker, Herbert Fleischner, Günther Raidl
2019, Technical report AC-TR-19-007, Algorithms and Complexity Group, TU Wien.
PDF bib