Integer and combinatorial optimization
Integer and combinatorial optimization
Computer networks
A copy network with shared buffers for large-scale multicast ATM switching
IEEE/ACM Transactions on Networking (TON)
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Low-Degree Spanning Trees of Small Weight
SIAM Journal on Computing
DEGREE-CONSTRAINED MULTICASTING IN POINT-TO-POINT NETWORKS
DEGREE-CONSTRAINED MULTICASTING IN POINT-TO-POINT NETWORKS
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Spanning Trees with Bounded Number of Branch Vertices
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Directed Minimum-Degree Spanning Tree Problem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Bicriteria Spanning Tree Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Euclidean bounded-degree spanning tree ratios
Proceedings of the nineteenth annual symposium on Computational geometry
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Hierarchical topological network design
IEEE/ACM Transactions on Networking (TON)
Spanning trees with minimum weighted degrees
Information Processing Letters
There are spanning spiders in dense graphs (and we know how to find them)
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Distributed algorithm for a color assignment on asynchronous rings
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The minimum degree spanning tree problem on directed acyclic graphs
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Review: From wireless sensor networks towards cyber physical systems
Pervasive and Mobile Computing
What would edmonds do? augmenting paths and witnesses for degree-bounded MSTs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Delegate and conquer: an LP-based approximation algorithm for minimum degree MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Improved algorithm for degree bounded survivable network design problem
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |