On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems (bibtex)
by Christian Knauer, Hans Raj Tiwary, Daniel Werner
Reference:
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems (Christian Knauer, Hans Raj Tiwary, Daniel Werner), In STACS (Thomas Schwentick, Christoph Dürr, eds.), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 9, 2011.
Bibtex Entry:
@proceedings{conf/stacs/2011,
  editor    = {Thomas Schwentick and
               Christoph D{\"u}rr},
  title     = {28th International Symposium on Theoretical Aspects of Computer
               Science, STACS 2011, March 10-12, 2011, Dortmund, Germany},
  booktitle = {STACS},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  series    = {LIPIcs},
  volume    = {9},
  year      = {2011},
  isbn      = {978-3-939897-25-5}
}
@inproceedings{conf/stacs/KnauerTW11,
  author    = {Christian Knauer and
               Hans Raj Tiwary and
               Daniel Werner},
  title     = {On the computational complexity of Ham-Sandwich cuts, Helly
               sets, and related problems},
  booktitle = {STACS},
  year      = {2011},
  pages     = {649-660},
  doi       = {10.4230/LIPIcs.STACS.2011.649},
  crossref  = {conf/stacs/2011}
}
Powered by bibtexbrowser