Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, and Falk Schreiber. GraphTrials: Visual Proofs of Graph Properties. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{forster_et_al:LIPIcs.GD.2024.16, author = {F\"{o}rster, Henry and Klesen, Felix and Dwyer, Tim and Eades, Peter and Hong, Seok-Hee and Kobourov, Stephen G. and Liotta, Giuseppe and Misue, Kazuo and Montecchiani, Fabrizio and Pastukhov, Alexander and Schreiber, Falk}, title = {{GraphTrials: Visual Proofs of Graph Properties}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {16:1--16:18}, 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.16}, URN = {urn:nbn:de:0030-drops-213005}, doi = {10.4230/LIPIcs.GD.2024.16}, annote = {Keywords: Graph Visualization, Theory of Visualization, Visual Proof} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Gavin J. Mooney, Helen C. Purchase, Michael Wybrow, Stephen G. Kobourov, and Jacob Miller. The Perception of Stress in Graph Drawings. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 21:1-21:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{mooney_et_al:LIPIcs.GD.2024.21, author = {Mooney, Gavin J. and Purchase, Helen C. and Wybrow, Michael and Kobourov, Stephen G. and Miller, Jacob}, title = {{The Perception of Stress in Graph Drawings}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {21:1--21:17}, 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.21}, URN = {urn:nbn:de:0030-drops-213051}, doi = {10.4230/LIPIcs.GD.2024.21}, annote = {Keywords: Stress, Graph Drawing, Visual Perception} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, and Alexander Wolff. Multi-Level Steiner Trees. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 15:1-15:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ahmed_et_al:LIPIcs.SEA.2018.15, author = {Ahmed, Reyan and Angelini, Patrizio and Sahneh, Faryad Darabi and Efrat, Alon and Glickenstein, David and Gronemann, Martin and Heinsohn, Niklas and Kobourov, Stephen G. and Spence, Richard and Watkins, Joseph and Wolff, Alexander}, title = {{Multi-Level Steiner Trees}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {15:1--15:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.15}, URN = {urn:nbn:de:0030-drops-89506}, doi = {10.4230/LIPIcs.SEA.2018.15}, annote = {Keywords: Approximation algorithm, Steiner tree, multi-level graph representation} }
Published in: Dagstuhl Reports, Volume 6, Issue 11 (2017)
Sok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, and János Pach. Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452). In Dagstuhl Reports, Volume 6, Issue 11, pp. 35-62, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Article{hong_et_al:DagRep.6.11.35, author = {Hong, Sok-Hee and Kaufmann, Michael and Kobourov, Stephen G. and Pach, J\'{a}nos}, title = {{Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452)}}, pages = {35--62}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2017}, volume = {6}, number = {11}, editor = {Hong, Sok-Hee and Kaufmann, Michael and Kobourov, Stephen G. and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.35}, URN = {urn:nbn:de:0030-drops-70385}, doi = {10.4230/DagRep.6.11.35}, annote = {Keywords: graph drawing, graph algorithms, graph theory, geometric algorithms, combinatorial geometry, visualization} }
Published in: Dagstuhl Reports, Volume 3, Issue 4 (2013)
Stephen G. Kobourov, Martin Nöllenburg, and Monique Teillaud. Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151). In Dagstuhl Reports, Volume 3, Issue 4, pp. 34-68, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{kobourov_et_al:DagRep.3.4.34, author = {Kobourov, Stephen G. and N\"{o}llenburg, Martin and Teillaud, Monique}, title = {{Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151)}}, pages = {34--68}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {4}, editor = {Kobourov, Stephen G. and N\"{o}llenburg, Martin and Teillaud, Monique}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.4.34}, URN = {urn:nbn:de:0030-drops-41680}, doi = {10.4230/DagRep.3.4.34}, annote = {Keywords: graph drawing, information visualization, computational cartography, computational geometry} }
Published in: Dagstuhl Seminar Proceedings, Volume 5361, Algorithmic Aspects of Large and Complex Networks (2006)
Stephen G. Kobourov, Alon Efrat, David Forrester, and Anand Iyer. Force-Directed Approaches to Sensor Network Localization. In Algorithmic Aspects of Large and Complex Networks. Dagstuhl Seminar Proceedings, Volume 5361, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{kobourov_et_al:DagSemProc.05361.7, author = {Kobourov, Stephen G. and Efrat, Alon and Forrester, David and Iyer, Anand}, title = {{Force-Directed Approaches to Sensor Network Localization}}, booktitle = {Algorithmic Aspects of Large and Complex Networks}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5361}, editor = {Stefano Leonardi and Friedhelm Meyer auf der Heide and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05361.7}, URN = {urn:nbn:de:0030-drops-5693}, doi = {10.4230/DagSemProc.05361.7}, annote = {Keywords: Sensor network localization, multi-scale force-directed approach, dead reckoning} }
Published in: Dagstuhl Reports, Volume 13, Issue 1 (2023)
Karsten Klein, Stephen Kobourov, Bernice E. Rogowitz, Danielle Szafir, and Jacob Miller. Perception in Network Visualization (Dagstuhl Seminar 23051). In Dagstuhl Reports, Volume 13, Issue 1, pp. 216-244, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{klein_et_al:DagRep.13.1.216, author = {Klein, Karsten and Kobourov, Stephen and Rogowitz, Bernice E. and Szafir, Danielle and Miller, Jacob}, title = {{Perception in Network Visualization (Dagstuhl Seminar 23051)}}, pages = {216--244}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {13}, number = {1}, editor = {Klein, Karsten and Kobourov, Stephen and Rogowitz, Bernice E. and Szafir, Danielle and Miller, Jacob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.1.216}, URN = {urn:nbn:de:0030-drops-191220}, doi = {10.4230/DagRep.13.1.216}, annote = {Keywords: Network Visualization, Graph Drawing, Perception, Cognition} }
Published in: Dagstuhl Reports, Volume 11, Issue 3 (2021)
Katy Börner and Stephen Kobourov. Multi-Level Graph Representation for Big Data Arising in Science Mapping (Dagstuhl Seminar 21152). In Dagstuhl Reports, Volume 11, Issue 3, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{borner_et_al:DagRep.11.3.1, author = {B\"{o}rner, Katy and Kobourov, Stephen}, title = {{Multi-Level Graph Representation for Big Data Arising in Science Mapping (Dagstuhl Seminar 21152)}}, pages = {1--15}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2021}, volume = {11}, number = {3}, editor = {B\"{o}rner, Katy and Kobourov, Stephen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.3.1}, URN = {urn:nbn:de:0030-drops-146885}, doi = {10.4230/DagRep.11.3.1}, annote = {Keywords: graph theory, graph algorithms, science of science, cartography and map-like representations, network visualization, multi-level semantic zooming} }
Published in: LIPIcs, Volume 190, 19th International Symposium on Experimental Algorithms (SEA 2021)
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence. Multi-Level Weighted Additive Spanners. In 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 190, pp. 16:1-16:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ahmed_et_al:LIPIcs.SEA.2021.16, author = {Ahmed, Reyan and Bodwin, Greg and Sahneh, Faryad Darabi and Hamm, Keaton and Kobourov, Stephen and Spence, Richard}, title = {{Multi-Level Weighted Additive Spanners}}, booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)}, pages = {16:1--16:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-185-6}, ISSN = {1868-8969}, year = {2021}, volume = {190}, editor = {Coudert, David and Natale, Emanuele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.16}, URN = {urn:nbn:de:0030-drops-137885}, doi = {10.4230/LIPIcs.SEA.2021.16}, annote = {Keywords: multi-level, graph spanner, approximation algorithms} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence. Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 4:1-4:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ahmed_et_al:LIPIcs.ESA.2020.4, author = {Ahmed, Reyan and Sahneh, Faryad Darabi and Hamm, Keaton and Kobourov, Stephen and Spence, Richard}, title = {{Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {4:1--4:21}, 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.4}, URN = {urn:nbn:de:0030-drops-128709}, doi = {10.4230/LIPIcs.ESA.2020.4}, annote = {Keywords: multi-level, Steiner tree, approximation algorithms} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Esther M. Arkin, Faryad Darabi Sahneh, Alon Efrat, Fabian Frank, Radoslav Fulek, Stephen Kobourov, and Joseph S. B. Mitchell. Computing β-Stretch Paths in Drawings of Graphs. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 7:1-7:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{arkin_et_al:LIPIcs.SWAT.2020.7, author = {Arkin, Esther M. and Sahneh, Faryad Darabi and Efrat, Alon and Frank, Fabian and Fulek, Radoslav and Kobourov, Stephen and Mitchell, Joseph S. B.}, title = {{Computing \beta-Stretch Paths in Drawings of Graphs}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {7:1--7:20}, 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.7}, URN = {urn:nbn:de:0030-drops-122540}, doi = {10.4230/LIPIcs.SWAT.2020.7}, annote = {Keywords: stretch factor, dilation, geometric spanners} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen Kobourov, Pedro Matias, and Valentin Polishchuk. New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 51:1-51:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{mamano_et_al:LIPIcs.ISAAC.2019.51, author = {Mamano, Nil and Efrat, Alon and Eppstein, David and Frishberg, Daniel and Goodrich, Michael T. and Kobourov, Stephen and Matias, Pedro and Polishchuk, Valentin}, title = {{New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {51:1--51:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.51}, URN = {urn:nbn:de:0030-drops-115477}, doi = {10.4230/LIPIcs.ISAAC.2019.51}, annote = {Keywords: Nearest-neighbors, Nearest-neighbor chain, motorcycle graph, straight skeleton, multi-fragment algorithm, Euclidean TSP, Steiner TSP} }
Published in: Dagstuhl Reports, Volume 2, Issue 6 (2012)
Stephen Kobourov, Alexander Wolff, and Frank van Ham. Putting Data on the Map (Dagstuhl Seminar 12261). In Dagstuhl Reports, Volume 2, Issue 6, pp. 51-76, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@Article{kobourov_et_al:DagRep.2.6.51, author = {Kobourov, Stephen and Wolff, Alexander and van Ham, Frank}, title = {{Putting Data on the Map (Dagstuhl Seminar 12261)}}, pages = {51--76}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2012}, volume = {2}, number = {6}, editor = {Kobourov, Stephen and Wolff, Alexander and van Ham, Frank}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.6.51}, URN = {urn:nbn:de:0030-drops-37303}, doi = {10.4230/DagRep.2.6.51}, annote = {Keywords: Information Visualization, Cartography, GIScience, Computational Geometry, Graph Drawing, Cognition} }
Published in: Dagstuhl Reports, Volume 1, Issue 5 (2011)
Camil Demetrescu, Michael Kaufmann, Stephen Kobourov, and Petra Mutzel. Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). In Dagstuhl Reports, Volume 1, Issue 5, pp. 47-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@Article{demetrescu_et_al:DagRep.1.5.47, author = {Demetrescu, Camil and Kaufmann, Michael and Kobourov, Stephen and Mutzel, Petra}, title = {{Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191)}}, pages = {47--60}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2011}, volume = {1}, number = {5}, editor = {Demetrescu, Camil and Kaufmann, Michael and Kobourov, Stephen and Mutzel, Petra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.47}, URN = {urn:nbn:de:0030-drops-32046}, doi = {10.4230/DagRep.1.5.47}, annote = {Keywords: Algorithm Engineering, Graph Drawing} }
Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)
Stephen Borgatti, Stephen Kobourov, Oliver Kohlbacher, and Petra Mutzel. 08191 Abstracts Collection – Graph Drawing with Applications to Bioinformatics and Social Sciences. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{borgatti_et_al:DagSemProc.08191.1, author = {Borgatti, Stephen and Kobourov, Stephen and Kohlbacher, Oliver and Mutzel, Petra}, title = {{08191 Abstracts Collection – Graph Drawing with Applications to Bioinformatics and Social Sciences}}, booktitle = {Graph Drawing with Applications to Bioinformatics and Social Sciences}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8191}, editor = {Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.1}, URN = {urn:nbn:de:0030-drops-15547}, doi = {10.4230/DagSemProc.08191.1}, annote = {Keywords: Graph drawing, visualization, social sciences, bioinformatics} }
Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)
Stephen Borgatti, Stephen Kobourov, Oliver Kohlbacher, and Petra Mutzel. 08191 Executive Summary – Graph Drawing with Applications to Bioinformatics and Social Sciences. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{borgatti_et_al:DagSemProc.08191.2, author = {Borgatti, Stephen and Kobourov, Stephen and Kohlbacher, Oliver and Mutzel, Petra}, title = {{08191 Executive Summary – Graph Drawing with Applications to Bioinformatics and Social Sciences}}, booktitle = {Graph Drawing with Applications to Bioinformatics and Social Sciences}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8191}, editor = {Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.2}, URN = {urn:nbn:de:0030-drops-15523}, doi = {10.4230/DagSemProc.08191.2}, annote = {Keywords: Graph drawing, visualization, social sciences, bioinformatics} }
Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)
Stephen Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen Kobourov, Anna Lubiw, and Dorothea Wagner. 08191 Working Group Report – Visualization of Trajectories. In Graph Drawing with Applications to Bioinformatics and Social Sciences. Dagstuhl Seminar Proceedings, Volume 8191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{borgatti_et_al:DagSemProc.08191.4, author = {Borgatti, Stephen and Brandes, Ulrik and Kaufmann, Michael and Kobourov, Stephen and Lubiw, Anna and Wagner, Dorothea}, title = {{08191 Working Group Report – Visualization of Trajectories}}, booktitle = {Graph Drawing with Applications to Bioinformatics and Social Sciences}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8191}, editor = {Stephen P. Borgatti and Stephen Kobourov and Oliver Kohlbacher and Petra Mutzel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08191.4}, URN = {urn:nbn:de:0030-drops-15558}, doi = {10.4230/DagSemProc.08191.4}, annote = {Keywords: Graph drawing, trajectories, paths} }
Published in: Dagstuhl Seminar Proceedings, Volume 5191, Graph Drawing (2006)
Michael Jünger, Petra Mutzel, and Stephen Kobourov. 05191 Abstracts Collection – Graph Drawing. In Graph Drawing. Dagstuhl Seminar Proceedings, Volume 5191, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{junger_et_al:DagSemProc.05191.1, author = {J\"{u}nger, Michael and Mutzel, Petra and Kobourov, Stephen}, title = {{05191 Abstracts Collection – Graph Drawing}}, booktitle = {Graph Drawing}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5191}, editor = {Michael J\"{u}nger and Stephen Kobourov and Petra Mutzel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05191.1}, URN = {urn:nbn:de:0030-drops-3485}, doi = {10.4230/DagSemProc.05191.1}, annote = {Keywords: Graph Drawing, Visualization, Layout Algorithms, Interactive Visualization} }
Published in: Dagstuhl Seminar Proceedings, Volume 5191, Graph Drawing (2006)
Michael Jünger, Stephen Kobourov, and Petra Mutzel. 05191 Executive Summary – Graph Drawing. In Graph Drawing. Dagstuhl Seminar Proceedings, Volume 5191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{junger_et_al:DagSemProc.05191.2, author = {J\"{u}nger, Michael and Kobourov, Stephen and Mutzel, Petra}, title = {{05191 Executive Summary – Graph Drawing}}, booktitle = {Graph Drawing}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5191}, editor = {Michael J\"{u}nger and Stephen Kobourov and Petra Mutzel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05191.2}, URN = {urn:nbn:de:0030-drops-3420}, doi = {10.4230/DagSemProc.05191.2}, annote = {Keywords: Graph drawing} }
Feedback for Dagstuhl Publishing