Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, and Alexander Wolff. The Price of Upwardness. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 13:1-13:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{angelini_et_al:LIPIcs.GD.2024.13, author = {Angelini, Patrizio and Biedl, Therese and Chimani, Markus and Cornelsen, Sabine and Da Lozzo, Giordano and Hong, Seok-Hee and Liotta, Giuseppe and Patrignani, Maurizio and Pupyrev, Sergey and Rutter, Ignaz and Wolff, Alexander}, title = {{The Price of Upwardness}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {13:1--13:20}, 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.13}, URN = {urn:nbn:de:0030-drops-212977}, doi = {10.4230/LIPIcs.GD.2024.13}, annote = {Keywords: upward drawings, beyond planarity, upward k-planarity, upward outer-1-planarity} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Julián Mestre and Sergey Pupyrev. Approximating the Minimum Logarithmic Arrangement Problem. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mestre_et_al:LIPIcs.ISAAC.2022.7, author = {Mestre, Juli\'{a}n and Pupyrev, Sergey}, title = {{Approximating the Minimum Logarithmic Arrangement Problem}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {7:1--7:15}, 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.7}, URN = {urn:nbn:de:0030-drops-172924}, doi = {10.4230/LIPIcs.ISAAC.2022.7}, annote = {Keywords: approximation algorithms, graph compression} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Julián Mestre, Sergey Pupyrev, and Seeun William Umboh. On the Extended TSP Problem. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 42:1-42:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{mestre_et_al:LIPIcs.ISAAC.2021.42, author = {Mestre, Juli\'{a}n and Pupyrev, Sergey and Umboh, Seeun William}, title = {{On the Extended TSP Problem}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {42:1--42:14}, 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.42}, URN = {urn:nbn:de:0030-drops-154751}, doi = {10.4230/LIPIcs.ISAAC.2021.42}, annote = {Keywords: profile-guided optimization, approximation algorithms, bandwidth, TSP} }
Feedback for Dagstuhl Publishing