Generalizations of Classic Combinatorial Optimization Problems on Graphs and Matroidal Structures: Algorithms and Complexity (bibtex)

by Stefan Lendl

Reference:

Stefan Lendl, Generalizations of Classic Combinatorial Optimization Problems on Graphs and Matroidal Structures: Algorithms and Complexity, PhD thesis, TU Graz, (2019).

Bibtex Entry:

@PhdThesis{LendlThesis,
  author = {Stefan Lendl},
  school = {TU Graz},
  title  = {Generalizations of {C}lassic {C}ombinatorial {O}ptimization {P}roblems on {G}raphs and {M}atroidal {S}tructures: {A}lgorithms and {C}omplexity},
  url    = {https://diglib.tugraz.at/download.php?id=5f9018db992a7&location=aleph},
  year   = {2019},
  groups = {PhdThesis, Project07 (Klinz), Student},
}