HTML Export for SEA 2023

Copy to Clipboard Download

<h2>LIPIcs, Volume 265, SEA 2023</h2>
<ul>
<li>
    <span class="authors">Loukas Georgiadis</span>
    <span class="title">LIPIcs, Volume 265, SEA 2023, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023">10.4230/LIPIcs.SEA.2023</a>
</li>
<li>
    <span class="authors">Loukas Georgiadis</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.0">10.4230/LIPIcs.SEA.2023.0</a>
</li>
<li>
    <span class="authors">Markus Anders, Pascal Schweitzer, and Julian Stieß</span>
    <span class="title">Engineering a Preprocessor for Symmetry Detection</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.1">10.4230/LIPIcs.SEA.2023.1</a>
</li>
<li>
    <span class="authors">Giorgos Kritikakis and Ioannis G. Tollis</span>
    <span class="title">Fast Reachability Using DAG Decomposition</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.2">10.4230/LIPIcs.SEA.2023.2</a>
</li>
<li>
    <span class="authors">Thomas Bläsius, Maximilian Katzmann, and Marcus Wilhelm</span>
    <span class="title">Partitioning the Bags of a Tree Decomposition into Cliques</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.3">10.4230/LIPIcs.SEA.2023.3</a>
</li>
<li>
    <span class="authors">Jarno N. Alanko, Elena Biagi, Simon J. Puglisi, and Jaakko Vuohtoniemi</span>
    <span class="title">Subset Wavelet Trees</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.4">10.4230/LIPIcs.SEA.2023.4</a>
</li>
<li>
    <span class="authors">Manuel Penschuck</span>
    <span class="title">Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.5">10.4230/LIPIcs.SEA.2023.5</a>
</li>
<li>
    <span class="authors">Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, and Bojana Kodric</span>
    <span class="title">Proxying Betweenness Centrality Rankings in Temporal Networks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.6">10.4230/LIPIcs.SEA.2023.6</a>
</li>
<li>
    <span class="authors">Diego Díaz-Domínguez, Saska Dönges, Simon J. Puglisi, and Leena Salmela</span>
    <span class="title">Simple Runs-Bounded FM-Index Designs Are Fast</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.7">10.4230/LIPIcs.SEA.2023.7</a>
</li>
<li>
    <span class="authors">Ramtin Afshar, Michael Dillencourt, Michael T. Goodrich, and Evrim Ozel</span>
    <span class="title">Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.8">10.4230/LIPIcs.SEA.2023.8</a>
</li>
<li>
    <span class="authors">Satya Tamby and Daniel Vanderpooten</span>
    <span class="title">Optimizing over the Efficient Set of a Multi-Objective Discrete Optimization Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.9">10.4230/LIPIcs.SEA.2023.9</a>
</li>
<li>
    <span class="authors">Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, and Leo Wendt</span>
    <span class="title">Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.10">10.4230/LIPIcs.SEA.2023.10</a>
</li>
<li>
    <span class="authors">Kengo Nakamura, Masaaki Nishino, Norihito Yasuda, and Shin-ichi Minato</span>
    <span class="title">CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.11">10.4230/LIPIcs.SEA.2023.11</a>
</li>
<li>
    <span class="authors">Miriam Fischer and Akshay Gupte</span>
    <span class="title">Multilinear Formulations for Computing a Nash Equilibrium of Multi-Player Games</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.12">10.4230/LIPIcs.SEA.2023.12</a>
</li>
<li>
    <span class="authors">Ömer Burak Onar, Tınaz Ekim, and Z. Caner Taşkın</span>
    <span class="title">Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.13">10.4230/LIPIcs.SEA.2023.13</a>
</li>
<li>
    <span class="authors">Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, and Nils Morawietz</span>
    <span class="title">A Graph-Theoretic Formulation of Exploratory Blockmodeling</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.14">10.4230/LIPIcs.SEA.2023.14</a>
</li>
<li>
    <span class="authors">Kamal Eyubov, Marcelo Fonseca Faraj, and Christian Schulz</span>
    <span class="title">FREIGHT: Fast Streaming Hypergraph Partitioning</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.15">10.4230/LIPIcs.SEA.2023.15</a>
</li>
<li>
    <span class="authors">Ernestine Großmann, Jonas Sauer, Christian Schulz, and Patrick Steil</span>
    <span class="title">Arc-Flags Meet Trip-Based Public Transit Routing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.16">10.4230/LIPIcs.SEA.2023.16</a>
</li>
<li>
    <span class="authors">Noah Wahl and Lars Gottesbüren</span>
    <span class="title">Greedy Heuristics for Judicious Hypergraph Partitioning</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.17">10.4230/LIPIcs.SEA.2023.17</a>
</li>
<li>
    <span class="authors">Philip Bille, Inge Li Gørtz, Simon J. Puglisi, and Simon R. Tarnow</span>
    <span class="title">Hierarchical Relative Lempel-Ziv Compression</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.18">10.4230/LIPIcs.SEA.2023.18</a>
</li>
<li>
    <span class="authors">Meng He and Zhen Liu</span>
    <span class="title">Exact and Approximate Range Mode Query Data Structures in Practice</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.19">10.4230/LIPIcs.SEA.2023.19</a>
</li>
<li>
    <span class="authors">Daniel Funke and Peter Sanders</span>
    <span class="title">Efficient Yao Graph Construction</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.20">10.4230/LIPIcs.SEA.2023.20</a>
</li>
<li>
    <span class="authors">Stephen Jaud, Anthony Wirth, and Farhana Choudhury</span>
    <span class="title">Maximum Coverage in Sublinear Space, Faster</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SEA.2023.21">10.4230/LIPIcs.SEA.2023.21</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