An improved approximation algorithm for multiway cut
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Coign automatic distributed partitioning system
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Logical analysis of data with decomposable structures
Theoretical Computer Science
Improved results for directed multicut
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Logical Analysis of Data with Decomposable Structures
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Multiway cuts in node weighted graphs
Journal of Algorithms
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
On generalized greedy splitting algorithms for multiway partition problems
Discrete Applied Mathematics
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics - Special issue: Max-algebra
Improved approximation for directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the Approximability of Some Haplotyping Problems
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics
FPT algorithms for path-transversals and cycle-transversals problems in graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A heuristic method for the minimum toll booth problem
Journal of Global Optimization
Proceedings of the forty-third annual ACM symposium on Theory of computing
Register loading via linear programming
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
New results on rationality and strongly polynomial time solvability in eisenberg-gale markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for the database layout problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
Cuts and disjoint paths in the valley-free path model of internet BGP routing
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
From static code distribution to more shrinkage for the multiterminal cut
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
The maximum integer multiterminal flow problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
The maximum integer multiterminal flow problem in directed graphs
Operations Research Letters
FPT algorithms for path-transversal and cycle-transversal problems
Discrete Optimization
Parameterized tractability of multiway cut with parity constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Transforming commodity security policies to enforce Clark-Wilson integrity
Proceedings of the 28th Annual Computer Security Applications Conference
The complexity of multicut and mixed multicut problems in (di)graphs
Theoretical Computer Science
| Hi-index | 0.00 |