Issue

Dagstuhl Reports, Volume 12, Issue 11

Thumbnail PDF

Event

Dagstuhl Seminars 22451, 22452, 22461, 22462, 22471, 22481, 22482

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
DOI: 10.4230/DagRep.12.11
Dagstuhl Reports, Volume 12, Issue 11, November 2022, Complete Issue
Abstract
Dagstuhl Reports, Volume 12, Issue 11, November 2022, Complete Issue
Cite as

Dagstuhl Reports, Volume 12, Issue 11, pp. 1-147, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{DagRep.12.11,
  title =	{{Dagstuhl Reports, Volume 12, Issue 11, November 2022, Complete Issue}},
  pages =	{1--147},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11},
  URN =		{urn:nbn:de:0030-drops-178314},
  doi =		{10.4230/DagRep.12.11},
  annote =	{Keywords: Dagstuhl Reports, Volume 12, Issue 11, November 2022, Complete Issue}
}
Document
Front Matter
DOI: 10.4230/DagRep.12.11.i
Dagstuhl Reports, Table of Contents, Volume 12, Issue 11, 2022
Abstract
Dagstuhl Reports, Table of Contents, Volume 12, Issue 11, 2022
Cite as

Dagstuhl Reports, Volume 12, Issue 11, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{DagRep.12.11.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 12, Issue 11, 2022}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.i},
  URN =		{urn:nbn:de:0030-drops-178324},
  doi =		{10.4230/DagRep.12.11.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
Document
DOI: 10.4230/DagRep.12.11.1
Principles of Contract Languages (Dagstuhl Seminar 22451)

Authors: Dilian Gurov, Reiner Hähnle, Marieke Huisman, Giles Reger, and Christian Lidström

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 22451 "Principles of Contract Languages". At the seminar, participants discussed the fundamental aspects of software contracts. Topics included the format and expressiveness of contracts, their use cases in software development and analysis, and contract composition and decomposition.
Cite as

Dilian Gurov, Reiner Hähnle, Marieke Huisman, Giles Reger, and Christian Lidström. Principles of Contract Languages (Dagstuhl Seminar 22451). In Dagstuhl Reports, Volume 12, Issue 11, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{gurov_et_al:DagRep.12.11.1,
  author =	{Gurov, Dilian and H\"{a}hnle, Reiner and Huisman, Marieke and Reger, Giles and Lidstr\"{o}m, Christian},
  title =	{{Principles of Contract Languages (Dagstuhl Seminar 22451)}},
  pages =	{1--27},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  editor =	{Gurov, Dilian and H\"{a}hnle, Reiner and Huisman, Marieke and Reger, Giles and Lidstr\"{o}m, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.1},
  URN =		{urn:nbn:de:0030-drops-178334},
  doi =		{10.4230/DagRep.12.11.1},
  annote =	{Keywords: software contracts, program specifications, software development, program analysis}
}
Document
DOI: 10.4230/DagRep.12.11.28
Computational Social Dynamics (Dagstuhl Seminar 22452)

Authors: Martin Hoefer, Sigal Oren, Roger Wattenhofer, and Giovanna Varricchio

Abstract
This report documents the program and outcomes of Dagstuhl Seminar 22452 "Computational Social Dynamics". The seminar addressed social and dynamic problems in the field of algorithmic game theory, and their implications in numerous applications, such as fair division, financial networks, or behavioral game theory. We summarize organizational aspects of the seminar, the talk abstracts, and the problems that were discussed in the open problem sessions.
Cite as

Martin Hoefer, Sigal Oren, Roger Wattenhofer, and Giovanna Varricchio. Computational Social Dynamics (Dagstuhl Seminar 22452). In Dagstuhl Reports, Volume 12, Issue 11, pp. 28-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{hoefer_et_al:DagRep.12.11.28,
  author =	{Hoefer, Martin and Oren, Sigal and Wattenhofer, Roger and Varricchio, Giovanna},
  title =	{{Computational Social Dynamics (Dagstuhl Seminar 22452)}},
  pages =	{28--44},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  editor =	{Hoefer, Martin and Oren, Sigal and Wattenhofer, Roger and Varricchio, Giovanna},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.28},
  URN =		{urn:nbn:de:0030-drops-178346},
  doi =		{10.4230/DagRep.12.11.28},
  annote =	{Keywords: algorithmic game theory, behavioral economics, fair division, financial networks, social networks}
}
Document
DOI: 10.4230/DagRep.12.11.45
Dynamic Graph Algorithms (Dagstuhl Seminar 22461)

Authors: Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, and Nicole Wein

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 22461 “Dynamic Graph Algorithms”, which took place from November 13 to November 18, 2022. The field of dynamic graph algorithms studies algorithms for processing graphs that are changing over time. Formally, the goal is to process an interleaved sequence of update and query operations, where an update operation changes the input graph (e.g. inserts/deletes an edge), while the query operation is problem-specific and asks for some information about the current graph – for example, an s-t path, or a minimum spanning tree. The field has evolved rapidly over the past decade, and this Dagstuhl Seminar brought together leading researchers in dynamic algorithms and related areas of graph algorithms.
Cite as

Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, and Nicole Wein. Dynamic Graph Algorithms (Dagstuhl Seminar 22461). In Dagstuhl Reports, Volume 12, Issue 11, pp. 45-65, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{bernstein_et_al:DagRep.12.11.45,
  author =	{Bernstein, Aaron and Chechik, Shiri and Forster, Sebastian and Kopelowitz, Tsvi and Nazari, Yasamin and Wein, Nicole},
  title =	{{Dynamic Graph Algorithms (Dagstuhl Seminar 22461)}},
  pages =	{45--65},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  editor =	{Bernstein, Aaron and Chechik, Shiri and Forster, Sebastian and Kopelowitz, Tsvi and Nazari, Yasamin and Wein, Nicole},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.45},
  URN =		{urn:nbn:de:0030-drops-178354},
  doi =		{10.4230/DagRep.12.11.45},
  annote =	{Keywords: dynamic graphs, graph algorithms}
}
Document
DOI: 10.4230/DagRep.12.11.66
Set Visualization and Uncertainty (Dagstuhl Seminar 22462)

Authors: Susanne Bleisch, Steven Chaplick, Jan-Henrik Haunert, Eva Mayr, Marc van Kreveld, and Annika Bonerath

Abstract
The Dagstuhl Seminar on Set Visualization and Uncertainty brought together a group of researchers from diverse disciplines, all of which are interested in various aspects of this type of visualization: the cognitive aspects, the modelling aspects, the algorithmic aspects, and the information visualization aspects. An important but difficult to handle problem is how one should visualize information with underlying uncertainty. The seminar focused on uncertainty in set systems. This report includes short abstracts of the talks given during the seminar as well as more extensive working group reports on the research done during the seminar.
Cite as

Susanne Bleisch, Steven Chaplick, Jan-Henrik Haunert, Eva Mayr, Marc van Kreveld, and Annika Bonerath. Set Visualization and Uncertainty (Dagstuhl Seminar 22462). In Dagstuhl Reports, Volume 12, Issue 11, pp. 66-95, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{bleisch_et_al:DagRep.12.11.66,
  author =	{Bleisch, Susanne and Chaplick, Steven and Haunert, Jan-Henrik and Mayr, Eva and van Kreveld, Marc and Bonerath, Annika},
  title =	{{Set Visualization and Uncertainty (Dagstuhl Seminar 22462)}},
  pages =	{66--95},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  editor =	{Bleisch, Susanne and Chaplick, Steven and Haunert, Jan-Henrik and Mayr, Eva and van Kreveld, Marc and Bonerath, Annika},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.66},
  URN =		{urn:nbn:de:0030-drops-178360},
  doi =		{10.4230/DagRep.12.11.66},
  annote =	{Keywords: cartography, graph drawing, information visualization, set visualization, uncertainty}
}
Document
DOI: 10.4230/DagRep.12.11.96
Towards More Flexible and Automated Communication Networks (Dagstuhl Seminar 22471)

