🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri

cs.DS 🏛 SODA 📚 19 cites 5 years ago

R.I.P. 👻 Ghosted

A faster algorithm for finding Tarski fixed points

John Fearnley, Dömötör Pálvölgyi, Rahul Savani

cs.DS 🏛 STACS 📚 19 cites 5 years ago

R.I.P. 👻 Ghosted

Optimal bounds for approximate counting

Jelani Nelson, Huacheng Yu

cs.DS 🏛 PODS 📚 19 cites 5 years ago

R.I.P. 👻 Ghosted

Fully-Dynamic Submodular Cover with Bounded Recourse

Anupam Gupta, Roie Levin

cs.DS 🏛 FOCS 📚 19 cites 5 years ago

R.I.P. 👻 Ghosted

Improved Weighted Additive Spanners

Michael Elkin, Yuval Gitlitz, Ofer Neiman

cs.DS 🏛 Distributed computing 📚 19 cites 5 years ago

R.I.P. 👻 Ghosted

Solving Problems on Generalized Convex Graphs via Mim-Width

Flavia Bonomo-Braberman, Nick Brettell, ... (+2 more)

cs.DS 🏛 ICADS W 📚 19 cites 5 years ago

R.I.P. 👻 Ghosted

Deterministic Replacement Path Covering

Karthik C. S., Merav Parter

cs.DS 🏛 SODA 📚 19 cites 5 years ago

R.I.P. 👻 Ghosted

Parameterized Complexity of Graph Burning

Yasuaki Kobayashi, Yota Otachi

cs.DS 🏛 Algorithmica 📚 19 cites 5 years ago

R.I.P. 👻 Ghosted

Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation

Yu Chen, Sampath Kannan, Sanjeev Khanna

cs.DS 🏛 ICALP 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Online Page Migration with ML Advice

Piotr Indyk, Frederik Mallmann-Trenn, ... (+2 more)

cs.DS 🏛 AISTATS 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

k-apices of minor-closed graph classes. II. Parameterized algorithms

Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos

cs.DS 🏛 ICALP 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Efficient Algorithms for Approximating Quantum Partition Functions

Ryan L. Mann, Tyler Helmuth

cs.DS 🏛 J.MP 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Chaining with overlaps revisited

Veli Mäkinen, Kristoffer Sahlin

cs.DS 🏛 CPM 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Lower density selection schemes via small universal hitting sets with short remaining path length

Hongyu Zheng, Carl Kingsford, Guillaume Marçais

cs.DS 🏛 Annual International Conference on Research in Computational Molecular Biology 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Lower Bounds for Compressed Sensing with Generative Models

Akshay Kamath, Sushrut Karmalkar, Eric Price

cs.DS 🏛 arXiv 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Sample Complexity of Probabilistic Roadmaps via $ε$-nets

Matthew Tsao, Kiril Solovey, Marco Pavone

cs.DS 🏛 ICRA 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Internal Dictionary Matching

Panagiotis Charalampopoulos, Tomasz Kociumaka, ... (+4 more)

cs.DS 🏛 Algorithmica 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Finding and counting permutations via CSPs

Benjamin Aram Berendsohn, László Kozma, Dániel Marx

cs.DS 🏛 Algorithmica 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs

Adam Karczmarz, Jakub Łącki

cs.DS 🏛 ESA 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles

Takehiro Ito, Naonori Kakimura, ... (+3 more)

cs.DS 🏛 ESA 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

Lars Gottesbüren, Michael Hamann, ... (+2 more)

cs.DS 🏛 Algorithms 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

$\text{#NFA}$ admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes

Marcelo Arenas, Luis Alberto Croquevielle, ... (+2 more)

cs.DS 🏛 J.A 📚 19 cites 6 years ago

R.I.P. 👻 Ghosted

The Number of Minimum $k$-Cuts: Improving the Karger-Stein Bound

Anupam Gupta, Euiwoong Lee, Jason Li

cs.DS 🏛 STOC 📚 19 cites 7 years ago

R.I.P. 👻 Ghosted

Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles

Noga Alon, Shiri Chechik, Sarel Cohen

cs.DS 🏛 ICALP 📚 19 cites 7 years ago