%0 Conference Paper %1 conf/stacs/KnauerTW11 %A Knauer, Christian %A Tiwary, Hans Raj %A Werner, Daniel %B STACS %D 2011 %E Schwentick, Thomas %E Dürr, Christoph %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 649-660 %T On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2011.html#KnauerTW11 %V 9 %@ 978-3-939897-25-5

@inproceedings{conf/stacs/KnauerTW11, added-at = {2018-08-23T00:00:00.000+0200}, author = {Knauer, Christian and Tiwary, Hans Raj and Werner, Daniel}, biburl = {https://www.bibsonomy.org/bibtex/2ac48acc1882455f86d268dc7397ee797/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2011}, editor = {Schwentick, Thomas and Dürr, Christoph}, ee = {https://doi.org/10.4230/LIPIcs.STACS.2011.649}, interhash = {143d9d54abbcdd26fe8c7ad430a0f842}, intrahash = {ac48acc1882455f86d268dc7397ee797}, isbn = {978-3-939897-25-5}, keywords = {dblp}, pages = {649-660}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:48:08.000+0100}, title = {On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2011.html#KnauerTW11}, volume = 9, year = 2011 }