Optimal phase conflict removal for layout of dark field alternating phase shifting masks
ISPD '99 Proceedings of the 1999 international symposium on Physical design
On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Heuristic algorithms for packing of multiple-group multicasting
Computers and Operations Research
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy
Journal of Global Optimization
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Primal-dual approaches to the Steiner problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Extending Reduction Techniques for the Steiner Tree Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Distributed Virtual Backbone Development Scheme for Ad-Hoc Wireless Networks
Wireless Personal Communications: An International Journal
AMRST: adaptive multicast routing protocol for satellite-terrestrial networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
The weighted farthest color Voronoi diagram on trees and graphs
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
A new algorithm for layout of dark field alternating phase shifting masks
GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
A subset spanner for Planar graphs,: with application to subset TSP
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Parallelization of local search for Euclidean Steiner tree problem
Proceedings of the 44th annual Southeast regional conference
A factoring approach for the Steiner tree problem in undirected networks
Information Sciences: an International Journal
Use of ranked cross document evidence trails for hypothesis generation
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree
Proceedings of the 2008 international symposium on Physical design
Energy and switch area optimizations for FPGA global routing architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Two-site Voronoi diagrams in geographic networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Graph-Theoretic Concepts in Computer Science
Discrete Applied Mathematics
High-performance obstacle-avoiding rectilinear steiner tree construction
ACM Transactions on Design Automation of Electronic Systems (TODAES)
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Efficient processing of group-oriented connection queries in a large graph
Proceedings of the 18th ACM conference on Information and knowledge management
Fast approximation of minimum multicast congestion: implementation versus theory
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A hybrid VNS for connected facility location
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Hybrid numerical optimization for combinatorial network problems
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
A bi-criteria approach for Steiner's tree problems in communication networks
Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Approximation of octilinear steiner trees constrained by hard and soft obstacles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Energy efficient broadcasting and multicasting in static wireless ad hoc networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks
Proceedings of the 7th International Conference on Network and Services Management
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Round-trip voronoi diagrams and doubling density in geographic networks
Transactions on Computational Science XIV
Contraction-based steiner tree approximations in practice
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction
Proceedings of the 49th Annual Design Automation Conference
Faster and simpler approximation of stable matchings
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Network forensics: random infection vs spreading epidemic
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Capacitated team formation problem on social networks
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Active node determination for correlated data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles
Proceedings of the 2014 on International symposium on physical design
Hi-index | 0.89 |