:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ponomarenko, Alexander
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2505.16064
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Greedy Routing in a Sequentially Grown One-Dimensional Random Graph
par: Ponomarenko, Alexander
Publié: (2026)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
par: Khanna, Sanjeev, et autres
Publié: (2025)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
par: Dehghankar, Mohsen, et autres
Publié: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
par: Jansen, Klaus, et autres
Publié: (2025)

Review of Three Algorithms That Build k-d Trees
par: Brown, Russell A.
Publié: (2025)

Merging RLBWTs adaptively
par: Gagie, Travis
Publié: (2025)

Automating the Search for Small Hard Examples to Approximation Algorithms
par: Sharma, Eklavya
Publié: (2025)

Faster Algorithms for Graph Monopolarity
par: Philip, Geevarghese, et autres
Publié: (2024)

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
par: Plank, Benedikt M., et autres
Publié: (2022)

Smoothed Analysis of Dynamic Graph Algorithms
par: Meir, Uri, et autres
Publié: (2025)

Pointwise Lipschitz Continuous Graph Algorithms
par: Liu, Quanquan C., et autres
Publié: (2024)

Succinct Graph Representations and Algorithmic Applications
par: Ullah, Ahammed, et autres
Publié: (2026)

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
par: Bathie, Gabriel, et autres
Publié: (2023)

Finding Induced Subgraphs from Graphs with Small Mim-Width
par: Otachi, Yota, et autres
Publié: (2024)

Graph-Based Algorithms for Diverse Similarity Search
par: Anand, Piyush, et autres
Publié: (2025)

Fast Algorithms for Graph Arboricity and Related Problems
par: Cen, Ruoxu, et autres
Publié: (2025)

Improved Algorithms for Effective Resistance Computation on Graphs
par: Yang, Yichun, et autres
Publié: (2025)

Efficient Kernelization Algorithm for Bipartite Graph Matching
par: Wu, Guang, et autres
Publié: (2024)

Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights
par: Gorbachev, Egor, et autres
Publié: (2024)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
par: Kiran, Mekala, et autres
Publié: (2026)

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
par: Ferber, Asaf, et autres
Publié: (2025)

Streaming Graph Algorithms in the Massively Parallel Computation Model
par: Czumaj, Artur, et autres
Publié: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
par: Borowitz, Jannick, et autres
Publié: (2023)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
par: Assadi, Sepehr, et autres
Publié: (2026)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
par: Zhao, Jingyang, et autres
Publié: (2023)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)

Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM
par: Manoharan, Vignesh, et autres
Publié: (2025)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
par: Peng, Pan, et autres
Publié: (2026)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
par: Honorato-Droguett, Nicolás, et autres
Publié: (2023)

Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments
par: Ansaripour, Matin, et autres
Publié: (2024)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
par: Ashvinkumar, Vikrant, et autres
Publié: (2024)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
par: Bansal, Nikhil, et autres
Publié: (2026)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
par: Abboud, Amir, et autres
Publié: (2023)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
par: Sinhal, Anay, et autres
Publié: (2026)

Real-World Graph Analysis: Techniques for Static, Dynamic, and Temporal Communities
par: Rucci, Davide
Publié: (2024)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
par: Ding, Xiangyun, et autres
Publié: (2025)