Abstract is missing.
- An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max CutRenee Mirka, David P. Williamson. [doi]
- Digraph k-Coloring Games: From Theory to PracticeAndrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco. [doi]
- RLBWT TricksNathaniel K. Brown, Travis Gagie, Massimiliano Rossi 0001. [doi]
- A Branch-And-Bound Algorithm for Cluster EditingThomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm. [doi]
- Routing in Multimodal Transportation Networks with Non-Scheduled LinesDarko Drakulic, Christelle Loiodice, Vassilissa Lehoux. [doi]
- On the Satisfiability of Smooth Grid CSPsVasily Alferov, Mateus de Oliveira Oliveira. [doi]
- Heuristic Computation of Exact TreewidthHisao Tamaki. [doi]
- A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency BlocksAlexander van der Grinten, Maria Predari, Florian Willich. [doi]
- An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQPAkshay Gupte, Arie M. C. A. Koster, Sascha Kuhnke. [doi]
- Stochastic Route Planning for Electric VehiclesPayas Rajan, Chinya V. Ravishankar. [doi]
- Fast Succinct Retrieval and Approximate Membership Using RibbonPeter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders 0001, Stefan Walzer. [doi]
- Practical Performance of Random Projections in Linear ProgrammingLeo Liberti, Benedetto Manca, Pierre-Louis Poirion. [doi]
- A Parallel Framework for Approximate Max-Dicut in Partitionable GraphsNico Bertram, Jonas Ellert, Johannes Fischer 0001. [doi]
- Discrete Hyperbolic Random Graph ModelDorota Celinska-Kopczynska, Eryk Kopczynski. [doi]
- Parallel Flow-Based Hypergraph PartitioningLars Gottesbüren, Tobias Heuer, Peter Sanders 0001. [doi]
- Relating Real and Synthetic Social Networks Through Centrality MeasuresMaria J. Blesa, Mihail Eduard Popa, Maria J. Serna. [doi]
- Automatic Reformulations for Convex Mixed-Integer Nonlinear Optimization: Perspective and SeparabilityMeenarli Sharma, Ashutosh Mahajan. [doi]
- An Experimental Study of Algorithms for Packing ArborescencesLoukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, Stavros D. Nikolopoulos. [doi]
- Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHASTTim Zeitz. [doi]
- Efficient and Accurate Group Testing via Belief Propagation: An Empirical StudyAmin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Manuel Penschuck. [doi]
- Computing Maximal Unique Matches with the r-IndexSara Giuliani, Giuseppe Romana, Massimiliano Rossi 0001. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering DegreesRamtin Afshar, Michael T. Goodrich, Evrim Ozel. [doi]
- Solving and Generating Nagareru PuzzlesMasakazu Ishihata, Fumiya Tokumasu. [doi]
- Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural NetworksKenneth Langedal, Johannes Langguth, Fredrik Manne, Daniel Thilo Schroeder. [doi]