The following list is provided so participants can review this information prior to posting of the online program. Details appear as originally submitted.
Changes will *not* be made to this page.
Updated presentation details (titles, abstracts, author names and affiliations) will be available when the online program is posted, scheduled to occur late March 2023.
Proceedings Papers:
A breakpoints-based method for the maximum diversity problem
Dorit Hochbaum, Zhihao Liu and Olivier Goldschmidt
On Improving Contraction Hierarchies Using Distance Group Partitions
Claudius Proissl
Elimination Techniques for Algorithmic Differentiation Revisited
Uwe Naumann, Erik Schneidereit, Simon Maertens and Markus Towara
Singleton Sieving: Overcoming the Memory/Speed Trade-Off in Exascale k-mer Analysis
Hunter McCoy, Steven Hofmeyr, Katherine Yelick and Prashant Pandey
Faster Parallel Exact Density-Peak Clustering
Shangdi Yu, Yihao Huang and Julian Shun
Solving max-plus linear systems by level sparsification
Yuki Nishida
Exponential Convergence of Sinkhorn Under Regularization Scheduling
Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng and Arvind Ramaswami
Computing Boundary Crossing Probabilities of General Empirical Processes
Rigel Galgana, Amy Greenwald and Takehiro Oyakawa
Small Searchable k-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform
Jarno Alanko, Simon Puglisi and Jaakko Vuohtoniemi
Exact Algorithms for Group Closeness Centrality
Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz and Frank Sommer
Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching
Jonas Charfreitag, Sven Mallach and Petra Mutzel
Fast First-Order Methods for Monotone Strongly DR-Submodular Maximization
Omid Sadeghi and Maryam Fazel
An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition
Shweta Jain, Yosuke Mizutani and Blair D. Sullivan
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics
Christian Komusiewicz, Jannis Schramek and Frank Sommer
Irreducibility of Recombination Markov Chains in the Triangular Lattice
Sarah Cannon
LAHyperGraph: Parallel Hypergraph Analytics in the Language of Linear Algebra
Luanzheng Guo, Jesun Firoz and Gokcen Kestor
Engineering Fully Dynamic ∆-Orientation Algorithms
Jannick Borowitz, Ernestine Großmann and Christian Schulz
Accelerating Distributed Matrix Multiplication with 4-Dimensional Polynomial Codes
Roy Nissim and Oded Schwartz
A Reduced Cost-based Model Strengthening Method
Lukas Schürmann and Petra Mutzel
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
Zhongzhu Chen, Marcia Fampa and Jon Lee
Learned Interpolation for Better Streaming Quantile Approximation with Worst Case Guarantees
Nicholas Schiefer, Justin Y. Chen, Shyam Narayanan, Piotr Indyk, Sandeep Silwal and Tal Wagner
Oral Presentation:
Spanning Tree Bounds for Grid Graphs
Kristopher Tapp
Jet: Multilevel Graph Partitioning on Graphics Processing Units
Michael Gilbert, Kamesh Madduri, Erik Boman and Sivasankaran Rajamanickam
Greed is good for 2-approximating the jump number for interval posets
Gara Pruesse
Provably Fast and Space-Efficient Parallel Biconnectivity
Xiaojun Dong, Letong Wang, Yan Gu and Yihan Sun
Order-optimal Correlated Rounding for Fulfilling Multi-item E-commerce Orders
Will Ma
Reducing the Feeder Effect in Public School Admissions: A Bias-aware Analysis for Targeted Interventions
Yuri Faenza, Swati Gupta and Xuan Zhang
Poster Presentation:
Counting Induced 6-Cycles in Bipartite Graphs
Jason Niu, Jaroslaw Zola and Ahmet Erdem Sarıyüce
Vertex Elimination for Algorithmic Piecewise Differentiation
Torsten Bosse and Martin Buecker
Extending Primal-Dual Methods for Edge Connectivity
Ishan Bansal
Parallel Strong Connectivity Based on Faster Reachability
Letong Wang, Xiaojun Dong, Yan Gu and Yihan Sun
Overlapping Edge-Colored Clustering
Alex Crane, Brian Lavallee, Blair D. Sullivan and Nate Veldt
Practical Weighted Clique Decomposition for Identifying Gene Co-expression Modules
Yosuke Mizutani, Alex Crane, David Dursteler and Blair D. Sullivan
An Approximation of the Modulus of the Family of Edge Covers
Adriana Ortiz Aquino and Nathan Albin
IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity
Prashant Pandey, Michael Bender, Alex Conway, Martín Farach-Colton, William Kuszmaul, Guido Tagliavini and Rob Johnson
Applications of Graph Theory Algorithms and Topological Data Analysis to Finding Optimal Locations for Lunar Colonies
Justin Zhang, Alice Zhang and John Park
Improved Space Bounds for Learning with Experts
Anders Aamand, Justin Chen, Huy Le Nguyen and Sandeep Silwal