Data structures and network algorithms
Data structures and network algorithms
Algorithms for routing around a rectangle
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
On the k-coloring of intervals
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Improved approximation algorithms for embedding hyperedges in a cycle
Information Processing Letters
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Minimum-Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Computers
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Demand Routing and Slotting on Ring Networks
Demand Routing and Slotting on Ring Networks
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
Information Processing Letters
SIAM Journal on Discrete Mathematics
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle
IEEE Transactions on Parallel and Distributed Systems
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.04 |
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1...n] for subsequent queries of the form: "Given indices i, j, what is the index of the minimum value of A[i...j]?" ...