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-dev.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 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, and Paweł Żyliński. Illuminating the x-Axis by α-Floodlights. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 11:1-11:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{nilsson_et_al:LIPIcs.ISAAC.2021.11, author = {Nilsson, Bengt J. and Orden, David and Palios, Leonidas and Seara, Carlos and \.{Z}yli\'{n}ski, Pawe{\l}}, title = {{Illuminating the x-Axis by \alpha-Floodlights}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.11}, URN = {urn:nbn:de:0030-drops-154444}, doi = {10.4230/LIPIcs.ISAAC.2021.11}, annote = {Keywords: Computational Geometry, Visibility, Art Gallery Problems, Floodlights} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Amotz Bar-Noy, David Peleg, Dror Rawitz, and Elad Yehezkel. Selected Neighbor Degree Forest Realization. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 27:1-27:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{barnoy_et_al:LIPIcs.ISAAC.2021.27, author = {Bar-Noy, Amotz and Peleg, David and Rawitz, Dror and Yehezkel, Elad}, title = {{Selected Neighbor Degree Forest Realization}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.27}, URN = {urn:nbn:de:0030-drops-154609}, doi = {10.4230/LIPIcs.ISAAC.2021.27}, annote = {Keywords: network realization, graph algorithms, lower bound} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Tali Kaufman and David Mass. Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 56:1-56:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kaufman_et_al:LIPIcs.ISAAC.2021.56, author = {Kaufman, Tali and Mass, David}, title = {{Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {56:1--56:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.56}, URN = {urn:nbn:de:0030-drops-154898}, doi = {10.4230/LIPIcs.ISAAC.2021.56}, annote = {Keywords: High dimensional expanders, Unique-neighbor-like expansion, Cosystolic expansion} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Shuhao Tan. Computing Shapley Values for Mean Width in 3-D. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 67:1-67:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{tan:LIPIcs.ISAAC.2021.67, author = {Tan, Shuhao}, title = {{Computing Shapley Values for Mean Width in 3-D}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {67:1--67:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.67}, URN = {urn:nbn:de:0030-drops-155008}, doi = {10.4230/LIPIcs.ISAAC.2021.67}, annote = {Keywords: Shapley value, mean width, dynamic convolution} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Leyla Biabani, Mark de Berg, and Morteza Monemizadeh. Maximum-Weight Matching in Sliding Windows and Beyond. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 73:1-73:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{biabani_et_al:LIPIcs.ISAAC.2021.73, author = {Biabani, Leyla and de Berg, Mark and Monemizadeh, Morteza}, title = {{Maximum-Weight Matching in Sliding Windows and Beyond}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {73:1--73:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.73}, URN = {urn:nbn:de:0030-drops-155061}, doi = {10.4230/LIPIcs.ISAAC.2021.73}, annote = {Keywords: maximum-weight matching, sliding-window model, approximation algorithm, and subadditve functions} }
Published in: LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, and Darren Strash. On Romeo and Juliet Problems: Minimizing Distance-to-Sight. In 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 101, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ahn_et_al:LIPIcs.SWAT.2018.6, author = {Ahn, Hee-Kap and Oh, Eunjin and Schlipf, Lena and Stehn, Fabian and Strash, Darren}, title = {{On Romeo and Juliet Problems: Minimizing Distance-to-Sight}}, booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-068-2}, ISSN = {1868-8969}, year = {2018}, volume = {101}, editor = {Eppstein, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.6}, URN = {urn:nbn:de:0030-drops-88322}, doi = {10.4230/LIPIcs.SWAT.2018.6}, annote = {Keywords: Visibility polygon, shortest-path, watchman problems} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Sagar Kale and Sumedh Tirodkar. Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 15:1-15:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kale_et_al:LIPIcs.APPROX-RANDOM.2017.15, author = {Kale, Sagar and Tirodkar, Sumedh}, title = {{Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {15:1--15:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.15}, URN = {urn:nbn:de:0030-drops-75645}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.15}, annote = {Keywords: Semi Streaming, Maximum Matching} }
Published in: Dagstuhl Seminar Proceedings, Volume 5151, Annotating, Extracting and Reasoning about Time and Events (2005)
David Ahn, Sisay Fissaha Adafre, and Maarten de Rijke. Towards Task-Based Temporal Extraction and Recognition. In Annotating, Extracting and Reasoning about Time and Events. Dagstuhl Seminar Proceedings, Volume 5151, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{ahn_et_al:DagSemProc.05151.12, author = {Ahn, David and Fissaha Adafre, Sisay and de Rijke, Maarten}, title = {{Towards Task-Based Temporal Extraction and Recognition}}, booktitle = {Annotating, Extracting and Reasoning about Time and Events}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5151}, editor = {Graham Katz and James Pustejovsky and Frank Schilder}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05151.12}, URN = {urn:nbn:de:0030-drops-3150}, doi = {10.4230/DagSemProc.05151.12}, annote = {Keywords: Information extraction, natural language, temporal reasoning, text mining} }
Feedback for Dagstuhl Publishing