Search Results

Documents authored by Dwyer, Tim

Document
DOI: 10.4230/LIPIcs.GD.2024.16
GraphTrials: Visual Proofs of Graph Properties

Authors: 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

Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)

Abstract
Graph and network visualization supports exploration, analysis and communication of relational data arising in many domains: from biological and social networks, to transportation and powergrid systems. With the arrival of AI-based question-answering tools, issues of trustworthiness and explainability of generated answers motivate a greater role for visualization. In the context of graphs, we see the need for visualizations that can convince a critical audience that an assertion about the graph under analysis is valid. The requirements for such representations that convey precisely one specific graph property are quite different from standard network visualization criteria which optimize general aesthetics and readability. In this paper, we aim to provide a comprehensive introduction to visual proofs of graph properties and a foundation for further research in the area. We present a framework that defines what it means to visually prove a graph property. In the process, we introduce the notion of a visual certificate, that is, a specialized faithful graph visualization that leverages the viewer’s perception, in particular, pre-attentive processing (e. g. via pop-out effects), to verify a given assertion about the represented graph. We also discuss the relationships between visual complexity, cognitive load and complexity theory, and propose a classification based on visual proof complexity. Finally, we provide examples of visual certificates for problems in different visual proof complexity classes.
Cite as

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)

Copy BibTex To Clipboard

@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}
}
Document
DOI: 10.4230/DagRep.6.6.1
Immersive Analytics (Dagstuhl Seminar 16231)

Authors: Tim Dwyer, Nathalie Henry Riche, Karsten Klein, Wolfgang Stuerzlinger, and Bruce Thomas

Published in: Dagstuhl Reports, Volume 6, Issue 6 (2016)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 16231 "Immersive Analytics". Close to 40 researchers and practitioners participated in this seminar to discuss and define the field of Immersive Analytics, to create a community around it, and to identify its research challenges. As the participants had a diverse background in a variety of disciplines, including Human-Computer-Interaction, Augmented and Virtual Reality, Information Visualization, and Visual Analytics, the seminar featured a couple of survey talks on the first days, followed by plenary and working group discussions that were meant to shape the field of Immerswive Analytics. As an outcome, a book publication is planned with book chapters provided by the participants.
Cite as

Tim Dwyer, Nathalie Henry Riche, Karsten Klein, Wolfgang Stuerzlinger, and Bruce Thomas. Immersive Analytics (Dagstuhl Seminar 16231). In Dagstuhl Reports, Volume 6, Issue 6, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{dwyer_et_al:DagRep.6.6.1,
  author =	{Dwyer, Tim and Henry Riche, Nathalie and Klein, Karsten and Stuerzlinger, Wolfgang and Thomas, Bruce},
  title =	{{Immersive Analytics (Dagstuhl Seminar 16231)}},
  pages =	{1--9},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{6},
  number =	{6},
  editor =	{Dwyer, Tim and Henry Riche, Nathalie and Klein, Karsten and Stuerzlinger, Wolfgang and Thomas, Bruce},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.6.1},
  URN =		{urn:nbn:de:0030-drops-67249},
  doi =		{10.4230/DagRep.6.6.1},
  annote =	{Keywords: Visual Analytics, Immersion, Human-Computer Interaction, Augmented Reality, Virtual Reality}
}
Document
DOI: 10.4230/DagSemProc.08191.3
08191 Working Group Report – Edge Thresholding

Authors: Patrick Healy and Tim Dwyer

Published in: Dagstuhl Seminar Proceedings, Volume 8191, Graph Drawing with Applications to Bioinformatics and Social Sciences (2008)

Abstract
When working with very large networks it is typical for scientists to present a ``thinned out'' version of the network in order to avoid the clutter of the entire network. For example in the hypothetical case of illustrating trading patterns between groups of nations it might be appropriate to limit the inclusion of inter-nation edges to all those that are significant in terms of their weight but do not, say, associate with a country outside the grouping. Arising from a discussion during one of the introductory sessions we became interested in a problem relating to the discovery of ``key events'' in a network, in terms of an ordered addition of edges to the network.
Cite as

Patrick Healy and Tim Dwyer. 08191 Working Group Report – Edge Thresholding. 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)

Copy BibTex To Clipboard

@InProceedings{healy_et_al:DagSemProc.08191.3,
  author =	{Healy, Patrick and Dwyer, Tim},
  title =	{{08191 Working Group Report – Edge Thresholding}},
  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.3},
  URN =		{urn:nbn:de:0030-drops-15570},
  doi =		{10.4230/DagSemProc.08191.3},
  annote =	{Keywords: Graph drawing, edge thresholding}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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