Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing
IEEE Transactions on Computers
A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Algorithms for graphic polymatroids and parametric s-Sets
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for robustness in matroid optimization
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for the quickest transshipment problem with zero transit times
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A new property and a faster algorithm for baseball elimination
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing weighted completion time on a single machine
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for image segmentation, Markov random fields and related problems
Journal of the ACM (JACM)
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Stability Analysis in Optimization Problems on Matroids in the Metric l_1
Cybernetics and Systems Analysis
Submodular Functions in Problems of Synthesis of Networks
Cybernetics and Systems Analysis
Complexity of finding dense subgraphs
Discrete Applied Mathematics
Parametric analysis of overall min-cuts and applications in undirected networks
Information Processing Letters
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Universally Maximum Flow with Piecewise-Constant Capacities
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Representing Graph Metrics with Fewest Edges
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Greedy approximation algorithms for finding dense components in a graph
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Minimizing a Convex Cost Closure Set
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Parametric min-cuts analysis in a network
Discrete Applied Mathematics
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems
IEEE Transactions on Computers
Discrete Applied Mathematics - Submodularity
Improving graph partitions using submodular functions
Discrete Applied Mathematics - Submodularity
Multiple Job Scheduling in a Connection-Limited Data Parallel System
IEEE Transactions on Parallel and Distributed Systems
The complexity of detecting fixed-density clusters
Discrete Applied Mathematics
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
Journal of Mathematical Imaging and Vision
The quadratic knapsack problem-a survey
Discrete Applied Mathematics
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding dense and isolated submarkets in a sponsored search spending graph
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
An algorithm for improving graph partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A local algorithm for finding dense subgraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed algorithms for secure multipath routing in attack-resistant networks
IEEE/ACM Transactions on Networking (TON)
Extracting and ranking viral communities using seeds and content similarity
Proceedings of the nineteenth ACM conference on Hypertext and hypermedia
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On Convex Minimization over Base Polytopes
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
An Experimental Evaluation of Probabilistic Simulation
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A Space-Efficient Probabilistic Simulation Algorithm
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Earliest Arrival Flows with Multiple Sources
Mathematics of Operations Research
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows
International Journal of Computer Vision
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Approximating the Minimum Chain Completion problem
Information Processing Letters
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A Structure Theory for the Parametric Submodular Intersection Problem
Mathematics of Operations Research
Local search for balanced submodular clusterings
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Discrete Applied Mathematics
Recognizing places using spectrally clustered local matches
Robotics and Autonomous Systems
Energy optimal schedules for jobs with multiple active intervals
Theoretical Computer Science
The complexity of detecting fixed-density clusters
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Flow faster: efficient decision algorithms for probabilistic simulations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Experimental evaluation of parametric max-flow algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
Deciding simulations on probabilistic automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
A local algorithm for finding dense subgraphs
ACM Transactions on Algorithms (TALG)
The role of max-min fairness in DOCSIS 3.0 downstream channel bonding
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Algorithms and theory of computation handbook
Energy minimization under constraints on label counts
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Submodular fractional programming for balanced clustering
Pattern Recognition Letters
Incremental learning in the energy minimisation framework for interactive segmentation
Proceedings of the 32nd DAGM conference on Pattern recognition
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Mathematics of Operations Research
Balancing algorithm for the minimum flow problem in parametric bipartite networks
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Solving maximum flow problems on real-world bipartite graphs
Journal of Experimental Algorithmics (JEA)
Approximating minimum cut with bounded size
INOC'11 Proceedings of the 5th international conference on Network optimization
Convex and Network Flow Optimization for Structured Sparsity
The Journal of Machine Learning Research
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Dense subgraph problems with output-density conditions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Domain decomposition methods with graph cuts algorithms for total variation minimization
Advances in Computational Mathematics
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Community detection in Social Media
Data Mining and Knowledge Discovery
Polynomiality of sparsest cuts with fixed number of sources
Operations Research Letters
Computer Science Review
Ordered optimal solutions and parametric minimum cut problems
Discrete Optimization
Erratum: Baseball playoff eliminations: An application of linear programming
Operations Research Letters
Object Recognition by Sequential Figure-Ground Ranking
International Journal of Computer Vision
Finding dense subgraphs of sparse graphs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Multi-server generalized processor sharing
Proceedings of the 24th International Teletraffic Congress
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
The Journal of Machine Learning Research
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Algorithms for hub label optimization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hierarchies of predominantly connected communities
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |