LIPIcs, Volume 51
SoCG 2016, June 14-18, 2016, Boston, USA
Editors: Sándor Fekete and Anna Lubiw
Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Anna Lubiw and Anurag Murty Naredla. The Geodesic Edge Center of a Simple Polygon. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 49:1-49:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{lubiw_et_al:LIPIcs.SoCG.2023.49, author = {Lubiw, Anna and Naredla, Anurag Murty}, title = {{The Geodesic Edge Center of a Simple Polygon}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.49}, URN = {urn:nbn:de:0030-drops-178994}, doi = {10.4230/LIPIcs.SoCG.2023.49}, annote = {Keywords: geodesic center of polygon, farthest edges, farthest-segment Voronoi diagram} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein. Hardness of Token Swapping on Trees. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 3:1-3:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{aichholzer_et_al:LIPIcs.ESA.2022.3, author = {Aichholzer, Oswin and Demaine, Erik D. and Korman, Matias and Lubiw, Anna and Lynch, Jayson and Mas\'{a}rov\'{a}, Zuzana and Rudoy, Mikhail and Vassilevska Williams, Virginia and Wein, Nicole}, title = {{Hardness of Token Swapping on Trees}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.3}, URN = {urn:nbn:de:0030-drops-169413}, doi = {10.4230/LIPIcs.ESA.2022.3}, annote = {Keywords: Sorting, Token swapping, Trees, NP-hard, Approximation} }
Published in: Dagstuhl Reports, Volume 12, Issue 2 (2022)
Maike Buchin, Anna Lubiw, Arnaud de Mesmay, Saul Schleimer, and Florestan Brunck. Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062). In Dagstuhl Reports, Volume 12, Issue 2, pp. 17-66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{buchin_et_al:DagRep.12.2.17, author = {Buchin, Maike and Lubiw, Anna and de Mesmay, Arnaud and Schleimer, Saul and Brunck, Florestan}, title = {{Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062)}}, pages = {17--66}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {12}, number = {2}, editor = {Buchin, Maike and Lubiw, Anna and de Mesmay, Arnaud and Schleimer, Saul and Brunck, Florestan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.2.17}, URN = {urn:nbn:de:0030-drops-169305}, doi = {10.4230/DagRep.12.2.17}, annote = {Keywords: Geometric Topology, Computational Geometry, Graph Drawing, Reconfiguration, Dagstuhl Seminar} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, and Graeme Stroud. Distant Representatives for Rectangles in the Plane. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 17:1-17:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{biedl_et_al:LIPIcs.ESA.2021.17, author = {Biedl, Therese and Lubiw, Anna and Naredla, Anurag Murty and Ralbovsky, Peter Dominik and Stroud, Graeme}, title = {{Distant Representatives for Rectangles in the Plane}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {17:1--17:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.17}, URN = {urn:nbn:de:0030-drops-145982}, doi = {10.4230/LIPIcs.ESA.2021.17}, annote = {Keywords: Distant representatives, blocker shapes, matching, approximation algorithm, APX-hardness} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Anna Lubiw and Anurag Murty Naredla. The Visibility Center of a Simple Polygon. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 65:1-65:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{lubiw_et_al:LIPIcs.ESA.2021.65, author = {Lubiw, Anna and Naredla, Anurag Murty}, title = {{The Visibility Center of a Simple Polygon}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {65:1--65:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.65}, URN = {urn:nbn:de:0030-drops-146466}, doi = {10.4230/LIPIcs.ESA.2021.65}, annote = {Keywords: Visibility, Shortest Paths, Simple Polygons, Facility Location} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, and Anil Maheshwari. Bounded-Angle Minimum Spanning Trees. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 14:1-14:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{biniaz_et_al:LIPIcs.SWAT.2020.14, author = {Biniaz, Ahmad and Bose, Prosenjit and Lubiw, Anna and Maheshwari, Anil}, title = {{Bounded-Angle Minimum Spanning Trees}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {14:1--14:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.14}, URN = {urn:nbn:de:0030-drops-122616}, doi = {10.4230/LIPIcs.SWAT.2020.14}, annote = {Keywords: bounded-angle MST, directional antenna, approximation algorithms} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Nathaniel Harms. Universal Communication, Universal Graphs, and Graph Labeling. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 33:1-33:27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{harms:LIPIcs.ITCS.2020.33, author = {Harms, Nathaniel}, title = {{Universal Communication, Universal Graphs, and Graph Labeling}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {33:1--33:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.33}, URN = {urn:nbn:de:0030-drops-117182}, doi = {10.4230/LIPIcs.ITCS.2020.33}, annote = {Keywords: Universal graphs, graph labeling, distance labeling, planar graphs, lattices, hamming distance} }
Published in: Dagstuhl Reports, Volume 9, Issue 8 (2020)
Maarten Löffler, Anna Lubiw, Saul Schleimer, and Erin Moriarty Wolf Chambers. Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352). In Dagstuhl Reports, Volume 9, Issue 8, pp. 84-112, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@Article{loffler_et_al:DagRep.9.8.84, author = {L\"{o}ffler, Maarten and Lubiw, Anna and Schleimer, Saul and Wolf Chambers, Erin Moriarty}, title = {{Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352)}}, pages = {84--112}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {9}, number = {8}, editor = {L\"{o}ffler, Maarten and Lubiw, Anna and Schleimer, Saul and Wolf Chambers, Erin Moriarty}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.8.84}, URN = {urn:nbn:de:0030-drops-117734}, doi = {10.4230/DagRep.9.8.84}, annote = {Keywords: Geometric topology, Graph Drawing, Computational Geometry} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, and Jeffrey Shallit. Rollercoasters and Caterpillars. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 18:1-18:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{biedl_et_al:LIPIcs.ICALP.2018.18, author = {Biedl, Therese and Biniaz, Ahmad and Cummings, Robert and Lubiw, Anna and Manea, Florin and Nowotka, Dirk and Shallit, Jeffrey}, title = {{Rollercoasters and Caterpillars}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.18}, URN = {urn:nbn:de:0030-drops-90224}, doi = {10.4230/LIPIcs.ICALP.2018.18}, annote = {Keywords: sequences, alternating runs, patterns in permutations, caterpillars} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Anna Lubiw, Zuzana Masárová, and Uli Wagner. A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 49:1-49:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{lubiw_et_al:LIPIcs.SoCG.2017.49, author = {Lubiw, Anna and Mas\'{a}rov\'{a}, Zuzana and Wagner, Uli}, title = {{A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.49}, URN = {urn:nbn:de:0030-drops-72078}, doi = {10.4230/LIPIcs.SoCG.2017.49}, annote = {Keywords: triangulations, reconfiguration, flip, constrained triangulations, Delaunay triangulation, shellability, piecewise linear balls} }
Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, and Jeffrey Shallit. Fractional Coverings, Greedy Coverings, and Rectifier Networks. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 23:1-23:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{chistikov_et_al:LIPIcs.STACS.2017.23, author = {Chistikov, Dmitry and Iv\'{a}n, Szabolcs and Lubiw, Anna and Shallit, Jeffrey}, title = {{Fractional Coverings, Greedy Coverings, and Rectifier Networks}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {23:1--23:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.23}, URN = {urn:nbn:de:0030-drops-70107}, doi = {10.4230/LIPIcs.STACS.2017.23}, annote = {Keywords: rectifier network, OR-circuit, biclique covering, fractional covering, greedy covering} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Sándor Fekete and Anna Lubiw. LIPIcs, Volume 51, SoCG'16, Complete Volume. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@Proceedings{fekete_et_al:LIPIcs.SoCG.2016, title = {{LIPIcs, Volume 51, SoCG'16, Complete Volume}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016}, URN = {urn:nbn:de:0030-drops-60580}, doi = {10.4230/LIPIcs.SoCG.2016}, annote = {Keywords: Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics, Combinatorics, Computer Graphics, Computational Geometry and Object Modeling} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Sándor Fekete and Anna Lubiw. Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 0:i-0:xviii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fekete_et_al:LIPIcs.SoCG.2016.0, author = {Fekete, S\'{a}ndor and Lubiw, Anna}, title = {{Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.0}, URN = {urn:nbn:de:0030-drops-59658}, doi = {10.4230/LIPIcs.SoCG.2016.0}, annote = {Keywords: Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Daniela Rus. Toward Pervasive Robots (Invited Talk). In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, p. 1:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{rus:LIPIcs.SoCG.2016.1, author = {Rus, Daniela}, title = {{Toward Pervasive Robots}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.1}, URN = {urn:nbn:de:0030-drops-58939}, doi = {10.4230/LIPIcs.SoCG.2016.1}, annote = {Keywords: rus@csail.mit.edu} }
Feedback for Dagstuhl Publishing