cs.DS

Papers

• Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing (2026)
  Markus Ahrens et al.
  6.81
• The Kernighan-Lin Search Algorithm (2025)
  Ali Dasdan
  6.00
• Graph-Based Algorithms for Diverse Similarity Search (2025)
  Piyush Anand et al.
  5.24
• The Power of Recursive Embeddings for $\ell_p$ Metrics (2025)
  Robert Krauthgamer et al.
  5.24
• Differentially Private High-Dimensional Approximate Range Counting, Revisited (2025)
  Martin Aum\"uller et al.
  2.26
• Extending the Applicability of Bloom Filters by Relaxing their Parameter Constraints (2025)
  Paul Walther et al.
  2.26
• Local Search for Clustering in Almost-linear Time (2025)
  Shaofeng H.-C. Jiang et al.
  2.26
• Searching in trees with $k$-up-modular cost functions (2025)
  Micha{\l} Szyfelbein
  2.26
• Cheesemap: A High-Performance Point-Indexing Data Structure for Neighbor Search in LiDAR Data (2025)
  Ruben Laso et al.
  0.00
• Linked Array Tree: A Constant-Time Search Structure for Big Data (2025)
  Songpeng Liu
  0.00
• Automating the Search for Small Hard Examples to Approximation Algorithms (2025)
  Eklavya Sharma
  0.00
• Indexing Strings with Utilities (2025)
  Giulia Bernardini and Huiping Chen and Alessio Conte and Roberto Grossi and Veronica Guerrini and Grigorios Loukides and Nadia Pisanti and and Solon P. Pissis
  0.00
• k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation (2016)
  Tenindra Abeywickrama et al.
  —
• The complexity of bit retrieval (2016)
  Veit Elser
  —
• Streaming Similarity Self-Join (2016)
  Gianmarco De Francisci Morales and Aristides Gionis
  —
• Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array (2016)
  German Tischler
  —
• Faster Longest Common Extension Queries in Strings over General Alphabets (2016)
  Pawe{\l} Gawrychowski et al.
  —
• Accelerating Local Search for the Maximum Independent Set Problem (2016)
  Jakob Dahlum et al.
  —
• Parallel Ordered Sets Using Join (2016)
  Guy Blelloch and Daniel Ferizovic and Yihan Sun
  —
• Scalability and Total Recall with Fast CoveringLSH (2016)
  Ninh Pham et al.
  —
• A representation of a compressed de Bruijn graph for pan-genome analysis that enables search (2016)
  Timo Beller and Enno Ohlebusch
  —
• Randomized approximate nearest neighbor search with limited adaptivity (2016)
  Mingmou Liu et al.
  —
• Distortion-Resistant Hashing for rapid search of similar DNA subsequence (2016)
  Jarek Duda
  —
• 2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search (2016)
  Ping Li et al.
  —
• siEDM: an efficient string index and search algorithm for edit distance with moves (2016)
  Yoshimasa Takabatake et al.
  —
• Fast Online k-nn Graph Building (2016)
  Thibault Debatty et al.
  —
• Fast Cross-Polytope Locality-Sensitive Hashing (2016)
  Christopher Kennedy et al.
  —
• Exact Weighted Minwise Hashing in Constant Time (2016)
  Anshumali Shrivastava
  —
• Compressing Graphs and Indexes with Recursive Graph Bisection (2017)
  Laxman Dhulipala and Igor Kabiljo and Brian Karrer and Giuseppe Ottaviano and Sergey Pupyrev and Alon Shalita
  —
• Computing Shortest Paths Using A*, Landmarks, and Polygon Inequalities (Abstract) (2016)
  Newton Campbell Jr
  —
• Aggregated 2D Range Queries on Clustered Points (2016)
  Nieves R. Brisaboa et al.
  —
• Near-Isometric Binary Hashing for Large-scale Datasets (2016)
  Amirali Aghazadeh et al.
  —
• Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem (2016)
  Mohamed El Yafrani and Bela\"id Ahiod
  —
• A Generic Inverted Index Framework for Similarity Search on the GPU - Technical Report (2018)
  Jingbo Zhou et al.
  —
• Local Search Yields a PTAS for k-Means in Doubling Metrics (2017)
  Zachary Friggstad et al.
  —
• Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs (2018)
  Yu. A. Malkov et al.
  —
• Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics (2016)
  Vincent Cohen-Addad and Philip N. Klein and Claire Mathieu
  —
• New Error Tolerant Method to Search Long Repeats in Symbol Sequences (2016)
  Sergey Tsarev et al.
  —
• Simultaneous Nearest Neighbor Search (2016)
  Piotr Indyk et al.
  —
• Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications (2020)
  Haim Kaplan et al.
  —
• Data Structure Lower Bounds for Document Indexing Problems (2016)
  Peyman Afshani and Jesper Sindahl Nielsen
  —
• Weighted domination number of cactus graphs (2016)
  Tina Novak et al.
  —
• Indexing Variation Graphs (2017)
  Jouni Sir\'en
  —
• Faster Average Case Low Memory Semi-External Construction of the Burrows-Wheeler Transform (2016)
  German Tischler
  —
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (2017)
  Shunji Umetani
  —
• Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique (2026)
  Priyam Das
  —
• Rank and select: Another lesson learned (2016)
  Szymon Grabowski et al.
  —
• A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering (2016)
  Tobias Christiani
  —
• Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors (2016)
  Alexandr Andoni et al.
  —
• Robin Hood Hashing really has constant average search cost and variance in full tables (2016)
  Patricio V. Poblete and Alfredo Viola
  —