@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing