Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Eunjin Oh and Seunghyeok Oh. Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 85:1-85:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{oh_et_al:LIPIcs.ESA.2023.85, author = {Oh, Eunjin and Oh, Seunghyeok}, title = {{Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {85:1--85:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.85}, URN = {urn:nbn:de:0030-drops-187384}, doi = {10.4230/LIPIcs.ESA.2023.85}, annote = {Keywords: Maximum cliques, hyperbolic random graphs} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Kyungjin Cho and Eunjin Oh. Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 46:1-46:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{cho_et_al:LIPIcs.ISAAC.2021.46, author = {Cho, Kyungjin and Oh, Eunjin}, title = {{Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {46:1--46:13}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.46}, URN = {urn:nbn:de:0030-drops-154794}, doi = {10.4230/LIPIcs.ISAAC.2021.46}, annote = {Keywords: k-means clustering, affine subspaces} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Shinwoo An and Eunjin Oh. Feedback Vertex Set on Geometric Intersection Graphs. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 47:1-47:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{an_et_al:LIPIcs.ISAAC.2021.47, author = {An, Shinwoo and Oh, Eunjin}, title = {{Feedback Vertex Set on Geometric Intersection Graphs}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {47:1--47: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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.47}, URN = {urn:nbn:de:0030-drops-154807}, doi = {10.4230/LIPIcs.ISAAC.2021.47}, annote = {Keywords: Feedback vertex set, intersection graphs, parameterized algorithm} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Eunjin Oh. Shortest-Path Queries in Geometric Networks. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 52:1-52:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{oh:LIPIcs.ISAAC.2020.52, author = {Oh, Eunjin}, title = {{Shortest-Path Queries in Geometric Networks}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {52:1--52:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.52}, URN = {urn:nbn:de:0030-drops-133963}, doi = {10.4230/LIPIcs.ISAAC.2020.52}, annote = {Keywords: Shortest path, Euclidean spanner, data structure} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Eunjin Oh. Point Location in Incremental Planar Subdivisions. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{oh:LIPIcs.ISAAC.2018.51, author = {Oh, Eunjin}, title = {{Point Location in Incremental Planar Subdivisions}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {51:1--51:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.51}, URN = {urn:nbn:de:0030-drops-99991}, doi = {10.4230/LIPIcs.ISAAC.2018.51}, annote = {Keywords: Dynamic point location, general incremental planar subdivisions} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Eunjin Oh. Minimizing Distance-to-Sight in Polygonal Domains. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 59:1-59:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{oh:LIPIcs.ISAAC.2018.59, author = {Oh, Eunjin}, title = {{Minimizing Distance-to-Sight in Polygonal Domains}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {59:1--59:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.59}, URN = {urn:nbn:de:0030-drops-100073}, doi = {10.4230/LIPIcs.ISAAC.2018.59}, annote = {Keywords: Visibility in polygonal domains, shortest path in polygonal domains} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Eunjin Oh and Hee-Kap Ahn. Approximate Range Queries for Clustering. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 62:1-62:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{oh_et_al:LIPIcs.SoCG.2018.62, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Approximate Range Queries for Clustering}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.62}, URN = {urn:nbn:de:0030-drops-87755}, doi = {10.4230/LIPIcs.SoCG.2018.62}, annote = {Keywords: Approximate clustering, orthogonal range queries} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Eunjin Oh and Hee-Kap Ahn. Point Location in Dynamic Planar Subdivisions. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 63:1-63:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{oh_et_al:LIPIcs.SoCG.2018.63, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Point Location in Dynamic Planar Subdivisions}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {63:1--63:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.63}, URN = {urn:nbn:de:0030-drops-87769}, doi = {10.4230/LIPIcs.SoCG.2018.63}, annote = {Keywords: dynamic point location, general subdivision} }
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.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 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, and Antoine Vigneron. Faster Algorithms for Growing Prioritized Disks and Rectangles. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 3:1-3:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{ahn_et_al:LIPIcs.ISAAC.2017.3, author = {Ahn, Hee-Kap and Bae, Sang Won and Choi, Jongmin and Korman, Matias and Mulzer, Wolfgang and Oh, Eunjin and Park, Ji-won and van Renssen, Andr\'{e} and Vigneron, Antoine}, title = {{Faster Algorithms for Growing Prioritized Disks and Rectangles}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {3:1--3:13}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.3}, URN = {urn:nbn:de:0030-drops-82199}, doi = {10.4230/LIPIcs.ISAAC.2017.3}, annote = {Keywords: map labeling, growing disks, elimination order} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Eunjin Oh and Hee-Kap Ahn. Finding Pairwise Intersections of Rectangles in a Query Rectangle. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 60:1-60:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{oh_et_al:LIPIcs.ISAAC.2017.60, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Finding Pairwise Intersections of Rectangles in a Query Rectangle}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {60:1--60: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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.60}, URN = {urn:nbn:de:0030-drops-82417}, doi = {10.4230/LIPIcs.ISAAC.2017.60}, annote = {Keywords: Geometric data structures, axis-parallel rectangles, intersection} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Eunjin Oh and Hee-Kap Ahn. A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 61:1-61:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{oh_et_al:LIPIcs.ISAAC.2017.61, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {61:1--61: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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.61}, URN = {urn:nbn:de:0030-drops-82401}, doi = {10.4230/LIPIcs.ISAAC.2017.61}, annote = {Keywords: Time-space trade-off, simple polygon, shortest path, shortest path tree} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Eunjin Oh and Hee-Kap Ahn. Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 51:1-51:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{oh_et_al:LIPIcs.SoCG.2017.51, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {51:1--51: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.51}, URN = {urn:nbn:de:0030-drops-72198}, doi = {10.4230/LIPIcs.SoCG.2017.51}, annote = {Keywords: Dynamic geodesic convex hull, dynamic simple polygons} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Eunjin Oh and Hee-Kap Ahn. Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 52:1-52:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{oh_et_al:LIPIcs.SoCG.2017.52, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {52:1--52: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.52}, URN = {urn:nbn:de:0030-drops-72184}, doi = {10.4230/LIPIcs.SoCG.2017.52}, annote = {Keywords: Simple polygons, Voronoi diagrams, geodesic distance} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Eunjin Oh and Hee-Kap Ahn. Assigning Weights to Minimize the Covering Radius in the Plane. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 58:1-58:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{oh_et_al:LIPIcs.ISAAC.2016.58, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Assigning Weights to Minimize the Covering Radius in the Plane}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {58:1--58:12}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.58}, URN = {urn:nbn:de:0030-drops-68275}, doi = {10.4230/LIPIcs.ISAAC.2016.58}, annote = {Keywords: Weighted center, facility location, weight assignment, combinatorial op- timization, computational geometry} }
Feedback for Dagstuhl Publishing