Published in: LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025)
Jack Spalding-Jamieson and Anurag Murty Naredla. Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 90:1-90:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{spaldingjamieson_et_al:LIPIcs.ESA.2025.90, author = {Spalding-Jamieson, Jack and Naredla, Anurag Murty}, title = {{Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds}}, booktitle = {33rd Annual European Symposium on Algorithms (ESA 2025)}, pages = {90:1--90:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-395-9}, ISSN = {1868-8969}, year = {2025}, volume = {351}, editor = {Benoit, Anne and Kaplan, Haim and Wild, Sebastian 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.2025.90}, URN = {urn:nbn:de:0030-drops-245598}, doi = {10.4230/LIPIcs.ESA.2025.90}, annote = {Keywords: obstacle separation, point separation, geometric intersection graph, Z₂-homology, fine-grained lower bounds} }
Published in: LIPIcs, Volume 332, 41st International Symposium on Computational Geometry (SoCG 2025)
Ahmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Thomas Shermer, Jack Spalding-Jamieson, Rolf Svenning, and Da Wei Zheng. Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 20:1-20:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{biniaz_et_al:LIPIcs.SoCG.2025.20, author = {Biniaz, Ahmad and Maheshwari, Anil and Merrild, Magnus Christian Ring and Mitchell, Joseph S. B. and Odak, Saeed and Polishchuk, Valentin and Robson, Eliot W. and Rysgaard, Casper Moldrup and Schou, Jens Kristian Refsgaard and Shermer, Thomas and Spalding-Jamieson, Jack and Svenning, Rolf and Zheng, Da Wei}, title = {{Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {20:1--20:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.20}, URN = {urn:nbn:de:0030-drops-231720}, doi = {10.4230/LIPIcs.SoCG.2025.20}, annote = {Keywords: Art Gallery Problem, Computational Geometry, Combinatorics, Discrete Algorithms} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Therese Biedl, Anna Lubiw, and Jack Spalding-Jamieson. Morphing Planar Graph Drawings via Orthogonal Box Drawings. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 40:1-40:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{biedl_et_al:LIPIcs.GD.2024.40, author = {Biedl, Therese and Lubiw, Anna and Spalding-Jamieson, Jack}, title = {{Morphing Planar Graph Drawings via Orthogonal Box Drawings}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {40:1--40:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-343-0}, ISSN = {1868-8969}, year = {2024}, volume = {320}, editor = {Felsner, Stefan and Klein, Karsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.40}, URN = {urn:nbn:de:0030-drops-213242}, doi = {10.4230/LIPIcs.GD.2024.40}, annote = {Keywords: morphing, graph morphing, linear morph, planar graph drawing, orthogonal box drawing, orthogonal drawing, algorithm} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Jack Spalding-Jamieson, Brandon Zhang, and Da Wei Zheng. Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge). In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 72:1-72:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{spaldingjamieson_et_al:LIPIcs.SoCG.2022.72, author = {Spalding-Jamieson, Jack and Zhang, Brandon and Zheng, Da Wei}, title = {{Conflict-Based Local Search for Minimum Partition into Plane Subgraphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {72:1--72:6}, 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.72}, URN = {urn:nbn:de:0030-drops-160807}, doi = {10.4230/LIPIcs.SoCG.2022.72}, annote = {Keywords: local search, planar graph, graph colouring, geometric graph, conflict optimizer} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, and Da Wei Zheng. Coordinated Motion Planning Through Randomized k-Opt (CG Challenge). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 64:1-64:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{liu_et_al:LIPIcs.SoCG.2021.64, author = {Liu, Paul and Spalding-Jamieson, Jack and Zhang, Brandon and Zheng, Da Wei}, title = {{Coordinated Motion Planning Through Randomized k-Opt}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {64:1--64:8}, 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.64}, URN = {urn:nbn:de:0030-drops-138635}, doi = {10.4230/LIPIcs.SoCG.2021.64}, annote = {Keywords: motion planning, randomized local search, path finding} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Da Wei Zheng, Jack Spalding-Jamieson, and Brandon Zhang. Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge). In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 83:1-83:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{zheng_et_al:LIPIcs.SoCG.2020.83, author = {Zheng, Da Wei and Spalding-Jamieson, Jack and Zhang, Brandon}, title = {{Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {83:1--83:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.83}, URN = {urn:nbn:de:0030-drops-122412}, doi = {10.4230/LIPIcs.SoCG.2020.83}, annote = {Keywords: convex partition, randomized local search, planar point sets} }