• Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick and Manuel Penschuck.
  Efficient and Accurate Group Testing via Belief Propagation: an Empirical Study
  
  
• Meenarli Sharma and Ashutosh Mahajan.
  Automatic Reformulations for Convex Mixed-Integer Nonlinear Optimization: Perspective and Separability
  
  
• Mateus De Oliveira Oliveira and Vasily Alferov.
  On the Satisfiability of Smooth Grid CSPs
  
  
• Kenneth Langedal, Johannes Langguth, Fredrik Manne and Daniel T. Schroeder.
  Efficient Minimum Weight Vertex Cover Heuristics using Graph Neural Networks
  
  
• Nathaniel K. Brown, Travis Gagie and Massimiliano Rossi.
  RLBWT Tricks
  
  
• Sara Giuliani, Giuseppe Romana and Massimiliano Rossi.
  Computing Maximal Unique Matches with the r-index
  
  
• Dionysios Kefallinos, Loukas Georgiadis, Anna Mpanti and Stavros Nikolopoulos.
  An Experimental Study of Algorithms for Packing Arborescences
  
  
• Tim Zeitz.
  Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST
  
  
• Maria J. Blesa, Maria Serna and Mihail Eduard Popa.
  Relating real and synthetic social networks through centrality measures
  
  
• Dorota Celińska-Kopczyńska and Eryk Kopczynski.
  Discrete Hyperbolic Random Graph Model
  
  
• Darko Drakulic, Christelle Loiodice and Vassilissa Lehoux-Lebacque.
  Routing in multimodal transportation networks with non-scheduled lines
  
  
• Leo Liberti, Benedetto Manca and Pierre-Louis Poirion.
  Practical performance of Random Projections in Linear Programming
  
  
• Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders and Stefan Walzer.
  Fast Succinct Retrieval and Approximate Membership using Ribbon
  
  
• Ramtin Afshar, Michael Goodrich and Evrim Ozel.
  Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees
  
  
• Alexander van der Grinten, Maria Predari and Florian Willich.
  A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks
  
  
• Payas Rajan and Chinya Ravishankar.
  Stochastic Route Planning for Electric Vehicles
  
  
• Masakazu Ishihata and Fumiya Tokumasu.
  Solving and Generating Nagareru Puzzles
  
  
• Renee Mirka and David Williamson.
  An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut
  
  
• Akshay Gupte, Arie Koster and Sascha Kuhnke.
  An adaptive refinement algorithm for discretizations of nonconvex QCQP
  
  
• Hisao Tamaki.
  Heuristic computation of exact treewidth
  
  
• Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini and Gianpiero Monaco.
  Digraph k-Coloring Games: from Theory to Practice
  
  
• Nico Bertram, Jonas Ellert and Johannes Fischer.
  A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs
  
  
• Lars Gottesbüren, Tobias Heuer and Peter Sanders.
  Parallel Flow-Based Hypergraph Partitioning
  
  
• 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