Authors: Artur Hecker, Stefan Schmid, Henning Schulzrinne, Lily Hügerich, Sándor Laki, and Iosif Salem

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 22471 "Towards More Flexible and Automated Communication Networks". Communication network are becoming more and more automated, allowing to overcome human configuration errors (a frequent reason for outages) and enabling a more fine-grained control, potentially improving also efficiency. For example, the percentage of employees of Telecom companies "really touching the network" is decreasing. The goal of this seminar was to bring together experts in the field to identify and discuss the key challenges in making communication networks more autonomous. To this end, the seminar was structured around a small number of enlightning keynote talks, leaving significant time for breakout sessions and discussions, as well as socializing.
Cite as

Artur Hecker, Stefan Schmid, Henning Schulzrinne, Lily Hügerich, Sándor Laki, and Iosif Salem. Towards More Flexible and Automated Communication Networks (Dagstuhl Seminar 22471). In Dagstuhl Reports, Volume 12, Issue 11, pp. 96-108, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{hecker_et_al:DagRep.12.11.96,
  author =	{Hecker, Artur and Schmid, Stefan and Schulzrinne, Henning and H\"{u}gerich, Lily and Laki, S\'{a}ndor and Salem, Iosif},
  title =	{{Towards More Flexible and Automated Communication Networks (Dagstuhl Seminar 22471)}},
  pages =	{96--108},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  editor =	{Hecker, Artur and Schmid, Stefan and Schulzrinne, Henning and H\"{u}gerich, Lily and Laki, S\'{a}ndor and Salem, Iosif},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.96},
  URN =		{urn:nbn:de:0030-drops-178379},
  doi =		{10.4230/DagRep.12.11.96},
  annote =	{Keywords: networking, communication technologies, automation, programmability, flexibility}
}
Document
DOI: 10.4230/DagRep.12.11.109
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)

Authors: Maria Chudnovsky, Neeldhara Misra, Daniel Paulusma, Oliver Schaudt, and Akanksha Agrawal

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 22481 "Vertex Partitioning in Graphs: From Structure to Algorithms", which was held from 27 November to 2 December 2023. The report contains abstracts for presentations about recent structural and algorithmic developments for a variety of vertex partitioning problems. It also contains a collection of open problems which were posed during the seminar.
Cite as

Maria Chudnovsky, Neeldhara Misra, Daniel Paulusma, Oliver Schaudt, and Akanksha Agrawal. Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). In Dagstuhl Reports, Volume 12, Issue 11, pp. 109-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{chudnovsky_et_al:DagRep.12.11.109,
  author =	{Chudnovsky, Maria and Misra, Neeldhara and Paulusma, Daniel and Schaudt, Oliver and Agrawal, Akanksha},
  title =	{{Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)}},
  pages =	{109--123},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  editor =	{Chudnovsky, Maria and Misra, Neeldhara and Paulusma, Daniel and Schaudt, Oliver and Agrawal, Akanksha},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.109},
  URN =		{urn:nbn:de:0030-drops-178384},
  doi =		{10.4230/DagRep.12.11.109},
  annote =	{Keywords: computational complexity, hereditary graph classes, parameterized algorithms, polynomial-time algorithms, vertex partitioning}
}
Document
DOI: 10.4230/DagRep.12.11.124
Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)

