Counting almost minimum cutsets with reliability applications
Mathematical Programming: Series A and B
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Improved time bounds for the maximum flow problem
SIAM Journal on Computing
Introduction to algorithms
An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Can a maximum flow be computed in o(nm) time?
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Cluster analysis for hypertext systems
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A faster algorithm for finding the minimum cut in a directed graph
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A faster deterministic maximum flow algorithm
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A matroid approach to finding edge connectivity and packing arborescences
Selected papers of the 23rd annual ACM symposium on Theory of computing
Implementing an efficient minimum capacity cut algorithm
Mathematical Programming: Series A and B
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Array Distribution in Data-Parallel Programs
LCPC '94 Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing
On Implementing Push-Relabel Method for the Maximum Flow Problem
On Implementing Push-Relabel Method for the Maximum Flow Problem
Implementing a fully polynomial time approximation scheme for all terminal network reliability
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Finding the right cutting planes for the TSP
Journal of Experimental Algorithmics (JEA)
An efficient network flow code for finding all minimum cost s-t cutsets
Computers and Operations Research
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Approach to Cactus Construction Applied to TSP Support Graphs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Finding the Right Cutting Planes for the TSP
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Selecting Problems for Algorithm Evaluation
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Optimal and efficient speculation-based partial redundancy elimination
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Mining closed relational graphs with connectivity constraints
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
A lifetime optimal algorithm for speculative PRE
ACM Transactions on Architecture and Code Optimization (TACO)
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
Computing finest mincut partitions of a graph and application to routing problems
Discrete Applied Mathematics
Exploiting form semantics and validation checks to improve e-form layout
International Journal of Web Engineering and Technology
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The Partial Augment---Relabel Algorithm for the Maximum Flow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Graph Sparsification in the Semi-streaming Model
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A new algorithm for finding faces in wireframes
Computer-Aided Design
Clustering dense graphs: A web site graph paradigm
Information Processing and Management: an International Journal
A component-based approach to verification and validation of formal software models
Architecting dependable systems IV
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A metaheuristic based on fusion and fission for partitioning problems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An SSA-based algorithm for optimal speculative code motion under an execution profile
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Energy-efficient workflow distribution
Proceedings of the 5th International Conference on Communication System Software and Middleware
SlimCuts: graphcuts for high resolution images using graph reduction
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Parallel implementations of gusfield's cut tree algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
An ACO based functional module detection algorithm for protein interaction networks
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Humans for EDA and EDA for humans
Proceedings of the 49th Annual Design Automation Conference
Finding maximal k-edge-connected subgraphs from a large graph
Proceedings of the 15th International Conference on Extending Database Technology
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
A framework for exploring organizational structure in dynamic social networks
Decision Support Systems
Spotting code optimizations in data-parallel pipelines through PeriSCOPE
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
A fast method for global depth-map extraction from natural images
Proceedings of the 9th European Conference on Visual Media Production
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |