On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
Information Processing Letters
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
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
Information Processing Letters
On packing and coloring hyperedges in a cycle
Discrete Applied Mathematics
A polynomial-time approximation scheme for embedding hypergraph in a cycle
ACM Transactions on Algorithms (TALG)
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
Information Processing Letters
On packing and coloring hyperedges in a cycle
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An approximation algorithm for embedding a directed hypergraph on a ring
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
Journal of Combinatorial Optimization
| Hi-index | 0.89 |