Volume

Dagstuhl Seminar Proceedings, Volume 5191

Publication Details

  • published at: 2006-01-09
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
DOI: 10.4230/DagSemProc.05191.1
05191 Abstracts Collection – Graph Drawing

Authors: Michael Jünger, Petra Mutzel, and Stephen Kobourov

Abstract
From 08.05.05 to 13.05.05, the Dagstuhl Seminar 05191 ``Graph Drawing'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

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)

Copy BibTex To Clipboard

@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}
}
Document
DOI: 10.4230/DagSemProc.05191.2
05191 Executive Summary – Graph Drawing

Authors: Michael Jünger, Stephen Kobourov, and Petra Mutzel

Abstract
This paper summarizes the topics, aims, and achievements of the Dagstuhl Seminar 05191 on Graph Drawing.
Cite as

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)

Copy BibTex To Clipboard

@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}
}
Document
DOI: 10.4230/DagSemProc.05191.3
05191 Open Problem Session Report

Authors: Sue Whitesides

Abstract
This is a report on an informal session intended to stimulate communication and sharing of problems. Hence the attributions and citations may contain inaccuracies, and are certainly not complete.
Cite as

Sue Whitesides. 05191 Open Problem Session Report. In Graph Drawing. Dagstuhl Seminar Proceedings, Volume 5191, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{whitesides:DagSemProc.05191.3,
  author =	{Whitesides, Sue},
  title =	{{05191 Open Problem Session Report}},
  booktitle =	{Graph Drawing},
  pages =	{1--2},
  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.3},
  URN =		{urn:nbn:de:0030-drops-3380},
  doi =		{10.4230/DagSemProc.05191.3},
  annote =	{Keywords: Open problems, graph drawing}
}
Document
DOI: 10.4230/DagSemProc.05191.4
Interactive Visualization of Graph Pyramids

Authors: Andreas Kerren

Abstract
Hierarchies of plane graphs, called graph pyramids, can be used for collecting, storing and analyzing geographical information based on satellite images or other input data. The visualization of graph pyramids facilitates studies about their structure, such as their vertex distribution or height in relation of a specific input image. Thus, a researcher can debug algorithms and ask for statistical information. Furthermore, it improves the better understanding of geographical data, like landscape properties or thematical maps. In this paper, we present an interactive 3D visualization tool that supports several coordinated views on graph pyramids, subpyramids, level graphs, thematical maps, etc. Additionally, some implementation details and application results are discussed.
Cite as

Andreas Kerren. Interactive Visualization of Graph Pyramids. In Graph Drawing. Dagstuhl Seminar Proceedings, Volume 5191, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{kerren:DagSemProc.05191.4,
  author =	{Kerren, Andreas},
  title =	{{Interactive Visualization of Graph Pyramids}},
  booktitle =	{Graph Drawing},
  pages =	{1--11},
  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.4},
  URN =		{urn:nbn:de:0030-drops-3418},
  doi =		{10.4230/DagSemProc.05191.4},
  annote =	{Keywords: Graph Pyramids, Interactive Visualization, Exploration}
}
Document
DOI: 10.4230/DagSemProc.05191.5
On Class Diagrams, Crossings and Metrics

Authors: Holger Eichelberger

Abstract
As a standardized software engineering diagram, the UML class diagram provides various information on the static structure of views on software while design, implementation and maintenance phase. This talk gives an overview on drawing UML class diagrams in hierarchical fashion. Therefore, common elements of class diagrams are introduced and aesthetic rules for drawing UML class diagrams are given. These rules are based on four disciplines involved in the reading process of diagrams. After a brief introduction to our drawing algorithm, an extensive extension of the well-known Sugiyama algorithm, two details are highlighted: A new crossing reduction algorithm is presented and compared to existing ones and issues on measuring the quality of a layout are discussed.
Cite as

Holger Eichelberger. On Class Diagrams, Crossings and Metrics. In Graph Drawing. Dagstuhl Seminar Proceedings, Volume 5191, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{eichelberger:DagSemProc.05191.5,
  author =	{Eichelberger, Holger},
  title =	{{On Class Diagrams, Crossings and Metrics}},
  booktitle =	{Graph Drawing},
  pages =	{1--12},
  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.5},
  URN =		{urn:nbn:de:0030-drops-3395},
  doi =		{10.4230/DagSemProc.05191.5},
  annote =	{Keywords: UML class diagrams, semantic aesthetic principles, hierarchical crossing reduction, layout metrics}
}
Document
DOI: 10.4230/DagSemProc.05191.6
On Layering Directed Acyclic Graphs

Authors: Martin Harrigan and Patrick Healy

Abstract
We consider the problem of layering a directed acyclic graph with minimum dummy nodes. We present a new Integer Linear Programming (ILP) formulation of the problem based on a set of fundamental cycles in the underlying undirected graph and show that it can be solved in polynomial time. We outline some of the advantages of the formulation. Each solution defines a family of layerings with the same number of dummy nodes. We can also transform one solution into another by adding or removing certain combinations of dummy nodes, thus allowing the consideration of other aesthetics.
Cite as

Martin Harrigan and Patrick Healy. On Layering Directed Acyclic Graphs. In Graph Drawing. Dagstuhl Seminar Proceedings, Volume 5191, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{harrigan_et_al:DagSemProc.05191.6,
  author =	{Harrigan, Martin and Healy, Patrick},
  title =	{{On Layering Directed Acyclic Graphs}},
  booktitle =	{Graph Drawing},
  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.6},
  URN =		{urn:nbn:de:0030-drops-3430},
  doi =		{10.4230/DagSemProc.05191.6},
  annote =	{Keywords: Graph Drawing, Hierarchical Drawings, Layerings, Minimum Dummy Nodes}
}
Document
DOI: 10.4230/DagSemProc.05191.7
Setting up a Graph Drawing E-print Archive (GDEA) - a proposal

Authors: Michael Belling

Abstract
E-prints are electronic copies of research output, like pre-prints, journal articles, conference papers, etc. An e-print archive is simply an online repository of such electronic copies. E-print archives promise many benefits for academics. They maximize visibility and accessibility of research. Based on these facts we propose the Graph Drawing E-Print Archive Project (GDEA).
Cite as

Michael Belling. Setting up a Graph Drawing E-print Archive (GDEA) - a proposal. In Graph Drawing. Dagstuhl Seminar Proceedings, Volume 5191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{belling:DagSemProc.05191.7,
  author =	{Belling, Michael},
  title =	{{Setting up a Graph Drawing E-print Archive (GDEA) - a proposal}},
  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.7},
  URN =		{urn:nbn:de:0030-drops-3404},
  doi =		{10.4230/DagSemProc.05191.7},
  annote =	{Keywords: E-print archive, GDEA}
}

Filters

  • Authors
  • B
  • Belling, Michael
  • E
  • Eichelberger, Holger
  • H
  • Harrigan, Martin
  • Healy, Patrick
  • J
  • Jünger, Michael
  • K
  • Kerren, Andreas
  • Kobourov, Stephen
  • M
  • Mutzel, Petra
  • W
  • Whitesides, Sue

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact