HTML Export for SAND 2023

Copy to Clipboard Download

<h2>LIPIcs, Volume 257, SAND 2023</h2>
<ul>
<li>
    <span class="authors">David Doty and Paul Spirakis</span>
    <span class="title">LIPIcs, Volume 257, SAND 2023, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023">10.4230/LIPIcs.SAND.2023</a>
</li>
<li>
    <span class="authors">David Doty and Paul Spirakis</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.0">10.4230/LIPIcs.SAND.2023.0</a>
</li>
<li>
    <span class="authors">Allen Ibiapina and Ana Silva</span>
    <span class="title">Snapshot Disjointness in Temporal Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.1">10.4230/LIPIcs.SAND.2023.1</a>
</li>
<li>
    <span class="authors">Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, and Yonghwan Kim</span>
    <span class="title">Partial Gathering of Mobile Agents in Dynamic Tori</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.2">10.4230/LIPIcs.SAND.2023.2</a>
</li>
<li>
    <span class="authors">Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, and Isabella Ziccardi</span>
    <span class="title">Bond Percolation in Small-World Graphs with Power-Law Distribution</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.3">10.4230/LIPIcs.SAND.2023.3</a>
</li>
<li>
    <span class="authors">Filippo Brunelli and Laurent Viennot</span>
    <span class="title">Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.4">10.4230/LIPIcs.SAND.2023.4</a>
</li>
<li>
    <span class="authors">Joshua Ani, Michael Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan Hendrickson, and Jayson Lynch</span>
    <span class="title">Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.5">10.4230/LIPIcs.SAND.2023.5</a>
</li>
<li>
    <span class="authors">Shunhao Oh, Dana Randall, and Andréa W. Richa</span>
    <span class="title">Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.6">10.4230/LIPIcs.SAND.2023.6</a>
</li>
<li>
    <span class="authors">Swan Dubois, Laurent Feuilloley, Franck Petit, and Mikaël Rabie</span>
    <span class="title">When Should You Wait Before Updating? - Toward a Robustness Refinement</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.7">10.4230/LIPIcs.SAND.2023.7</a>
</li>
<li>
    <span class="authors">Vincent Bridonneau, Frédéric Guinand, and Yoann Pigné</span>
    <span class="title">Dynamic Graphs Generators Analysis: An Illustrative Case Study</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.8">10.4230/LIPIcs.SAND.2023.8</a>
</li>
<li>
    <span class="authors">Jan Boeckmann, Clemens Thielen, and Alina Wittmann</span>
    <span class="title">Complexity of the Temporal Shortest Path Interdiction Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.9">10.4230/LIPIcs.SAND.2023.9</a>
</li>
<li>
    <span class="authors">Bernard Chazelle and Kritkorn Karntikoon</span>
    <span class="title">A Connectivity-Sensitive Approach to Consensus Dynamics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.10">10.4230/LIPIcs.SAND.2023.10</a>
</li>
<li>
    <span class="authors">Johanne Cohen, Laurence Pilard, Mikaël Rabie, and Jonas Sénizergues</span>
    <span class="title">Making Self-Stabilizing Algorithms for Any Locally Greedy Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.11">10.4230/LIPIcs.SAND.2023.11</a>
</li>
<li>
    <span class="authors">Robert M. Alaniz, David Caballero, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert Schweller, and Tim Wylie</span>
    <span class="title">Covert Computation in the Abstract Tile-Assembly Model</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.12">10.4230/LIPIcs.SAND.2023.12</a>
</li>
<li>
    <span class="authors">Thomas Bellitto, Cyril Conchon-Kerjan, and Bruno Escoffier</span>
    <span class="title">Restless Exploration of Periodic Temporal Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.13">10.4230/LIPIcs.SAND.2023.13</a>
</li>
<li>
    <span class="authors">Markus Chimani and Niklas Troost</span>
    <span class="title">Multistage Shortest Path: Instances and Practical Evaluation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SAND.2023.14">10.4230/LIPIcs.SAND.2023.14</a>
</li>
</ul>

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