Authors: Holger Dell, Mark R. Jerrum, Haiko Müller, Konrad Anand, and Marcus Pappik

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 22482 "Counting and Sampling: Algorithms and Complexity". We document the talks presented, covering many advances in the area made over the last five years. As well, we document the progress made by working groups on future projects.
Cite as

Holger Dell, Mark R. Jerrum, Haiko Müller, Konrad Anand, and Marcus Pappik. Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). In Dagstuhl Reports, Volume 12, Issue 11, pp. 124-145, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{dell_et_al:DagRep.12.11.124,
  author =	{Dell, Holger and Jerrum, Mark R. and M\"{u}ller, Haiko and Anand, Konrad and Pappik, Marcus},
  title =	{{Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)}},
  pages =	{124--145},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  editor =	{Dell, Holger and Jerrum, Mark R. and M\"{u}ller, Haiko and Anand, Konrad and Pappik, Marcus},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.124},
  URN =		{urn:nbn:de:0030-drops-178394},
  doi =		{10.4230/DagRep.12.11.124},
  annote =	{Keywords: Sampling, Counting, Algorithms, Complexity, Statistical Physics, Phase Transitions, Markov Chains, Graphs, Point Processes}
}

Filters

  • Authors
  • A
  • Agrawal, Akanksha
  • Anand, Konrad
  • B
  • Bernstein, Aaron
  • Bleisch, Susanne
  • Bonerath, Annika
  • C
  • Chaplick, Steven
  • Chechik, Shiri
  • Chudnovsky, Maria
  • D
  • Dell, Holger
  • F
  • Forster, Sebastian
  • G
  • Gurov, Dilian
  • H
  • Hähnle, Reiner
  • Haunert, Jan-Henrik
  • Hecker, Artur
  • Hoefer, Martin
  • Hügerich, Lily
  • Huisman, Marieke
  • J
  • Jerrum, Mark R.
  • K
  • Kopelowitz, Tsvi
  • L
  • Laki, Sándor
  • Lidström, Christian
  • M
  • Mayr, Eva
  • Misra, Neeldhara
  • Müller, Haiko
  • N
  • Nazari, Yasamin
  • O
  • Oren, Sigal
  • P
  • Pappik, Marcus
  • Paulusma, Daniel
  • R
  • Reger, Giles
  • S
  • Salem, Iosif
  • Schaudt, Oliver
  • Schmid, Stefan
  • Schulzrinne, Henning
  • V
  • van Kreveld, Marc
  • Varricchio, Giovanna
  • W
  • Wattenhofer, Roger
  • Wein, Nicole

  • Subjects
  • Human-centered computing
  • Human-centered computing → Visualization
  • Information systems
  • Information systems → Social networks
  • Mathematics of computing
  • Mathematics of computing → Discrete mathematics
  • Mathematics of computing → Graph algorithms
  • Mathematics of computing → Mathematical analysis
  • Mathematics of computing → Probability and statistics
  • Networks
  • Networks → Network algorithms
  • Networks → Network architectures
  • Networks → Network protocols
  • Software and its engineering
  • Software and its engineering
  • Theory of computation
  • Theory of computation
  • Theory of computation → Algorithmic game theory and mechanism design
  • Theory of computation → Computational complexity and cryptography
  • Theory of computation → Design and analysis of algorithms
  • Theory of computation → Dynamic graph algorithms
  • Theory of computation → Problems, reductions and completeness
  • Theory of computation → Program specifications
  • Theory of computation → Randomness, geometry and discrete structures
  • Theory of computation → Theory and algorithms for application domains
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 Imprint Privacy Contact