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