Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems

Marx, Dániel and Miltzow, Tillmann (2016) Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems. In: 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs) (51). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 52.1-52.16. ISBN 978-3-95977-009-5 10.4230/LIPIcs.SoCG.2016.52

[img] Text
Marx_52_3156154_ny.pdf

Download (597kB)
Item Type: Book Section
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 29 Jan 2017 20:22
Last Modified: 29 Jan 2017 20:22
URI: http://eprints.sztaki.hu/id/eprint/9029

Update Item Update Item