:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Das, Sajal K., Dhar, Amit Kumar, Gorain, Barun, Mahawar, Madhuri
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2410.17542
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
by: Gaur, Gaurav, et al.
Published: (2025)

Forest Covers and Bounded Forest Covers
by: Gaur, Daya Ram, et al.
Published: (2024)

Optimal Unlabeled Pebble Motion on Trees and its Application to Multi-Agent Path Finding
by: Calvi, Annalisa, et al.
Published: (2026)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
by: Shovan, S. M., et al.
Published: (2025)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
by: Asadi, Vahid R., et al.
Published: (2026)

Clustering What Matters in Constrained Settings
by: Jaiswal, Ragesh, et al.
Published: (2023)

Graph Traversal via Connected Mobile Agents
by: Jana, Saswata, et al.
Published: (2025)

FPT Approximation for Capacitated Sum of Radii
by: Jaiswal, Ragesh, et al.
Published: (2024)

Robust-Sorting and Applications to Ulam-Median
by: Jaiswal, Ragesh, et al.
Published: (2025)

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
by: Choudhary, Keerti, et al.
Published: (2025)

Collision-Free Robot Scheduling
by: Adamson, Duncan, et al.
Published: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
by: Das, Syamantak, et al.
Published: (2024)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
by: Dhar, Saurav, et al.
Published: (2024)

Adaptive Hashing: Faster Hash Functions with Fewer Collisions
by: Melis, Gábor
Published: (2026)

Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
by: Joshi, Amit
Published: (2025)

Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
by: Joshi, Amit
Published: (2025)

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
by: Dogeas, Konstantinos, et al.
Published: (2023)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
by: Sinhal, Anay, et al.
Published: (2026)

A Gentle Wakeup Call: Symmetry Breaking with Less Collision Cost
by: Biswas, Umesh, et al.
Published: (2025)

Fast Algorithms for Minimum Homology Basis
by: Dhar, Amritendu, et al.
Published: (2021)

Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries
by: Adar, Tomer, et al.
Published: (2026)

Finding missing items requires strong forms of randomness
by: Chakrabarti, Amit, et al.
Published: (2023)

Exploration of Always $S$-Connected Temporal Graphs
by: Adamson, Duncan, et al.
Published: (2026)

Graph Exploration with Edge Weight Estimates
by: Gehnen, Matthias, et al.
Published: (2025)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
by: Bhore, Sujoy, et al.
Published: (2026)

Optimal Neighborhood Exploration for Dynamic Independent Sets
by: Borowitz, Jannick, et al.
Published: (2024)

Graph Exploration: The Impact of a Distance Constraint
by: Devismes, Stéphane, et al.
Published: (2024)

Rapid Exploration of Assembly Chemical Space of Molecular Graphs
by: Seet, Ian, et al.
Published: (2024)

Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries
by: Adar, Tomer, et al.
Published: (2024)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
by: Ganz, Amit, et al.
Published: (2023)

When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
by: Adar, Tomer, et al.
Published: (2026)

Support Testing in the Huge Object Model
by: Adar, Tomer, et al.
Published: (2023)

Optimal mass estimation in the conditional sampling model
by: Adar, Tomer, et al.
Published: (2025)

Exact Algorithms for Resource Reallocation Under Budgetary Constraints
by: Das, Arun Kumar, et al.
Published: (2025)

Minimizing Envy and Maximizing Happiness in Graphical House Allocation
by: Dhar, Anubhav, et al.
Published: (2025)

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
by: Brakensiek, Joshua, et al.
Published: (2025)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
by: Cabello, Sergio, et al.
Published: (2021)

A Lock-free Binary Trie
by: Ko, Jeremy
Published: (2024)

Learning-Augmented Algorithms for $k$-median via Online Learning
by: Hebbar, Anish, et al.
Published: (2026)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
by: Das, Rathish, et al.
Published: (2025)