Published in: LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
Therese Biedl, Ahmad Biniaz, and Martin Derka. On the Size of Outer-String Representations. In 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 101, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{biedl_et_al:LIPIcs.SWAT.2018.10, author = {Biedl, Therese and Biniaz, Ahmad and Derka, Martin}, title = {{On the Size of Outer-String Representations}}, booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)}, pages = {10:1--10:14}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.10}, URN = {urn:nbn:de:0030-drops-88360}, doi = {10.4230/LIPIcs.SWAT.2018.10}, annote = {Keywords: string graph, outer-string graph, size of representation, independent set} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Therese Biedl, Markus Chimani, Martin Derka, and Petra Mutzel. Crossing Number for Graphs with Bounded~Pathwidth. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{biedl_et_al:LIPIcs.ISAAC.2017.13, author = {Biedl, Therese and Chimani, Markus and Derka, Martin and Mutzel, Petra}, title = {{Crossing Number for Graphs with Bounded\textasciitildePathwidth}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {13:1--13: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.13}, URN = {urn:nbn:de:0030-drops-82570}, doi = {10.4230/LIPIcs.ISAAC.2017.13}, annote = {Keywords: Crossing Number, Graphs with Bounded Pathwidth} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Therese Biedl and Martin Derka. 1-String B_2-VPG Representation of Planar Graphs. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 141-155, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{biedl_et_al:LIPIcs.SOCG.2015.141, author = {Biedl, Therese and Derka, Martin}, title = {{1-String B\underline2-VPG Representation of Planar Graphs}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {141--155}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.141}, URN = {urn:nbn:de:0030-drops-51323}, doi = {10.4230/LIPIcs.SOCG.2015.141}, annote = {Keywords: Graph drawing, string graphs, VPG graphs, planar graphs} }
Feedback for Dagstuhl Publishing