Incremental reconfiguration of multi-FPGA systems
FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays
The general Steiner tree-star problem
Information Processing Letters
New Results for Energy-Efficient Broadcasting in Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Mobile backbone networks --: construction and maintenance
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Improved approximation algorithms for connected sensor cover
Wireless Networks
Sharing the cost of multicast transmissions in wireless networks
Theoretical Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Packing element-disjoint steiner trees
ACM Transactions on Algorithms (TALG)
Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks
Journal of Parallel and Distributed Computing
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
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
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph
Theoretical Computer Science
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Theoretical Computer Science
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
Theoretical Computer Science
Combinatorial optimization in system configuration design
Automation and Remote Control
ACM Transactions on Algorithms (TALG)
Construction and Maintenance of Wireless Mobile Backbone Networks
IEEE/ACM Transactions on Networking (TON)
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Approximating node-weighted multicast trees in wireless ad-hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
On the complexity of the regenerator placement problem in optical networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Coverage and connected coverage problems for sensors embedded in a temperature-sensitive environment
International Journal of Sensor Networks
Minimum-energy broadcast with few senders
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
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
K-connected target coverage problem in wireless sensor networks
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Approximating Steiner networks with node weights
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Efficient k-shot broadcasting in radio networks
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
On the complexity of the regenerator placement problem in optical networks
IEEE/ACM Transactions on Networking (TON)
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
Journal of Combinatorial Optimization
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Non-metric multicommodity and multilevel facility location
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Packing element-disjoint steiner trees
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
On the minimization of the number of forwarding nodes for multicast in wireless ad hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximating minimum power covers of intersecting families and directed connectivity problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Minimum-Cost broadcast through varying-size neighborcast
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Energy and time efficient broadcasting in known topology radio networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Flooding countries and destroying dams
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Information and Computation
| Hi-index | 0.01 |