Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, and Martin Nöllenburg. Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 18:1-18:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{bhore_et_al:LIPIcs.SoCG.2023.18, author = {Bhore, Sujoy and Ganian, Robert and Khazaliya, Liana and Montecchiani, Fabrizio and N\"{o}llenburg, Martin}, title = {{Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {18:1--18:16}, 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.18}, URN = {urn:nbn:de:0030-drops-178689}, doi = {10.4230/LIPIcs.SoCG.2023.18}, annote = {Keywords: orthogonal drawings, bend minimization, extension problems, parameterized complexity} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, and Anaïs Villedieu. Minimum Link Fencing. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 34:1-34:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhore_et_al:LIPIcs.ISAAC.2022.34, author = {Bhore, Sujoy and Klute, Fabian and L\"{o}ffler, Maarten and N\"{o}llenburg, Martin and Terziadis, Soeren and Villedieu, Ana\"{i}s}, title = {{Minimum Link Fencing}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.34}, URN = {urn:nbn:de:0030-drops-173191}, doi = {10.4230/LIPIcs.ISAAC.2022.34}, annote = {Keywords: computational geometry, polygon nesting, polygon separation} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, and Csaba D. Tóth. Online Spanners in Metric Spaces. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 18:1-18:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhore_et_al:LIPIcs.ESA.2022.18, author = {Bhore, Sujoy and Filtser, Arnold and Khodabandeh, Hadi and T\'{o}th, Csaba D.}, title = {{Online Spanners in Metric Spaces}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {18:1--18:20}, 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.18}, URN = {urn:nbn:de:0030-drops-169564}, doi = {10.4230/LIPIcs.ESA.2022.18}, annote = {Keywords: spanner, online algorithm, lightness, sparsity, minimum weight} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Jonathan B. Conroy and Csaba D. Tóth. Hop-Spanners for Geometric Intersection Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 30:1-30:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{conroy_et_al:LIPIcs.SoCG.2022.30, author = {Conroy, Jonathan B. and T\'{o}th, Csaba D.}, title = {{Hop-Spanners for Geometric Intersection Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.30}, URN = {urn:nbn:de:0030-drops-160381}, doi = {10.4230/LIPIcs.SoCG.2022.30}, annote = {Keywords: geometric intersection graph, unit disk graph, hop-spanner} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, and Hsiang-Yun Wu. Untangling Circular Drawings: Algorithms and Complexity. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 19:1-19:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bhore_et_al:LIPIcs.ISAAC.2021.19, author = {Bhore, Sujoy and Li, Guangping and N\"{o}llenburg, Martin and Rutter, Ignaz and Wu, Hsiang-Yun}, title = {{Untangling Circular Drawings: Algorithms and Complexity}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {19:1--19: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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.19}, URN = {urn:nbn:de:0030-drops-154528}, doi = {10.4230/LIPIcs.ISAAC.2021.19}, annote = {Keywords: graph drawing, straight-line drawing, outerplanarity, NP-hardness, untangling} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Sujoy Bhore and Rahul Jain. Space-Efficient Algorithms for Reachability in Directed Geometric Graphs. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 63:1-63:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bhore_et_al:LIPIcs.ISAAC.2021.63, author = {Bhore, Sujoy and Jain, Rahul}, title = {{Space-Efficient Algorithms for Reachability in Directed Geometric Graphs}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {63:1--63: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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.63}, URN = {urn:nbn:de:0030-drops-154961}, doi = {10.4230/LIPIcs.ISAAC.2021.63}, annote = {Keywords: Reachablity, Geometric intersection graphs, Space-efficient algorithms} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Sujoy Bhore and Csaba D. Tóth. Online Euclidean Spanners. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 16:1-16:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bhore_et_al:LIPIcs.ESA.2021.16, author = {Bhore, Sujoy and T\'{o}th, Csaba D.}, title = {{Online Euclidean Spanners}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {16:1--16:19}, 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.16}, URN = {urn:nbn:de:0030-drops-145974}, doi = {10.4230/LIPIcs.ESA.2021.16}, annote = {Keywords: Geometric spanner, (1+\epsilon)-spanner, minimum weight, online algorithm} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Sujoy Bhore and Csaba D. Tóth. Light Euclidean Steiner Spanners in the Plane. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 15:1-15:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bhore_et_al:LIPIcs.SoCG.2021.15, author = {Bhore, Sujoy and T\'{o}th, Csaba D.}, title = {{Light Euclidean Steiner Spanners in the Plane}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.15}, URN = {urn:nbn:de:0030-drops-138145}, doi = {10.4230/LIPIcs.SoCG.2021.15}, annote = {Keywords: Geometric spanner, lightness, minimum weight} }
Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Sujoy Bhore and Csaba D. Tóth. On Euclidean Steiner (1+ε)-Spanners. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 13:1-13:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bhore_et_al:LIPIcs.STACS.2021.13, author = {Bhore, Sujoy and T\'{o}th, Csaba D.}, title = {{On Euclidean Steiner (1+\epsilon)-Spanners}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-180-1}, ISSN = {1868-8969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.13}, URN = {urn:nbn:de:0030-drops-136586}, doi = {10.4230/LIPIcs.STACS.2021.13}, annote = {Keywords: Geometric spanner, (1+\epsilon)-spanner, lightness, sparsity, minimum weight} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, and Joseph S. B. Mitchell. Planar Bichromatic Bottleneck Spanning Trees. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 1:1-1:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{abuaffash_et_al:LIPIcs.ESA.2020.1, author = {Abu-Affash, A. Karim and Bhore, Sujoy and Carmi, Paz and Mitchell, Joseph S. B.}, title = {{Planar Bichromatic Bottleneck Spanning Trees}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {1:1--1:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.1}, URN = {urn:nbn:de:0030-drops-128670}, doi = {10.4230/LIPIcs.ESA.2020.1}, annote = {Keywords: Approximation Algorithms, Bottleneck Spanning Tree, NP-Hardness} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Sujoy Bhore, Guangping Li, and Martin Nöllenburg. An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 19:1-19:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bhore_et_al:LIPIcs.ESA.2020.19, author = {Bhore, Sujoy and Li, Guangping and N\"{o}llenburg, Martin}, title = {{An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {19:1--19:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.19}, URN = {urn:nbn:de:0030-drops-128856}, doi = {10.4230/LIPIcs.ESA.2020.19}, annote = {Keywords: Independent Sets, Dynamic Algorithms, Rectangle Intersection Graphs, Approximation Algorithms, Experimental Evaluation} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, and Meirav Zehavi. Parameterized Study of Steiner Tree on Unit Disk Graphs. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 13:1-13:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bhore_et_al:LIPIcs.SWAT.2020.13, author = {Bhore, Sujoy and Carmi, Paz and Kolay, Sudeshna and Zehavi, Meirav}, title = {{Parameterized Study of Steiner Tree on Unit Disk Graphs}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {13:1--13:18}, 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.13}, URN = {urn:nbn:de:0030-drops-122607}, doi = {10.4230/LIPIcs.SWAT.2020.13}, annote = {Keywords: Unit Disk Graphs, FPT, Subexponential exact algorithms, NP-Hardness, W-Hardness} }
Feedback for Dagstuhl Publishing