A Hypergraph Framework for Optimal Model-Based Decomposition ofDesign Problems
Computational Optimization and Applications
Increasing the weight of minimum spanning trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Semidefinite Relaxation of the k -Partition Polytope Is Strong
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Unified Framework for Approximating Multiway Partition Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On generalized greedy splitting algorithms for multiway partition problems
Discrete Applied Mathematics
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
An analysis of graph cut size for transductive learning
ICML '06 Proceedings of the 23rd international conference on Machine learning
Minimum cost subpartitions in graphs
Information Processing Letters
Minimum k-way cuts via deterministic greedy tree packing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Finding minimum 3-way cuts in hypergraphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Finding minimum 3-way cuts in hypergraphs
Information Processing Letters
Algorithms for multiterminal cuts
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN
Wireless Personal Communications: An International Journal
Minimum d-blockers and d-transversals in graphs
Journal of Combinatorial Optimization
GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Two-Server network disconnection problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Computing minimum multiway cuts in hypergraphs from hypertree packings
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Optimal cuts in graphs and statistical mechanics
Mathematical and Computer Modelling: An International Journal
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
A new and improved algorithm for the 3-cut problem
Operations Research Letters
Operations Research Letters
Clique cover and graph separation: new incompressibility results
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
An o *(1.84 k) parameterized algorithm for the multiterminal cut problem
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
An O*(1.84k) parameterized algorithm for the multiterminal cut problem
Information Processing Letters
| Hi-index | 0.00 |