Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Increasing digraph arc-connectivity by arc addition, reversal and complement
Discrete Applied Mathematics
Subgraphs decomposable into two trees andk-edge-connected subgraphs
Discrete Applied Mathematics
An Extension of a Theorem of Henneberg and Laman
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
Constructive characterizations for packing and covering with trees
Discrete Applied Mathematics - Submodularity
On the existence of k edge-disjoint 2-connected spanning subgraphs
Journal of Combinatorial Theory Series B
Simultaneous well-balanced orientations of graphs
Journal of Combinatorial Theory Series B
On constructive characterizations of (k,l)-sparse graphs
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Approximating Directed Weighted-Degree Constrained Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
On minimum power connectivity problems
Journal of Discrete Algorithms
Rigidity, global rigidity, and graph decomposition
European Journal of Combinatorics
On minimum power connectivity problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Theoretical Computer Science
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
Approximating survivable networks with minimum number of Steiner points
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Ends and Vertices of Small Degree in Infinite Minimally $k$-(Edge)-Connected Graphs
SIAM Journal on Discrete Mathematics
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
Sparse certificates and removable cycles in l-mixed p-connected graphs
Operations Research Letters
A Chain Theorem for $3^+$-Connected Graphs
SIAM Journal on Discrete Mathematics
Multiflows in symmetric digraphs
Discrete Applied Mathematics
| Hi-index | 0.00 |