Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, and Fabian Stehn. Placing your Coins on a Shelf. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{alt_et_al:LIPIcs.ISAAC.2017.4, author = {Alt, Helmut and Buchin, Kevin and Chaplick, Steven and Cheong, Otfried and Kindermann, Philipp and Knauer, Christian and Stehn, Fabian}, title = {{Placing your Coins on a Shelf}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {4:1--4:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.4}, URN = {urn:nbn:de:0030-drops-82145}, doi = {10.4230/LIPIcs.ISAAC.2017.4}, annote = {Keywords: packing problems, approximation algorithms, NP-hardness} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Helmut Alt and Nadja Scharf. Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{alt_et_al:LIPIcs.ISAAC.2016.11, author = {Alt, Helmut and Scharf, Nadja}, title = {{Approximating Smallest Containers for Packing Three-Dimensional Convex Objects}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.11}, URN = {urn:nbn:de:0030-drops-67801}, doi = {10.4230/LIPIcs.ISAAC.2016.11}, annote = {Keywords: computational geometry, packing, approximation algorithm} }
Published in: Dagstuhl Seminar Proceedings, Volume 9111, Computational Geometry (2009)
Pankaj Kumar Agarwal, Helmut Alt, and Monique Teillaud. 09111 Abstracts Collection – Computational Geometry. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{agarwal_et_al:DagSemProc.09111.1, author = {Agarwal, Pankaj Kumar and Alt, Helmut and Teillaud, Monique}, title = {{09111 Abstracts Collection – Computational Geometry}}, booktitle = {Computational Geometry}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.1}, URN = {urn:nbn:de:0030-drops-20346}, doi = {10.4230/DagSemProc.09111.1}, annote = {Keywords: } }
Published in: Dagstuhl Seminar Proceedings, Volume 9111, Computational Geometry (2009)
Günter Rote. Two Applications of Point Matching. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{rote:DagSemProc.09111.6, author = {Rote, G\"{u}nter}, title = {{Two Applications of Point Matching}}, booktitle = {Computational Geometry}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.6}, URN = {urn:nbn:de:0030-drops-20292}, doi = {10.4230/DagSemProc.09111.6}, annote = {Keywords: Bipartite matching, least-squares} }
Published in: Dagstuhl Seminar Proceedings, Volume 9111, Computational Geometry (2009)
Daniel Kane, Gregory Nathan Price, and Erik Demaine. A Pseudopolynomial Algorithm for Alexandrov's Theorem. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{kane_et_al:DagSemProc.09111.2, author = {Kane, Daniel and Price, Gregory Nathan and Demaine, Erik}, title = {{A Pseudopolynomial Algorithm for Alexandrov's Theorem}}, booktitle = {Computational Geometry}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.2}, URN = {urn:nbn:de:0030-drops-20328}, doi = {10.4230/DagSemProc.09111.2}, annote = {Keywords: Folding, metrics, pseudopolynomial, algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 9111, Computational Geometry (2009)
Joachim Giesen and Manjunath Madhusudan. Minimizing Absolute Gaussian Curvature Locally. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{giesen_et_al:DagSemProc.09111.3, author = {Giesen, Joachim and Madhusudan, Manjunath}, title = {{Minimizing Absolute Gaussian Curvature Locally}}, booktitle = {Computational Geometry}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.3}, URN = {urn:nbn:de:0030-drops-20311}, doi = {10.4230/DagSemProc.09111.3}, annote = {Keywords: Absolute Gaussian curvature, surface reconstruction, mesh smoothing} }
Published in: Dagstuhl Seminar Proceedings, Volume 9111, Computational Geometry (2009)
Joseph S. Mitchell. Open Problem Session. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{mitchell:DagSemProc.09111.4, author = {Mitchell, Joseph S.}, title = {{Open Problem Session}}, booktitle = {Computational Geometry}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.4}, URN = {urn:nbn:de:0030-drops-20308}, doi = {10.4230/DagSemProc.09111.4}, annote = {Keywords: Open problems, computational geometry} }
Published in: Dagstuhl Seminar Proceedings, Volume 9111, Computational Geometry (2009)
Carola Wenk and Atlas F. Cook. Shortest Path Problems on a Polyhedral Surface. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{wenk_et_al:DagSemProc.09111.5, author = {Wenk, Carola and Cook, Atlas F.}, title = {{Shortest Path Problems on a Polyhedral Surface}}, booktitle = {Computational Geometry}, pages = {1--30}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9111}, editor = {Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.5}, URN = {urn:nbn:de:0030-drops-20332}, doi = {10.4230/DagSemProc.09111.5}, annote = {Keywords: Shortest paths, edge sequences} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Helmut Alt, Bernard Chazelle, and Raimund Seidel. Computational Geometry (Dagstuhl Seminar 9511). Dagstuhl Seminar Report 109, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1995)
@TechReport{alt_et_al:DagSemRep.109, author = {Alt, Helmut and Chazelle, Bernard and Seidel, Raimund}, title = {{Computational Geometry (Dagstuhl Seminar 9511)}}, pages = {1--27}, ISSN = {1619-0203}, year = {1995}, type = {Dagstuhl Seminar Report}, number = {109}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.109}, URN = {urn:nbn:de:0030-drops-149970}, doi = {10.4230/DagSemRep.109}, }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Helmut Alt, Bernard Chazelle, and Emo Welzl. Computational Geometry (Dagstuhl Seminar 9312). Dagstuhl Seminar Report 59, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1993)
@TechReport{alt_et_al:DagSemRep.59, author = {Alt, Helmut and Chazelle, Bernard and Welzl, Emo}, title = {{Computational Geometry (Dagstuhl Seminar 9312)}}, pages = {1--28}, ISSN = {1619-0203}, year = {1993}, type = {Dagstuhl Seminar Report}, number = {59}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.59}, URN = {urn:nbn:de:0030-drops-149479}, doi = {10.4230/DagSemRep.59}, }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Helmut Alt, Bernard Chazelle, and Emo Welzl. Computational Geometry (Dagstuhl Seminar 9141). Dagstuhl Seminar Report 22, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1991)
@TechReport{alt_et_al:DagSemRep.22, author = {Alt, Helmut and Chazelle, Bernard and Welzl, Emo}, title = {{Computational Geometry (Dagstuhl Seminar 9141)}}, pages = {1--27}, ISSN = {1619-0203}, year = {1991}, type = {Dagstuhl Seminar Report}, number = {22}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.22}, URN = {urn:nbn:de:0030-drops-149101}, doi = {10.4230/DagSemRep.22}, }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Alt Helmut and Welzl Emo. Algorithmic Geometry (Dagstuhl Seminar 9041). Dagstuhl Seminar Report 4, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1991)
@TechReport{helmut_et_al:DagSemRep.4, author = {Helmut, Alt and Emo, Welzl}, title = {{Algorithmic Geometry (Dagstuhl Seminar 9041)}}, pages = {1--19}, ISSN = {1619-0203}, year = {1991}, type = {Dagstuhl Seminar Report}, number = {4}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.4}, URN = {urn:nbn:de:0030-drops-148928}, doi = {10.4230/DagSemRep.4}, }
Feedback for Dagstuhl Publishing