🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

On Directed Steiner Trees with Multiple Roots

Ondřej Suchý

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

R.I.P. 👻 Ghosted

An effective Time-Aware Map Matching process for low sampling GPS data

Paolo Cintia, Mirco Nanni

cs.DS 🏛 arXiv 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Robust principal graphs for data approximation

A. N. Gorban, E. M. Mirkes, A. Zinovyev

cs.DS 🏛 arXiv 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Simple average-case lower bounds for approximate near-neighbor from isoperimetric inequalities

Yitong Yin

cs.DS 🏛 ICALP 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Randomized approximate nearest neighbor search with limited adaptivity

Mingmou Liu, Xiaoyin Pan, Yitong Yin

cs.DS 🏛 SPAA 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Optimal Composition Ordering Problems for Piecewise Linear Functions

Yasushi Kawase, Kazuhisa Makino, Kento Seimi

cs.DS 🏛 Algorithmica 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

A Randomized Rounding Algorithm for Sparse PCA

Kimon Fountoulakis, Abhisek Kundu, ... (+2 more)

cs.DS 🏛 ACM TKDD 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Minimum Weight Perfect Matching via Blossom Belief Propagation

Sungsoo Ahn, Sejun Park, ... (+2 more)

cs.DS 🏛 NeurIPS 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches

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

cs.DS 🏛 TCS 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence

Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter

cs.DS 🏛 SIAM Journal on Discrete Mathematics 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Finding Two Edge-Disjoint Paths with Length Constraints

Leizhen Cai, Junjie Ye

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

R.I.P. 👻 Ghosted

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs

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

cs.DS 🏛 ESA 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences

Matúš Mihalák, Przemysław Uznański, Pencho Yordanov

cs.DS 🏛 ICAAC W 📚 8 cites 10 years ago

R.I.P. 👻 Ghosted

Optimal Online Algorithms for the Multi-Objective Time Series Search Problem

Shun Hasegawa, Toshiya Itoh

cs.DS 🏛 ICAC W 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

Using higher-order Fourier analysis over general fields

Arnab Bhattacharyya, Abhishek Bhowmick

cs.DS 🏛 ECCC 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

Anonymous Graph Exploration with Binoculars

Jérémie Chalopin, Emmanuel Godard, Antoine Naudin

cs.DS 🏛 DISC 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

Polynomial-time approximability of the k-Sink Location problem

Rémy Belmonte, Yuya Higashikawa, ... (+2 more)

cs.DS 🏛 arXiv 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

Efficient Computation of the Characteristic Polynomial of a Threshold Graph

Martin Fürer

cs.DS 🏛 TCS 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

A Simple Spectral Algorithm for Recovering Planted Partitions

Sam Cole, Shmuel Friedland, Lev Reyzin

cs.DS 🏛 arXiv 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

Derivation of a low multiplicative complexity algorithm for multiplying hyperbolic octonions

Aleksandr Cariow, Galina Cariowa, Jaroslaw Knapinski

cs.DS 🏛 arXiv 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

Smaller Selection Networks for Cardinality Constraints Encoding

Michał Karpiński, Marek Piotrów

cs.DS 🏛 CP 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

Adaptive Search over Sorted Sets

Biagio Bonasera, Emilio Ferrara, ... (+3 more)

cs.DS 🏛 J. Discrete Algorithms 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

An improved lower bound for one-dimensional online unit clustering

Jun Kawahara, Koji M. Kobayashi

cs.DS 🏛 TCS 📚 8 cites 11 years ago

R.I.P. 👻 Ghosted

A practical index for approximate dictionary matching with few mismatches

Aleksander Cisłak, Szymon Grabowski

cs.DS 🏛 Computing and informatics 📚 8 cites 11 years ago