pdf-format: |
|
@InProceedings{knauer_et_al:LIPIcs:2011:3051, 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 = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) }, pages = {649--660}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Thomas Schwentick and Christoph D{\"u}rr}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3051}, URN = {urn:nbn:de:0030-drops-30514}, doi = {10.4230/LIPIcs.STACS.2011.649}, annote = {Keywords: computational geometry, combinatorial geometry, ham-sandwich cuts, parameterized complexity.} }
Keywords: | computational geometry, combinatorial geometry, ham-sandwich cuts, parameterized complexity. | |
Seminar: | 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) | |
Issue date: | 2011 | |
Date of publication: | 11.03.2011 |