Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)
Iyad Kanj and Salman Parsa. On the Parameterized Complexity of Motion Planning for Rectangular Robots. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 65:1-65:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kanj_et_al:LIPIcs.SoCG.2024.65, author = {Kanj, Iyad and Parsa, Salman}, title = {{On the Parameterized Complexity of Motion Planning for Rectangular Robots}}, booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)}, pages = {65:1--65:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-316-4}, ISSN = {1868-8969}, year = {2024}, volume = {293}, editor = {Mulzer, Wolfgang and Phillips, Jeff M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.65}, URN = {urn:nbn:de:0030-drops-200108}, doi = {10.4230/LIPIcs.SoCG.2024.65}, annote = {Keywords: motion planning of rectangular robots, coordinated motion planing of rectangular robots, parameterized complexity} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Erin Wolf Chambers, Salman Parsa, and Hannah Schreiber. On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chambers_et_al:LIPIcs.SoCG.2022.25, author = {Chambers, Erin Wolf and Parsa, Salman and Schreiber, Hannah}, title = {{On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {25:1--25:15}, 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.25}, URN = {urn:nbn:de:0030-drops-160338}, doi = {10.4230/LIPIcs.SoCG.2022.25}, annote = {Keywords: computational topology, bottleneck optimal cycles, homology} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Tim Ophelders and Salman Parsa. Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 55:1-55:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ophelders_et_al:LIPIcs.SoCG.2022.55, author = {Ophelders, Tim and Parsa, Salman}, title = {{Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {55:1--55:16}, 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.55}, URN = {urn:nbn:de:0030-drops-160631}, doi = {10.4230/LIPIcs.SoCG.2022.55}, annote = {Keywords: Graph drawing, homotopy height} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, and Salman Parsa. Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chambers_et_al:LIPIcs.SoCG.2021.23, author = {Chambers, Erin Wolf and Lazarus, Francis and de Mesmay, Arnaud and Parsa, Salman}, title = {{Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {23:1--23:16}, 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.23}, URN = {urn:nbn:de:0030-drops-138223}, doi = {10.4230/LIPIcs.SoCG.2021.23}, annote = {Keywords: 3-manifolds, surfaces, low-dimensional topology, contractibility, compressed curves} }
Feedback for Dagstuhl Publishing