🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Constant-time connectivity tests

Philipp Klaus Krause

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem

Dorit S. Hochbaum, Xu Rao

cs.DS 🏛 Operations Research Letters 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Efficient Estimation of Graph Trussness

Alessio Conte, Roberto Grossi, ... (+2 more)

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Travelling salesman paths on Demidenko matrices

Eranda Cela, Vladimir G. Deineko, Gerhard J. Woeginger

cs.DS 🏛 DAM 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs

Thomas Bellitto, Shaohua Li, ... (+3 more)

cs.DS 🏛 ISAAC 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability

Tesshu Hanaka, Yasuaki Kobayashi, ... (+2 more)

cs.DS 🏛 TCS 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Sampling an Edge Uniformly in Sublinear Time

Jakub Tětek

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs

Lutz Oettershagen, Anne Driemel, Petra Mutzel

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

A Normal Sequence Compressed by PPM$^*$ but not by Lempel-Ziv 78

Liam Jordon, Philippe Moser

cs.DS 🏛 ICCTTPI 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Backtracking algorithms for constructing the Hamiltonian decomposition of a 4-regular multigraph

Alexander V. Korostil, Andrei V. Nikolaev

cs.DS 🏛 Automatic Control and Computer Sciences 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

A performance study of some approximation algorithms for minimum dominating set in a graph

Jonathan S. Li, Rohan Potru, Farhad Shahrokhi

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

A Lightweight Algorithm to Uncover Deep Relationships in Data Tables

Jin Cao, Yibo Zhao, ... (+2 more)

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

The k-interchange-constrained diameter of a transit network: A connectedness indicator that accounts for travel convenience

Nassim Dehouche

cs.DS 🏛 Transportation letters 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods

Antonios Antoniadis, Sándor Kisfaludi-Bak, ... (+2 more)

cs.DS 🏛 Scandinavian Workshop on Algorithm Theory 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

O'Reach: Even Faster Reachability in Large Graphs

Kathrin Hanauer, Christian Schulz, Jonathan Trummer

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Efficient Hierarchical Clustering for Classification and Anomaly Detection

Ishita Doshi, Sreekalyan Sajjalla, ... (+3 more)

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem

Magnus Lie Hetland

cs.DS 🏛 Similarity Search and Applications 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Optimal algorithm for computing Steiner 3-eccentricities of trees

Aleksandar Ilic

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification

Antares Chen, Jonathan Shi, Luca Trevisan

cs.DS 🏛 SODA 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Soft Sequence Heaps

Gerth Stølting Brodal

cs.DS 🏛 SOSA 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

Marek Cygan, Magnús M. Halldórsson, Guy Kortsarz

cs.DS 🏛 ICAOA W 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Erratum: Fast and Simple Horizontal Coordinate Assignment

Ulrik Brandes, Julian Walter, Johannes Zink

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Total Domination in Unit Disk Graphs

Sangram K. Jena, Gautam K. Das

cs.DS 🏛 arXiv 📚 1 cites 5 years ago

R.I.P. 👻 Ghosted

Approximate Covering with Lower and Upper Bounds via LP Rounding

Sayan Bandyapadhyay, Aniket Basu Roy

cs.DS 🏛 arXiv 📚 1 cites 5 years ago