The deferred path heuristic for the generalized tree alignment problem
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
The rectilinear Steiner tree problem: algorithms and examples using permutations of the terminal set
ACM-SE 37 Proceedings of the 37th annual Southeast regional conference (CD-ROM)
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A new heuristic for rectilinear Steiner trees
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
On the terminal Steiner tree problem
Information Processing Letters
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
IEEE/ACM Transactions on Networking (TON)
Efficient gathering of correlated data in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Energy-conserving data cache placement in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Cache placement in sensor networks under an update cost constraint
Journal of Discrete Algorithms
On the partial terminal Steiner tree problem
The Journal of Supercomputing
Automated antenna positioning algorithms for wireless fixed-access networks
Journal of Heuristics
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Approximating the Generalized Capacitated Tree-Routing Problem
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximation algorithms for constrained generalized tree alignment problem
Discrete Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the full and bottleneck full Steiner tree problems
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
An improved approximation algorithm for the terminal Steiner tree problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Bounding the payment of approximate truthful mechanisms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Cache placement in sensor networks under update cost constraint
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Contraction-based steiner tree approximations in practice
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity
| Hi-index | 0.00 |