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