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