🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Generalized Shortest Path Kernel on Graphs

Linus Hermansson, Fredrik D. Johansson, Osamu Watanabe

cs.DS 🏛 IFIP Working Conference on Database Semantics 📚 17 cites 10 years ago

R.I.P. 👻 Ghosted

A Quadratic Assignment Formulation of the Graph Edit Distance

Sébastien Bougleux, Luc Brun, ... (+4 more)

cs.DS 🏛 arXiv 📚 17 cites 10 years ago

R.I.P. 👻 Ghosted

A tight lower bound for Vertex Planarization on graphs of bounded treewidth

Marcin Pilipczuk

cs.DS 🏛 DAM 📚 17 cites 10 years ago

R.I.P. 👻 Ghosted

Bin Packing with Linear Usage Costs

Hadrien Cambazard, Deepak Mehta, ... (+2 more)

cs.DS 🏛 arXiv 📚 17 cites 10 years ago

R.I.P. 👻 Ghosted

Approximation of the Quadratic Knapsack Problem

Richard Taylor

cs.DS 🏛 Operations Research Letters 📚 17 cites 10 years ago

🌅 🌅 Old Age

Relative Suffix Trees

Andrea Farruggia, Travis Gagie, ... (+3 more)

cs.DS 🏛 Computer/law journal 📚 17 cites 10 years ago

R.I.P. 👻 Ghosted

A cubic vertex kernel for Diamond-free Edge Deletion and more

R. B. Sandeep, Naveen Sivadasan

cs.DS 🏛 IPEC 📚 17 cites 10 years ago

R.I.P. 👻 Ghosted

Maximum matching width: new characterizations and a fast algorithm for dominating set

Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle

cs.DS 🏛 IPEC 📚 17 cites 10 years ago

R.I.P. 👻 Ghosted

Greedy Matching: Guarantees and Limitations

Bert Besser, Matthias Poloczek

cs.DS 🏛 Algorithmica 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

Tight Bounds for Linear Sketches of Approximate Matchings

Sepehr Assadi, Sanjeev Khanna, ... (+2 more)

cs.DS 🏛 arXiv 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

Multi-probe consistent hashing

Ben Appleton, Michael O'Reilly

cs.DS 🏛 arXiv 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

Fast Quasi-Threshold Editing

Ulrik Brandes, Michael Hamann, ... (+2 more)

cs.DS 🏛 ESA 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems

F. Bruce Shepherd, Adrian Vetta

cs.DS 🏛 Theory of Computing 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

On the complexity of computing the $k$-restricted edge-connectivity of a graph

Luis Pedro Montejano, Ignasi Sau

cs.DS 🏛 TCS 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

A framework for space-efficient string kernels

Djamal Belazzougui, Fabio Cunial

cs.DS 🏛 Algorithmica 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

Parameterized Complexity of Secluded Connectivity Problems

Fedor V. Fomin, Petr A. Golovach, ... (+2 more)

cs.DS 🏛 ToCS 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

Big Data on the Rise: Testing monotonicity of distributions

Clément L. Canonne

cs.DS 🏛 ICALP 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets

Yuto Nakashima, Tomohiro I, ... (+3 more)

cs.DS 🏛 IPL 📚 17 cites 11 years ago

R.I.P. 👻 Ghosted

How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity

Jeremiah Blocki, Elena Grigorescu, ... (+2 more)

cs.DS 🏛 APPROX W 📚 17 cites 3 years ago

R.I.P. 👻 Ghosted

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"

Swati Gupta, Jai Moondra, Mohit Singh

cs.DS 🏛 EC 📚 17 cites 3 years ago

R.I.P. 👻 Ghosted

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method

Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang

cs.DS 🏛 STOC 📚 17 cites 3 years ago

R.I.P. 👻 Ghosted

Improved Bi-point Rounding Algorithms and a Golden Barrier for $k$-Median

Kishen N. Gowda, Thomas Pensyl, ... (+2 more)

cs.DS 🏛 SODA 📚 17 cites 3 years ago

R.I.P. 👻 Ghosted

SicHash -- Small Irregular Cuckoo Tables for Perfect Hashing

Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

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

R.I.P. 👻 Ghosted

Twin-width V: linear minors, modular counting, and matrix multiplication

Édouard Bonnet, Ugo Giocanti, ... (+2 more)

cs.DS 🏛 STACS 📚 17 cites 3 years ago