Approximating the minimum strongly connected subgraph via a matching lower bound
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem
Information Processing Letters
Special edges, and approximating the smallest directed k-edge connected spanning subgraph
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The minimum spanning strong subdigraph problem is fixed parameter tractable
Discrete Applied Mathematics
Approximating Transitive Reductions for Directed Networks
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A rounding by sampling approach to the minimum size k-arc connected subgraph problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A novel method for signal transduction network inference from indirect experimental evidence
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
| Hi-index | 0.04 |