Benedikt Klocker

According to our database, Benedikt Klocker authored at least 6 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

A model for finding transition-minors.

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

Discret. Appl. Math., 2020

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

2019

A SAT Approach for Finding Sup-Transition-Minors.

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

Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2017

Finding Smooth Graphs with Small Independence Numbers.

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

Proceedings of the Machine Learning, Optimization, and Big Data, 2017

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

Proceedings of the Computer Aided Systems Theory - EUROCAST 2017, 2017

2016

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

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

Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016