Computational geometry: an introduction
Computational geometry: an introduction
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
An optimal synchronizer for the hypercube
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Introduction to algorithms
Generating sparse spanners for weighted graphs
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Cost-sensitive analysis of communication protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
An introduction to parallel algorithms
An introduction to parallel algorithms
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Performance-Driven Global Routing for Cell Based ICs
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
High-performance routing trees with identified critical sinks
DAC '93 Proceedings of the 30th international Design Automation Conference
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the bounded-skew clock and Steiner routing problems
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Timing-driven routing for symmetrical array-based FPGAs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A construction of minimal delay Steiner tree using two-pole delay model
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Energy efficient routing with adaptive data fusion in sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Network correlated data gathering with explicit communication: NP-completeness and algorithms
IEEE/ACM Transactions on Networking (TON)
Timing-driven Steiner trees are (practically) free
Proceedings of the 43rd annual Design Automation Conference
Adaptive Data Fusion for Energy Efficient Routing in Wireless Sensor Networks
IEEE Transactions on Computers
Routing Correlated Data with Fusion Cost in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Utility-based data-gathering in wireless sensor networks with unstable links
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
Network lifetime maximization for time-sensitive data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |