Provably good global buffering by multi-terminal multicommodity flow approximation
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The general Steiner tree-star problem
Information Processing Letters
Integrality ratio for group Steiner trees and directed steiner trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Practical Approximation Algorithms for Separable Packing Linear Programs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Directed Trees in Multicast Routing
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
Steiner diagrams and k-star hubs
Journal of Discrete Algorithms
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
Inapproximability of Survivable Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Combinatorial optimization in system configuration design
Automation and Remote Control
Inapproximability of survivable networks
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A note on Rooted Survivable Networks
Information Processing Letters
Approximating Node-Connectivity Augmentation Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Trees of shortest paths vs. Steiner trees: understanding and improving delete relaxation heuristics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
ACM Transactions on Algorithms (TALG)
Online multicasting in WDM networks with shared light splitter bank
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
On computing compression trees for data collection in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Finding effectors in social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Minimum-energy multicast tree in cognitive radio networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Approximation algorithm for the minimum directed tree cover
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Approximating directed buy-at-bulk network design
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Fast object detection using steiner tree
Machine Graphics & Vision International Journal
Register loading via linear programming
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
Approximating rooted Steiner networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
The generalized deadlock resolution problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On a class of branching problems in broadcasting and distribution
Computers and Operations Research
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The polymatroid steiner problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Nearly complete graphs decomposable into large induced matchings and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Sort-sharing-aware query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms (TALG)
Multi-rooted greedy approximation of directed steiner trees with applications
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On some network design problems with degree constraints
Journal of Computer and System Sciences
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science
Fast semantic object search and detection for vegetable trading information using Steiner tree
Artificial Intelligence Review
The subdivision-constrained routing requests problem
Journal of Combinatorial Optimization
| Hi-index | 0.02 |