BibTeX records: Anna Schulze

download as .bib file

@inproceedings{DBLP:conf/dagstuhl/DellingHKS10,
  author    = {Daniel Delling and
               Roberto Hoffmann and
               Maria Kandyba and
               Anna Schulze},
  editor    = {Matthias M{\"{u}}ller{-}Hannemann and
               Stefan Schirra},
  title     = {Case Studies},
  booktitle = {Algorithm Engineering: Bridging the Gap between Algorithm Theory and
               Practice [outcome of a Dagstuhl Seminar]},
  series    = {Lecture Notes in Computer Science},
  volume    = {5971},
  pages     = {389--445},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14866-8\_9},
  doi       = {10.1007/978-3-642-14866-8\_9},
  timestamp = {Tue, 14 May 2019 10:00:51 +0200},
  biburl    = {https://dblp.org/rec/conf/dagstuhl/DellingHKS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/FuchsS08,
  author    = {Bernhard Fuchs and
               Anna Schulze},
  title     = {A Simple 3-Approximation of Minimum Manhattan Networks},
  booktitle = {Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization,
               gargano, Italy, 13-15 May, 2008},
  pages     = {26--29},
  publisher = {University of Milan},
  year      = {2008},
  timestamp = {Fri, 28 Nov 2008 12:43:29 +0100},
  biburl    = {https://dblp.org/rec/conf/colognetwente/FuchsS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/Muller-HannemannS07,
  author    = {Matthias M{\"{u}}ller{-}Hannemann and
               Anna Schulze},
  title     = {Hardness and Approximation of Octilinear Steiner Trees},
  journal   = {Int. J. Comput. Geom. Appl.},
  volume    = {17},
  number    = {3},
  pages     = {231--260},
  year      = {2007},
  url       = {https://doi.org/10.1142/S021819590700232X},
  doi       = {10.1142/S021819590700232X},
  timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ijcga/Muller-HannemannS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Muller-HannemannS06,
  author    = {Matthias M{\"{u}}ller{-}Hannemann and
               Anna Schulze},
  editor    = {Lars Arge and
               Rusins Freivalds},
  title     = {Approximation of Octilinear Steiner Trees Constrained by Hard and
               Soft Obstacles},
  booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
               Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4059},
  pages     = {242--254},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11785293\_24},
  doi       = {10.1007/11785293\_24},
  timestamp = {Tue, 14 May 2019 10:00:39 +0200},
  biburl    = {https://dblp.org/rec/conf/swat/Muller-HannemannS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Muller-HannemannS05,
  author    = {Matthias M{\"{u}}ller{-}Hannemann and
               Anna Schulze},
  editor    = {Xiaotie Deng and
               Ding{-}Zhu Du},
  title     = {Hardness and Approximation of Octilinear Steiner Trees},
  booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
               2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3827},
  pages     = {256--265},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11602613\_27},
  doi       = {10.1007/11602613\_27},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/Muller-HannemannS05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics