Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach

A Unified Framework for Approximating Multiway Partition Problems

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science

A New Partitioning Strategy Based on Supermodular Functions

VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications

An Efficient Practical Heuristic For Good Ratio-Cut Partitioning

VLSID '03 Proceedings of the 16th International Conference on VLSI Design

The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function

Discrete Applied Mathematics - Submodularity

Improving graph partitions using submodular functions

Discrete Applied Mathematics - Submodularity

Finding dense and isolated submarkets in a sponsored search spending graph

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management

Key figure impact in trust-enhanced recommender systems

AI Communications - Recommender Systems

Detecting critical nodes in sparse graphs

Computers and Operations Research

On the k-cut problem

Operations Research Letters

Critical infrastructure management for telecommunication networks

AMT'12 Proceedings of the 8th international conference on Active Media Technology