🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Pandora's Problem with Combinatorial Cost

Ben Berger, Tomer Ezra, ... (+2 more)

cs.DS 🏛 EC 📚 10 cites 3 years ago

R.I.P. 👻 Ghosted

New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth

Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon

cs.DS 🏛 WG W 📚 10 cites 3 years ago

R.I.P. 👻 Ghosted

Distributed Symmetry Breaking on Power Graphs via Sparsification

Yannic Maus, Saku Peltonen, Jara Uitto

cs.DS 🏛 Distributed computing 📚 10 cites 3 years ago

R.I.P. 👻 Ghosted

Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler

Sivakanth Gopi, Yin Tat Lee, ... (+3 more)

cs.DS 🏛 COLT 📚 10 cites 3 years ago

R.I.P. 👻 Ghosted

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection

Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai

cs.DS 🏛 ICALP 📚 10 cites 3 years ago

R.I.P. 👻 Ghosted

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

Pascal Kunz, Hendrik Molter, Meirav Zehavi

cs.DS 🏛 IJCAI 📚 10 cites 3 years ago

R.I.P. 👻 Ghosted

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Jovan Blanuša, Kubilay Atasu, Paolo Ienne

cs.DS 🏛 ACM Transactions on Parallel Computing 📚 10 cites 3 years ago

R.I.P. 👻 Ghosted

Intervention Efficient Algorithms for Approximate Learning of Causal Graphs

Raghavendra Addanki, Andrew McGregor, Cameron Musco

cs.DS 🏛 ALT 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Local-to-Global Contraction in Simplicial Complexes

Heng Guo, Giorgos Mousa

cs.DS 🏛 arXiv 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Almost Optimal Bounds for Sublinear-Time Sampling of $k$-Cliques: Sampling Cliques is Harder Than Counting

Talya Eden, Dana Ron, Will Rosenbaum

cs.DS 🏛 arXiv 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Online $k$-Taxi via Double Coverage and Time-Reverse Primal-Dual

Niv Buchbinder, Christian Coester, ... (+2 more)

cs.DS 🏛 Math. Prog. 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Erasure-Resilient Sublinear-Time Graph Algorithms

Amit Levi, Ramesh Krishnan S. Pallavoor, ... (+2 more)

cs.DS 🏛 ECCC 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Maximum Matchings and Popularity

Telikepalli Kavitha

cs.DS 🏛 ICALP 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms

Markus Anders, Pascal Schweitzer

cs.DS 🏛 ICALP 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Computing Crisp Bisimulations for Fuzzy Structures

Linh Anh Nguyen, Dat Xuan Tran

cs.DS 🏛 International Journal of Approximate Reasoning 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Improved Algorithms for Edge Colouring in the W-Streaming Model

Moses Charikar, Paul Liu

cs.DS 🏛 SOSA 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

EPTAS for $k$-means Clustering of Affine Subspaces

Eduard Eiben, Fedor V. Fomin, ... (+4 more)

cs.DS 🏛 SODA 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

New Sublinear Algorithms and Lower Bounds for LIS Estimation

Ilan Newman, Nithin Varma

cs.DS 🏛 ICALP 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Online Hypergraph Matching with Delays

Marco Pavone, Amin Saberi, ... (+2 more)

cs.DS 🏛 Operational Research 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

A Case for Partitioned Bloom Filters

Paulo Sérgio Almeida

cs.DS 🏛 IEEE transactions on computers 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Achieving anonymity via weak lower bound constraints for k-median and k-means

Anna Arutyunova, Melanie Schmidt

cs.DS 🏛 STACS 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Zuckerli: A New Compressed Representation for Graphs

Luca Versari, Iulia M. Comsa, ... (+2 more)

cs.DS 🏛 IEEE Access 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks

Jingqiu Ding, Samuel B. Hopkins, David Steurer

cs.DS 🏛 NeurIPS 📚 10 cites 5 years ago

R.I.P. 👻 Ghosted

Tight Bound for the Number of Distinct Palindromes in a Tree

Paweł Gawrychowski, Tomasz Kociumaka, ... (+2 more)

cs.DS 🏛 SPIRE 📚 10 cites 5 years ago