Issue
Dagstuhl Reports, Volume 11, Issue 3
-
Part of:
Volume:
Dagstuhl Reports, Volume 11
Journal: Dagstuhl Reports (DagRep)
Publication Details
- published at: 2021-09-07
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/dagstuhl-reports/dagstuhl-reports11
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 11, Issue 3, April 2021, Complete Issue
Abstract
Dagstuhl Reports, Volume 11, Issue 3, March 2021, Complete Issue
Cite as
Dagstuhl Reports, Volume 11, Issue 3, pp. 1-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@Article{DagRep.11.3,
title = {{Dagstuhl Reports, Volume 11, Issue 3, April 2021, Complete Issue}},
pages = {1--48},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2021},
volume = {11},
number = {3},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.3},
URN = {urn:nbn:de:0030-drops-146861},
doi = {10.4230/DagRep.11.3},
annote = {Keywords: Dagstuhl Reports, Volume 11, Issue 3, March 2021, Complete Issue}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 11, Issue 3, 2021
Abstract
Dagstuhl Reports, Table of Contents, Volume 11, Issue 3, 2021
Cite as
Dagstuhl Reports, Volume 11, Issue 3, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@Article{DagRep.11.3.i,
title = {{Dagstuhl Reports, Table of Contents, Volume 11, Issue 3, 2021}},
pages = {i--ii},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2021},
volume = {11},
number = {3},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.3.i},
URN = {urn:nbn:de:0030-drops-146870},
doi = {10.4230/DagRep.11.3.i},
annote = {Keywords: Table of Contents, Frontmatter}
}
Document
Multi-Level Graph Representation for Big Data Arising in Science Mapping (Dagstuhl Seminar 21152)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21152 "Multi-Level Graph Representation for Big Data Arising in Science Mapping." The seminar brought together researchers coming from information visualization, psychology, cognitive science, human-computer interaction, graph drawing, computational geometry, and cartography with interests in the "science of science" to discuss novel graph mining and layout algorithms and their application to the development of science mapping standards and services. Due to the pandemic, this was a "hybrid" event with only 5 in-person participants and 25 by-zoom participants from over ten different countries and at least five different time-zones. There were three overview talks and four special presentations (evening webinars) from different communities represented in the seminar. Abstracts of these talks and presentations are collected in this report. Three working groups formed around open research problems related to the seminar topic and we report about their findings.
Cite as
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)
Copy BibTex To Clipboard
@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-dev.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}
}
Document
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 121171 "Temporal Graphs: Structure, Algorithms, Applications". The seminar was organized around four core areas: models, concepts, classes; concrete algorithmic problems; distributed aspects; applications. Because of the ongoing pandemic crisis, the seminar had to be held fully online, with talk and open problems sessions focussing on afternoons. Besides 19 contributed talks and small-group discussions, there were lively open-problem sessions, and some of the problems and research directions proposed there are part of this document. Despite strongly missing the usual Dagstuhl atmosphere and personal interaction possibilities, the seminar helped to establish new contacts and to identify new research directions in a thriving research area between (algorithmic) graph theory and network science.
Cite as
Arnaud Casteigts, Kitty Meeks, George B. Mertzios, and Rolf Niedermeier. Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). In Dagstuhl Reports, Volume 11, Issue 3, pp. 16-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@Article{casteigts_et_al:DagRep.11.3.16,
author = {Casteigts, Arnaud and Meeks, Kitty and Mertzios, George B. and Niedermeier, Rolf},
title = {{Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171)}},
pages = {16--46},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2021},
volume = {11},
number = {3},
editor = {Casteigts, Arnaud and Meeks, Kitty and Mertzios, George B. and Niedermeier, Rolf},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.3.16},
URN = {urn:nbn:de:0030-drops-146892},
doi = {10.4230/DagRep.11.3.16},
annote = {Keywords: algorithm engineering, complex network analysis, distributed computing, models and classes, parameterized complexity analysis}
}