Herbert Fleischner

Recent Publications

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 Cite DOI
A Model for Finding Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther Raidl
Discrete Applied Mathematics, volume 228, pages 242-264, 2020.
PDF Cite DOI
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 Cite
A SAT Approach for Finding Sup-Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther Raidl
Learning and Intelligent Optimization. LION~2019, volume 11968 of LNCS, pages 325-341, 2019, Springer.
PDF Cite
A Model for Finding Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther Raidl
2018, Technical report AC-TR-18-009, Algorithms and Complexity Group, TU Wien.
PDF Cite
A SAT Approach for Finding Sup-Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther Raidl
2018, Technical report AC-TR-18-010, Algorithms and Complexity Group, TU Wien.
PDF Cite
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers
Benedikt Klocker, Herbert Fleischner, Günther Raidl
Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa and Christian Blum and Angelo Cangelosi and Vicenzo Cutello and Alessandro Di Nuovo and Mario Pavone and El-Ghazali Talbi), volume 9668 of LNCS, pages 1-16, 2016, Springer.
PDF Cite
On Edge-Colored Graphs Covered by Properly Colored Cycles
Herbert Fleischner, Stefan Szeider
Graphs and Combinatorics, volume 21, number 3, pages 301-206, 2005.
PDF Cite