researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
OR
AND
NOT
1
2021
2023
2025
Filter by Tag
Filter by Author
[+]
OR
AND
NOT
1
Amy Greenwald
Aydin Buluç
Blair D. Sullivan
Christian Komusiewicz
Christian Schulz 0003
Claudius Proissl
Ernestine Großmann
Frank Sommer
H. Martin Bücker
Henning Meyerhenke
Jon Lee 0001
Julian Shun
Katherine A. Yelick
Kostas Kollias
Marcia Fampa
Oded Schwartz
Petra Mutzel
Prashant Pandey 0001
Rigel Galgana
Roy Nissim
Filter by Top terms
[+]
OR
AND
NOT
1
acda
algorithms
applied
clique
complexity
computational
computing
conference
decomposition
discrete
dynamic
efficient
exact
graph
maximum
parallel
problem
search
using
via
ACDA (acda)
Editions
Publications
Viewing Publication 1 - 69 from 69
2025
Proceedings of the 3rd Conference on Applied and Computational Discrete Algorithms, ACDA 2025, Montreal, Quebec, Canada, July 30 - August 1, 2025
Alex Conway 0001
,
Alex Pothen
,
Martin Farach-Colton
,
Bora Uçar
, editors,
SIAM,
2025.
[doi]
Shared-Memory Hierarchical Process Mapping
Christian Schulz 0003
,
Henning Woydt
.
acda 2025
:
18-31
[doi]
Speeding up Stencil Computation using Gaussian Approximations
Zafar Ahmad
,
Rezaul Chowdhury
,
Rathish Das
,
Pramod Ganapathi
,
Aaron Gregory
,
Yimin Zhu 0003
.
acda 2025
:
276-292
[doi]
The Case for External Graph Sketching
Michael A. Bender
,
Martín Farach-Colton
,
Riko Jacob
,
Hanna Komlós
,
David Tench
,
Evan T. West
.
acda 2025
:
115-129
[doi]
A Space-Efficient Algebraic Approach to Robotic Motion Planning
Matthias Bentert
,
Daniel Coimbra Salomao
,
Alex Crane
,
Yosuke Mizutani
,
Felix Reidl
,
Blair D. Sullivan
.
acda 2025
:
61-73
[doi]
Optimization of Infrastructure Network Maintenance: Complexity, Exact Solutions, and a Greedy Heuristic
Lukas Berner
,
Felix L. Heitmann
,
Henning Meyerhenke
.
acda 2025
:
237-250
[doi]
An Efficient Sparse Kernel Generator for O(3)-Equivariant Deep Networks
Vivek Bharadwaj
,
Austin Glover
,
Aydin Buluç
,
James Demmel
.
acda 2025
:
32-46
[doi]
Online Distributed Queue Length Estimation
Aditya Bhaskara
,
Sreenivas Gollapudi
,
Sungjin Im
,
Kostas Kollias
,
Kamesh Munagala
.
acda 2025
:
308-321
[doi]
Algorithmic Differentiation and Vertex Elimination on Computational Hypergraphs
Torsten Bosse
,
H. Martin Bücker
.
acda 2025
:
196-207
[doi]
Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
Daniel Brous
,
David Shmoys
.
acda 2025
:
264-275
[doi]
Heuristic Graph Colouring using Hypergraph Representations
H. Martin Bücker
,
Christian Komusiewicz
,
Jurek Rostalsky
.
acda 2025
:
208-221
[doi]
Evaluating Learned Indexes for External Memory Joins
Yuvaraj Chesetti
,
Prashant Pandey 0001
.
acda 2025
:
101-114
[doi]
Partitioning Trillion Edge Graphs on Edge Devices
Adil Chhabra
,
Florian Kurpicz
,
Christian Schulz 0003
,
Dominik Schweisgut
,
Daniel Seemaier
.
acda 2025
:
74-89
[doi]
New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
Xiangyun Ding
,
Yan Gu 0001
,
Yihan Sun 0001
.
acda 2025
:
293-307
[doi]
Zip-Tries: Simple Dynamic Data Structures for Strings
David Eppstein
,
Ofek Gila
,
Michael T. Goodrich
,
Ryuto Kitagawa
.
acda 2025
:
130-143
[doi]
Accelerating Reductions Using Graph Neural Networks for the Maximum Weight Independent Set Problem
Ernestine Großmann
,
Kenneth Langedal
,
Christian Schulz 0003
.
acda 2025
:
155-168
[doi]
Alternative Bases for New Fast Matrix Multiplication Algorithms
Olga Holtz
,
Abraham Hsu
,
Yoav Moran
,
Oded Schwartz
,
Gal Wiernik
.
acda 2025
:
322-334
[doi]
Deterministic Parallel High-Quality Hypergraph Partitioning
Robert Krause
,
Lars Gottesbüren
,
Nikolai Maas
.
acda 2025
:
222-236
[doi]
Scheduled Jacobian Chaining
Simon Märtens
,
Uwe Naumann
.
acda 2025
:
90-100
[doi]
The Number of the Beast: Reducing Additions in Fast Matrix Multiplication Algorithms for Dimensions up to 666
Erik Mårtensson
,
Paul Stankovski Wagner
.
acda 2025
:
47-60
[doi]
Minimizing the Division Factor of Toom-Cook Algorithms
Roy Nissim
,
Oded Schwartz
,
Yuval Spiizer
.
acda 2025
:
144-154
[doi]
Computing Experiment-Constrained D-Optimal Designs
Aditya Pillai
,
Gabriel Ponte
,
Marcia Fampa
,
Jon Lee 0001
,
Mohit Singh
,
Weijun Xie 0001
.
acda 2025
:
182-195
[doi]
Smart charging and optimization of personalized flexibility services for electric vehicles's users
Rita Safi
,
Raphaël Payen
,
Yezekael Hayel
,
Alix Dupont
,
Tania Jiménez
.
acda 2025
:
169-181
[doi]
Why is My Route Different Today? An Algorithm for Explaining Route Selection
Aaron Schild
,
Sreenivas Gollapudi
,
Anupam Gupta 0001
,
Kostas Kollias
,
Ali Kemal Sinop
.
acda 2025
:
251-263
[doi]
PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
Shangdi Yu
,
Joshua Engels
,
Yihao Huang 0004
,
Julian Shun
.
acda 2025
:
1-17
[doi]
2023
Faster Parallel Exact Density Peaks Clustering
Yihao Huang 0004
,
Shangdi Yu
,
Julian Shun
.
acda 2023
:
49-62
[doi]
An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition
Shweta Jain 0007
,
Yosuke Mizutani
,
Blair D. Sullivan
.
acda 2023
:
119-133
[doi]
Solving max-plus linear systems by level sparsification
Yuki Nishida 0008
.
acda 2023
:
159-168
[doi]
κ-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform
Jarno N. Alanko
,
Simon J. Puglisi
,
Jaakko Vuohtoniemi
.
acda 2023
:
225-236
[doi]
SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023
Jonathan W. Berry
,
David B. Shmoys
,
Lenore Cowen
,
Uwe Naumann
, editors,
SIAM,
2023.
[doi]
Engineering Fully Dynamic Δ-Orientation Algorithms
Jannick Borowitz
,
Ernestine Großmann
,
Christian Schulz 0003
.
acda 2023
:
25-37
[doi]
Irreducibility of Recombination Markov Chains in the Triangular Lattice
Sarah Cannon
.
acda 2023
:
98-109
[doi]
Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching
Jonas Charfreitag
,
Sven Mallach
,
Petra Mutzel
.
acda 2023
:
63-74
[doi]
Exponential Convergence of Sinkhorn Under Regularization Scheduling
Jingbang Chen
,
Li Chen 0028
,
Yang P. Liu
,
Richard Peng
,
Arvind Ramaswami
.
acda 2023
:
180-188
[doi]
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
Zhongzhu Chen
,
Marcia Fampa
,
Jon Lee 0001
.
acda 2023
:
110-118
[doi]
Fast First-Order Methods for Monotone Strongly DR-Submodular Maximization
Maryam Fazel
,
Omid Sadeghi
.
acda 2023
:
169-179
[doi]
Computing Boundary Crossing Probabilities of General Empirical Processes
Rigel Galgana
,
Takehiro Oyakawa
,
Amy Greenwald
.
acda 2023
:
237-246
[doi]
LAHypergraph: Parallel Hypergraph Analytics in the Language of Linear Algebra
Luanzheng Guo
,
Jesun Firoz
,
Gokcen Kestor
.
acda 2023
:
147-158
[doi]
A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems
Dorit S. Hochbaum
,
Zhihao Liu
,
Olivier Goldschmidt
.
acda 2023
:
189-200
[doi]
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics
Christian Komusiewicz
,
Jannis Schramek
,
Frank Sommer
.
acda 2023
:
13-24
[doi]
κ-mer Analysis
Hunter McCoy
,
Steven A. Hofmeyr
,
Katherine A. Yelick
,
Prashant Pandey 0001
.
acda 2023
:
213-224
[doi]
Elimination Techniques for Algorithmic Differentiation Revisited
Uwe Naumann
,
Erik Schneidereit
,
Simon Märtens
,
Markus Towara
.
acda 2023
:
201-212
[doi]
Accelerating Distributed Matrix Multiplication with 4-Dimensional Polynomial Codes
Roy Nissim
,
Oded Schwartz
.
acda 2023
:
134-146
[doi]
On Improving Contraction Hierarchies Using Distance Group Partitions
Claudius Proissl
.
acda 2023
:
38-48
[doi]
Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees
Nicholas Schiefer
,
Justin Y. Chen
,
Piotr Indyk
,
Shyam Narayanan
,
Sandeep Silwal
,
Tal Wagner
.
acda 2023
:
87-97
[doi]
A Reduced Cost-based Model Strengthening Method
Lukas Schürmann
,
Petra Mutzel
.
acda 2023
:
75-86
[doi]
Exact Algorithms for Group Closeness Centrality
Luca Pascal Staus
,
Christian Komusiewicz
,
Nils Morawietz
,
Frank Sommer
.
acda 2023
:
1-12
[doi]
2021
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021
Michael Bender 0001
,
John Gilbert 0001
,
Bruce Hendrickson
,
Blair D. Sullivan
, editors,
SIAM,
2021.
[doi]
Fully-dynamic Weighted Matching Approximation in Practice
Eugenio Angriman
,
Henning Meyerhenke
,
Christian Schulz 0003
,
Bora Uçar
.
acda 2021
:
32-44
[doi]
Efficient signed backward substitution for piecewise affine functions via path problems in a directed acyclic graph
Torsten Bosse
,
Ralf Seidler
,
H. Martin Bücker
.
acda 2021
:
171-181
[doi]
The Quantile Matching Problem and Point Cloud Registration
Stéphane Chrétien
,
Oya Ekin Karasan
,
Ecenur Oguz
,
Mustafa Ç. Pinar
.
acda 2021
:
13-20
[doi]
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition
Madison Cooley
,
Casey S. Greene
,
Davis Issac
,
Milton Pividori
,
Blair D. Sullivan
.
acda 2021
:
111-122
[doi]
Search and evacuation with a near majority of faulty agents
Jurek Czyzowicz
,
Ryan Killick
,
Evangelos Kranakis
,
Grzegorz Stachowiak
.
acda 2021
:
217-227
[doi]
A Message-Driven, Multi-GPU Parallel Sparse Triangular Solver
Nan Ding
,
Yang Liu 0179
,
Samuel Williams
,
Xiaoye S. Li
.
acda 2021
:
147-159
[doi]
The Traveling Firefighter Problem
Majid Farhadi
,
Alejandro Toriello
,
Prasad Tetali
.
acda 2021
:
205-216
[doi]
b-Matching
S. M. Ferdous
,
Alex Pothen
,
Arif Khan 0005
,
Ajay Panyala
,
Mahantesh Halappanavar
.
acda 2021
:
45-56
[doi]
A Dynamic Program for Computing the Joint Cumulative Distribution Function of Order Statistics
Rigel Galgana
,
Cengke Shi
,
Amy Greenwald
,
Takehiro Oyakawa
.
acda 2021
:
160-170
[doi]
BELLA: Berkeley Efficient Long-Read to Long-Read Aligner and Overlapper
Giulia Guidi
,
Marquita Ellis
,
Daniel Rokhsar
,
Katherine A. Yelick
,
Aydin Buluç
.
acda 2021
:
123-134
[doi]
Fairmandering: A column generation heuristic for fairness-optimized political districting
Wes Gurnee
,
David B. Shmoys
.
acda 2021
:
88-99
[doi]
Faster Parallel Multiterminal Cuts
Monika Henzinger
,
Alexander Noe
,
Christian Schulz 0003
.
acda 2021
:
100-110
[doi]
Using Predicted Weights for Ad Delivery
Thomas Lavastida
,
Benjamin Moseley
,
R. Ravi 0001
,
Chenyang Xu
.
acda 2021
:
21-31
[doi]
Queues with Small Advice
Michael Mitzenmacher
.
acda 2021
:
1-12
[doi]
On the Request-Trip-Vehicle Assignment Problem
Juan Carlos Martínez Mori
,
Samitha Samaranayake
.
acda 2021
:
228-239
[doi]
Tug-of-War sketch using Control-Variates method
Rameshwar Pratap
,
Bhisham Dev Verma
,
Raghav Kulkarni
.
acda 2021
:
66-76
[doi]
On the Difference between Search Space Size and Query Complexity in Contraction Hierarchies
Claudius Proissl
,
Tobias Rupp
.
acda 2021
:
77-87
[doi]
Parallel Clique Counting and Peeling Algorithms
Jessica Shi
,
Laxman Dhulipala
,
Julian Shun
.
acda 2021
:
135-146
[doi]
Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors
Shruti Shivakumar
,
Jiajia Li
,
Ramakrishnan Kannan
,
Srinivas Aluru
.
acda 2021
:
193-204
[doi]
Non-monotone Adaptive Submodular Meta-Learning
ShaoJie Tang
,
Jing Yuan 0002
.
acda 2021
:
57-65
[doi]
Multidimensional Included and Excluded Sums
Helen Xu
,
Sean Fraser
,
Charles E. Leiserson
.
acda 2021
:
182-192
[doi]
Sign in
or
sign up
to see more results.