Spanning Trees with Bounded Number of Branch Vertices
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Directed Minimum-Degree Spanning Tree Problem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Euclidean bounded-degree spanning tree ratios
Proceedings of the nineteenth annual symposium on Computational geometry
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
The minimum degree spanning tree problem on directed acyclic graphs
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Matroidal degree-bounded minimum spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |