Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Benedikt Klocker

» Project Assistant (FWF), Dipl.-Ing.

Address:
Benedikt Klocker
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Email: klocker@ac.tuwien.ac.at
Web: http://www.ac.tuwien.ac.at/people/klocker/

Publications

10 results
2020
[10]A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Applied Mathematics and Computation, volume 380, number 125233, 2020.
[bibtex] [pdf] [doi]
[9]A Model for Finding Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Discrete Applied Mathematics, volume 228, pages 242–264, 2020.
[bibtex] [pdf] [doi]
[8]Combinatorial Optimization Approaches for Graph Construction Problems
Benedikt Klocker
apr 2020, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by Günther R. Raidl
[bibtex] [pdf]
2019
[7]A SAT Approach for Finding Sup-Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Learning and Intelligent Optimization. LION 2019, volume 11968 of LNCS, pages 325–341, 2019, Springer.
[bibtex] [pdf]
[6]Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
Benedikt Klocker
apr 2019, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
2018
[5]Finding Smooth Graphs with Small Independence Numbers
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
MOD 2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 527-539, 2018, Springer.
[bibtex] [pdf]
[4]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
Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 355-363, 2018, Springer.
[bibtex] [pdf]
2017
[3]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
Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 104–105, 2017.
[bibtex] [pdf]
2016
[2]Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 1–16, 2016, Springer.
[bibtex] [pdf]
2015
[1]Optimization Approaches for Recreational Bicycle Tour Planning
Benedikt Klocker
Apr 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by M. Prandtstetter and G. Raidl
[bibtex] [pdf]

Technical Reports

3 results
2019
[3]A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
2019, Technical report AC-TR-19-007, Algorithms and Complexity Group, TU Wien.
[bibtex] [pdf]
2018
[2]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.
[bibtex] [pdf]
[1]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.
[bibtex] [pdf]
  • Cornelius Brand
  • Doris Brazda
  • Maria Bresich
  • Jiehua Chen
  • Alexis de Colnet
  • Alexander Dobler
  • Jan Dreier
  • Herbert Fleischner
  • Nikolaus Frohner
  • Robert Ganian
  • Christian Hatschka
  • Marc Huber
  • Enrico Iurlano
  • Liana Khazaliya
  • Markus Kirchweger
  • Viktoria Korchemna
  • Martin Kronegger
  • Andreas Müller
  • Martin Nöllenburg
  • Daniel Obszelka
  • Tomáš Peitl
  • Vaidyanathan P. R.
  • Günther Raidl
  • Franz Xaver Reichl
  • Mathis Rocton
  • Andre Schidler
  • Sofia Simola
  • Friedrich Slivovsky
  • Manuel Sorge
  • Stefan Szeider
  • Soeren Terziadis
  • Johannes Varga
  • Anaïs Villedieu
  • Markus Wallinger
  • Jules Wulms
  • Hai Xia
  • Tianwei Zhang
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.