Abstract is missing.
- Exact Algorithms for Group Closeness CentralityLuca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer. 1-12 [doi]
- On the Group Coverage Centrality Problem: Parameterized Complexity and HeuristicsChristian Komusiewicz, Jannis Schramek, Frank Sommer. 13-24 [doi]
- Engineering Fully Dynamic Δ-Orientation AlgorithmsJannick Borowitz, Ernestine Großmann, Christian Schulz 0003. 25-37 [doi]
- On Improving Contraction Hierarchies Using Distance Group PartitionsClaudius Proissl. 38-48 [doi]
- Faster Parallel Exact Density Peaks ClusteringYihao Huang 0004, Shangdi Yu, Julian Shun. 49-62 [doi]
- Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for BranchingJonas Charfreitag, Sven Mallach, Petra Mutzel. 63-74 [doi]
- A Reduced Cost-based Model Strengthening MethodLukas Schürmann, Petra Mutzel. 75-86 [doi]
- Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case GuaranteesNicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner. 87-97 [doi]
- Irreducibility of Recombination Markov Chains in the Triangular LatticeSarah Cannon. 98-109 [doi]
- Generalized Scaling for the Constrained Maximum-Entropy Sampling ProblemZhongzhu Chen, Marcia Fampa, Jon Lee 0001. 110-118 [doi]
- An Exponentially Smaller Kernel for Exact Weighted Clique DecompositionShweta Jain 0007, Yosuke Mizutani, Blair D. Sullivan. 119-133 [doi]
- Accelerating Distributed Matrix Multiplication with 4-Dimensional Polynomial CodesRoy Nissim, Oded Schwartz. 134-146 [doi]
- LAHypergraph: Parallel Hypergraph Analytics in the Language of Linear AlgebraLuanzheng Guo, Jesun Firoz, Gokcen Kestor. 147-158 [doi]
- Solving max-plus linear systems by level sparsificationYuki Nishida 0008. 159-168 [doi]
- Fast First-Order Methods for Monotone Strongly DR-Submodular MaximizationMaryam Fazel, Omid Sadeghi. 169-179 [doi]
- Exponential Convergence of Sinkhorn Under Regularization SchedulingJingbang Chen, Li Chen 0028, Yang P. Liu, Richard Peng, Arvind Ramaswami. 180-188 [doi]
- A Breakpoints Based Method for the Maximum Diversity and Dispersion ProblemsDorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt. 189-200 [doi]
- Elimination Techniques for Algorithmic Differentiation RevisitedUwe Naumann, Erik Schneidereit, Simon Märtens, Markus Towara. 201-212 [doi]
- κ-mer AnalysisHunter McCoy, Steven A. Hofmeyr, Katherine A. Yelick, Prashant Pandey 0001. 213-224 [doi]
- κ-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler TransformJarno N. Alanko, Simon J. Puglisi, Jaakko Vuohtoniemi. 225-236 [doi]
- Computing Boundary Crossing Probabilities of General Empirical ProcessesRigel Galgana, Takehiro Oyakawa, Amy Greenwald. 237-246 [doi]