Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (HM, 2016)

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. - Benedikt Klocker; Günther R. Raidl (EUROCAST (1), 2017)

Finding Smooth Graphs with Small Independence Numbers. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (MOD, 2017)

A SAT Approach for Finding Sup-Transition-Minors. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (LION, 2019)

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (Appl. Math. Comput., 2020)

A model for finding transition-minors. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (Discret. Appl. Math., 2020)

Perfect Pseudo-Matchings in Cubic Graphs. - Herbert Fleischner; Behrooz Bagheri Gh.; Benedikt Klocker (Graphs Comb., 2024)