LIPIcs, Volume 265, SEA 2023

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