Composite Programs: Hierarchical Construction, Circularity, and Deadlocks
IEEE Transactions on Software Engineering
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximation alogorithms for the maximum acyclic subgraph problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Fast and Effective Algorithm for the Feedback Arc Set Problem
Journal of Heuristics
Solving problems for maximal reducible flowgraphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A contraction algorithm for finding minimal feedback sets
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
An efficient algorithm for finding maximum cycle packings in reducible flow graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |