🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Notes on the complexity of coverings for Kronecker powers of symmetric matrices

Igor S. Sergeev

cs.DS 🏛 arXiv 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins

Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai

cs.DS 🏛 arXiv 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Towards Better Bounds for Finding Quasi-Identifiers

Ryan Hildebrant, Quoc-Tung Le, ... (+2 more)

cs.DS 🏛 PODS 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

An Algorithmic Bridge Between Hamming and Levenshtein Distances

Elazar Goldenberg, Tomasz Kociumaka, ... (+2 more)

cs.DS 🏛 ITCS 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

On Structural Parameterizations of Star Coloring

Sriram Bhyravarapu, I. Vinod Reddy

cs.DS 🏛 DAM 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Estimating the Effective Support Size in Constant Query Complexity

Shyam Narayanan, Jakub Tětek

cs.DS 🏛 SOSA 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Efficient Determinant Maximization for All Matroids

Adam Brown, Aditi Laddha, ... (+2 more)

cs.DS 🏛 arXiv 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Extensions of the $(p,q)$-Flexible-Graph-Connectivity model

Ishan Bansal, Joseph Cheriyan, ... (+2 more)

cs.DS 🏛 arXiv 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Efficient algorithms for certifying lower bounds on the discrepancy of random matrices

Prayaag Venkat

cs.DS 🏛 ITCS 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment

Daniel Allendorf, Ulrich Meyer, ... (+2 more)

cs.DS 🏛 ICAEE W 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

On maximal k-edge-connected subgraphs of undirected graphs

Loukas Georgiadis, Giuseppe F. Italiano, ... (+2 more)

cs.DS 🏛 arXiv 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

External-memory dictionaries with worst-case update cost

Rathish Das, John Iacono, Yakov Nekrich

cs.DS 🏛 ISAAC 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$-Edge-Connected Spanning Subgraph

Michal Dory, Mohsen Ghaffari

cs.DS 🏛 SODA 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Sampling an Edge in Sublinear Time Exactly and Optimally

Talya Eden, Shyam Narayanan, Jakub Tětek

cs.DS 🏛 SOSA 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Sampling from convex sets with a cold start using multiscale decompositions

Hariharan Narayanan, Amit Rajaraman, Piyush Srivastava

cs.DS 🏛 Probability theory and related fields 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Summation Problem Revisited -- More Robust Computation

Vaclav Skala

cs.DS 🏛 arXiv 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Composable Coresets for Constrained Determinant Maximization and Beyond

Sepideh Mahabadi, Thuy-Duong Vuong

cs.DS 🏛 arXiv 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Counting Perfect Matchings in Dense Graphs Is Hard

Nicolas El Maalouly, Yanheng Wang

cs.DS 🏛 arXiv 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

Online TSP with Known Locations

Evripidis Bampis, Bruno Escoffier, ... (+2 more)

cs.DS 🏛 ICADS W 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

An Efficient Dynamic Multi-Sources To Single-Destination (DMS-SD) Algorithm In Smart City Navigation Using Adjacent Matrix

Ziren Xiao, Ruxin Xiao, ... (+5 more)

cs.DS 🏛 2022 Human-Centered Cognitive Systems (HCCS) 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

First Order Logic on Pathwidth Revisited Again

Michael Lampis

cs.DS 🏛 ICALP 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs

Dibyayan Chakraborty, L. Sunil Chandran, ... (+2 more)

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

R.I.P. 👻 Ghosted

A nearly optimal randomized algorithm for explorable heap selection

Sander Borst, Daniel Dadush, ... (+2 more)

cs.DS 🏛 Math. Prog. 📚 2 cites 3 years ago

R.I.P. 👻 Ghosted

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation

Akanksha Agrawal, Saket Saurabh, Meirav Zehavi

cs.DS 🏛 IPEC 📚 2 cites 3 years ago