A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved algorithms for submodular function minimization and submodular flow
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Equitable cost allocations via primal-dual-type algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A fully combinatorial algorithm for submodular function minimization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A fully combinatorial algorithm for submodular function minimization
Journal of Combinatorial Theory Series B
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Bisubmodular Function Minimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Faster Scaling Algorithm for Minimizing Submodular Functions
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization
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 Testing Convexity and Submodularity
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Discrete Applied Mathematics
Improved bound for the Carathéodory rank of the bases of a matroid
Journal of Combinatorial Theory Series B
A note on Schrijver's submodular function minimization algorithm
Journal of Combinatorial Theory Series B
Discrete Applied Mathematics - Submodularity
Discrete Applied Mathematics - Submodularity
A note on the minimization of symmetric and general submodular functions
Discrete Applied Mathematics - Submodularity
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete Applied Mathematics
Traveling salesman games with the Monge property
Discrete Applied Mathematics
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Biased positional games on matroids
European Journal of Combinatorics
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of soft constraint satisfaction
Artificial Intelligence
An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Journal of Combinatorial Theory Series B
Eisenberg-Gale markets: algorithms and structural properties
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A Linear Programming Approach to Max-Sum Problem: A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimum transversals in posi-modular systems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for prize collecting forest problems with submodular penalty functions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
On Convex Minimization over Base Polytopes
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Classes of Submodular Constraints Expressible by Graph Cuts
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Vulnerability parameters of split graphs
International Journal of Computer Mathematics
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science
A unified approach to distance-two colouring of planar graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating submodular functions everywhere
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A simple combinatorial algorithm for submodular function minimization
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Introduction to the Maximum Solution Problem
Complexity of Constraints
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Earliest Arrival Flows with Multiple Sources
Mathematics of Operations Research
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
Discrete Applied Mathematics
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows
International Journal of Computer Vision
Note: The expressive power of binary submodular functions
Discrete Applied Mathematics
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Global optimization for first order Markov Random Fields with submodular priors
Discrete Applied Mathematics
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
The complexity of soft constraint satisfaction
Artificial Intelligence
Fairness in multiuser systems with polymatroid capacity region
IEEE Transactions on Information Theory
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Low complexity cross-layer design for dense interference networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The complexity of valued constraint models
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Beamforming and rate allocation in MISO cognitive radio networks
IEEE Transactions on Signal Processing
Multi-document summarization via budgeted maximization of submodular functions
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
A max-flow/min-cut algorithm for a class of wireless networks
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Mathematics of Operations Research
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
Submodular function minimization under a submodular set covering constraint
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Minimizing count-based high order terms in markov random fields
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Submodularity on a tree: unifying L-convex and bisubmodular functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Min CSP on four elements: moving beyond submodularity
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Submodular maximization by simulated annealing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Generalised integer programming based on logically defined relations
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
Journal of the ACM (JACM)
On the complexity of submodular function minimisation on diamonds
Discrete Optimization
A strongly polynomial algorithm for line search in submodular polyhedra
Discrete Optimization
Separation of partition inequalities with terminals
Discrete Optimization
Separation of partition inequalities for the (1,2)-survivable network design problem
Operations Research Letters
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Submodular minimization via pathwidth
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Towards minimizing k-submodular functions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
Online submodular minimization
The Journal of Machine Learning Research
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
| Hi-index | 0.07 |