Benedikt Klocker

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2016, HM.

A model for finding transition-minors

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2020, Discret. Appl. Math..

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2020, Appl. Math. Comput..

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Günther R. Raidl, Benedikt Klocker, 2017, EUROCAST.

Finding Smooth Graphs with Small Independence Numbers

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2017, MOD.

A SAT Approach for Finding Sup-Transition-Minors

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2019, LION.