pdfformat: 

@InProceedings{knauer_et_al:LIPIcs:2011:3051, author = {Christian Knauer and Hans Raj Tiwary and Daniel Werner}, title = {{On the computational complexity of HamSandwich cuts, Helly sets, and related problems}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) }, pages = {649660}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897255}, ISSN = {18688969}, year = {2011}, volume = {9}, editor = {Thomas Schwentick and Christoph D{\"u}rr}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3051}, URN = {urn:nbn:de:0030drops30514}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.649}, annote = {Keywords: computational geometry, combinatorial geometry, hamsandwich cuts, parameterized complexity.} }
2011
Keywords:  computational geometry, combinatorial geometry, hamsandwich cuts, parameterized complexity.  
Seminar:  28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)  
Issue date:  2011  
Date of publication:  2011 