<h2>LIPIcs, Volume 233, SEA 2022</h2>
<ul>
<li>
<span class="authors">Christian Schulz and Bora Uçar</span>
<span class="title">LIPIcs, Volume 233, SEA 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022">10.4230/LIPIcs.SEA.2022</a>
</li>
<li>
<span class="authors">Christian Schulz and Bora Uçar</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.0">10.4230/LIPIcs.SEA.2022.0</a>
</li>
<li>
<span class="authors">Dorota Celińska-Kopczyńska and Eryk Kopczyński</span>
<span class="title">Discrete Hyperbolic Random Graph Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.1">10.4230/LIPIcs.SEA.2022.1</a>
</li>
<li>
<span class="authors">Masakazu Ishihata and Fumiya Tokumasu</span>
<span class="title">Solving and Generating Nagareru Puzzles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.2">10.4230/LIPIcs.SEA.2022.2</a>
</li>
<li>
<span class="authors">Tim Zeitz</span>
<span class="title">Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.3">10.4230/LIPIcs.SEA.2022.3</a>
</li>
<li>
<span class="authors">Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, and Stefan Walzer</span>
<span class="title">Fast Succinct Retrieval and Approximate Membership Using Ribbon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.4">10.4230/LIPIcs.SEA.2022.4</a>
</li>
<li>
<span class="authors">Lars Gottesbüren, Tobias Heuer, and Peter Sanders</span>
<span class="title">Parallel Flow-Based Hypergraph Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.5">10.4230/LIPIcs.SEA.2022.5</a>
</li>
<li>
<span class="authors">Darko Drakulic, Christelle Loiodice, and Vassilissa Lehoux</span>
<span class="title">Routing in Multimodal Transportation Networks with Non-Scheduled Lines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.6">10.4230/LIPIcs.SEA.2022.6</a>
</li>
<li>
<span class="authors">Maria J. Blesa, Mihail Eduard Popa, and Maria Serna</span>
<span class="title">Relating Real and Synthetic Social Networks Through Centrality Measures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.7">10.4230/LIPIcs.SEA.2022.7</a>
</li>
<li>
<span class="authors">Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, and Manuel Penschuck</span>
<span class="title">Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.8">10.4230/LIPIcs.SEA.2022.8</a>
</li>
<li>
<span class="authors">Ramtin Afshar, Michael T. Goodrich, and Evrim Ozel</span>
<span class="title">Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.9">10.4230/LIPIcs.SEA.2022.9</a>
</li>
<li>
<span class="authors">Nico Bertram, Jonas Ellert, and Johannes Fischer</span>
<span class="title">A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.10">10.4230/LIPIcs.SEA.2022.10</a>
</li>
<li>
<span class="authors">Alexander van der Grinten, Maria Predari, and Florian Willich</span>
<span class="title">A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.11">10.4230/LIPIcs.SEA.2022.11</a>
</li>
<li>
<span class="authors">Kenneth Langedal, Johannes Langguth, Fredrik Manne, and Daniel Thilo Schroeder</span>
<span class="title">Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.12">10.4230/LIPIcs.SEA.2022.12</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, and Marcus Wilhelm</span>
<span class="title">A Branch-And-Bound Algorithm for Cluster Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.13">10.4230/LIPIcs.SEA.2022.13</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, and Stavros D. Nikolopoulos</span>
<span class="title">An Experimental Study of Algorithms for Packing Arborescences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.14">10.4230/LIPIcs.SEA.2022.14</a>
</li>
<li>
<span class="authors">Payas Rajan and Chinya V. Ravishankar</span>
<span class="title">Stochastic Route Planning for Electric Vehicles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.15">10.4230/LIPIcs.SEA.2022.15</a>
</li>
<li>
<span class="authors">Nathaniel K. Brown, Travis Gagie, and Massimiliano Rossi</span>
<span class="title">RLBWT Tricks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.16">10.4230/LIPIcs.SEA.2022.16</a>
</li>
<li>
<span class="authors">Hisao Tamaki</span>
<span class="title">Heuristic Computation of Exact Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.17">10.4230/LIPIcs.SEA.2022.17</a>
</li>
<li>
<span class="authors">Vasily Alferov and Mateus de Oliveira Oliveira</span>
<span class="title">On the Satisfiability of Smooth Grid CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.18">10.4230/LIPIcs.SEA.2022.18</a>
</li>
<li>
<span class="authors">Renee Mirka and David P. Williamson</span>
<span class="title">An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.19">10.4230/LIPIcs.SEA.2022.19</a>
</li>
<li>
<span class="authors">Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, and Gianpiero Monaco</span>
<span class="title">Digraph k-Coloring Games: From Theory to Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.20">10.4230/LIPIcs.SEA.2022.20</a>
</li>
<li>
<span class="authors">Leo Liberti, Benedetto Manca, and Pierre-Louis Poirion</span>
<span class="title">Practical Performance of Random Projections in Linear Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.21">10.4230/LIPIcs.SEA.2022.21</a>
</li>
<li>
<span class="authors">Sara Giuliani, Giuseppe Romana, and Massimiliano Rossi</span>
<span class="title">Computing Maximal Unique Matches with the r-Index</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.22">10.4230/LIPIcs.SEA.2022.22</a>
</li>
<li>
<span class="authors">Meenarli Sharma and Ashutosh Mahajan</span>
<span class="title">Automatic Reformulations for Convex Mixed-Integer Nonlinear Optimization: Perspective and Separability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.23">10.4230/LIPIcs.SEA.2022.23</a>
</li>
<li>
<span class="authors">Akshay Gupte, Arie M. C. A. Koster, and Sascha Kuhnke</span>
<span class="title">An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2022.24">10.4230/LIPIcs.SEA.2022.24</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
Feedback for Dagstuhl Publishing