Low degree spanning trees of small weight
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
The drawability problem for minimum weight triangulations
Theoretical Computer Science
Computational Geometry: Theory and Applications
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Euclidean bounded-degree spanning tree ratios
Proceedings of the nineteenth annual symposium on Computational geometry
Proximity drawings in polynomial area and volume
Computational Geometry: Theory and Applications
ACM Transactions on Algorithms (TALG)
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Adaptive design optimization of wireless sensor networks using genetic algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Symmetric range assignment with disjoint MST constraints
Proceedings of the fifth international workshop on Foundations of mobile computing
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
The Euclidean degree-4 minimum spanning tree problem is NP-hard
Proceedings of the twenty-fifth annual symposium on Computational geometry
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Probabilistic analysis of the degree bounded minimum spanning tree problem
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Polynomial area bounds for MST embeddings of trees
GD'07 Proceedings of the 15th international conference on Graph drawing
On convex greedy embedding conjecture for 3-connected planar graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Theoretical Computer Science
Relay placement for fault tolerance in wireless networks in higher dimensions
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Polynomial area bounds for MST embeddings of trees
Computational Geometry: Theory and Applications
On the area requirements of Euclidean minimum spanning trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
On the topologies of local minimum spanning trees
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Degree-bounded minimum spanning tree for unit disk graph
Theoretical Computer Science
Drawing a tree as a minimum spanning tree approximation
Journal of Computer and System Sciences
Equilibria for broadcast range assignment games in ad-hoc networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Succinct greedy drawings do not always exist
GD'09 Proceedings of the 17th international conference on Graph Drawing
Degree constrained minimum spanning tree problem: a learning automata approach
The Journal of Supercomputing
On the area requirements of Euclidean minimum spanning trees
Computational Geometry: Theory and Applications
Hi-index | 0.00 |