Search Results

Documents authored by Hegemann, Tim

Artifact
Software
DOI: 10.4230/artifacts.22518
Graph Harvester

Authors: Julius Deynet, Tim Hegemann, Sebastian Kempf, and Alexander Wolff

Abstract
Cite as

Julius Deynet, Tim Hegemann, Sebastian Kempf, Alexander Wolff. Graph Harvester (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-22518,
   title = {{Graph Harvester}}, 
   author = {Deynet, Julius and Hegemann, Tim and Kempf, Sebastian and Wolff, Alexander},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:f390ce9e8201cb8d2c97848e8fb5170173dcb82b;origin=https://github.com/JuliusDeynet/graph_harvester;visit=swh:1:snp:bdfe5f02f631232b0713ec89a61137901514f2fc;anchor=swh:1:rev:42f62e576eecab2ab51e79d22bba90bc7aff0496}{\texttt{swh:1:dir:f390ce9e8201cb8d2c97848e8fb5170173dcb82b}} (visited on 2024-11-28)},
   url = {https://github.com/JuliusDeynet/graph_harvester},
   doi = {10.4230/artifacts.22518},
}
Artifact
Software
DOI: 10.4230/artifacts.22519
Publines

Authors: Tim Hegemann and Alexander Wolff

Abstract
Cite as

Tim Hegemann, Alexander Wolff. Publines (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-22519,
   title = {{Publines}}, 
   author = {Hegemann, Tim and Wolff, Alexander},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:8b6a0dd881ed0b7a4b0e5d8dbfa38f82827aa641;origin=https://github.com/hegetim/publines;visit=swh:1:snp:3c1e7e4af669de65e04453c4429a636ff7e3e7db;anchor=swh:1:rev:9271104cbd24e6d51af7e073e6bad0593f8f0e96}{\texttt{swh:1:dir:8b6a0dd881ed0b7a4b0e5d8dbfa38f82827aa641}} (visited on 2024-11-28)},
   url = {https://github.com/hegetim/publines},
   doi = {10.4230/artifacts.22519},
}
Document
DOI: 10.4230/LIPIcs.GD.2024.26
Storylines with a Protagonist

Authors: Tim Hegemann and Alexander Wolff

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

Abstract
Storyline visualizations show interactions between a given set of characters over time. Each character is represented by an x-monotone curve. A meeting is represented by a vertical bar that is crossed by the curves of exactly those characters that participate in the meeting. Therefore, character curves may have to cross each other. In the context of publication networks, we consider storylines where the characters are authors and the meetings are joint publications. We are especially interested in visualizing a group of colleagues centered around an author, the protagonist, who participates in all selected publications. For such instances, we propose a drawing style where the protagonist’s curve is drawn at a prominent position and never crossed by any other author’s curve. We consider two variants of storylines with a protagonist. In the one-sided variant, the protagonist is required to be drawn at the top position. In this restricted setting, we can efficiently compute a drawing with the minimum number of pairwise crossings, whereas we show that it is NP-hard to minimize the number of block crossings (i.e., pairs of blocks of parallel curves that intersect each other). In the two-sided variant, the task is to split the set of co-authors of the protagonist into two groups, and to place the curves of one group above and the curves of the other group below the protagonist’s curve such that the total number of (block) crossings is minimized. As our main result, we present an algorithm for bundling a sequence of pairwise crossings into a sequence of few block crossings (in the absence of meetings). It exploits a connection to a rectangle dissection problem. In the presence of meetings, it yields results that are very close to a lower bound. Based on this bundling algorithm and our exact algorithm for the one-sided variant, we present a new heuristic for computing two-sided storylines with few block crossings. We perform an extensive experimental study using publication data of 81 protagonists from GD 2023 and their most frequent collaborators over the last ten years. Our study shows that, for two-sided storylines with a protagonist, our new heuristic uses fewer block crossings (and fewer pairwise crossings) than two heuristics for block crossing minimization in general storylines.
Cite as

Tim Hegemann and Alexander Wolff. Storylines with a Protagonist. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 26:1-26:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{hegemann_et_al:LIPIcs.GD.2024.26,
  author =	{Hegemann, Tim and Wolff, Alexander},
  title =	{{Storylines with a Protagonist}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{26:1--26:22},
  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.26},
  URN =		{urn:nbn:de:0030-drops-213109},
  doi =		{10.4230/LIPIcs.GD.2024.26},
  annote =	{Keywords: Storyline visualization, storyline with a protagonist, crossing minimization, block crossings}
}
Document
Software Abstract
DOI: 10.4230/LIPIcs.GD.2024.58
Graph Harvester (Software Abstract)

Authors: Julius Deynet, Tim Hegemann, Sebastian Kempf, and Alexander Wolff

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

Abstract
We present Graph Harvester, a website for extracting graphs from illustrations in scientific papers. For every graph that has been extracted, Graph Harvester queries the graph database House of Graphs. If the graph is not already present there, the user can upload the graph into the database, possibly after modifying it, and with a reference to the paper that contains the drawing of the graph.
Cite as

Julius Deynet, Tim Hegemann, Sebastian Kempf, and Alexander Wolff. Graph Harvester (Software Abstract). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 58:1-58:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{deynet_et_al:LIPIcs.GD.2024.58,
  author =	{Deynet, Julius and Hegemann, Tim and Kempf, Sebastian and Wolff, Alexander},
  title =	{{Graph Harvester}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{58:1--58:3},
  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.58},
  URN =		{urn:nbn:de:0030-drops-213427},
  doi =		{10.4230/LIPIcs.GD.2024.58},
  annote =	{Keywords: House of Graphs, Graph recognition, Information extraction}
}
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