| Publication | Date of Publication | Type |
|---|
Blocking trails for \(f\)-factors of multigraphs
Algorithmica | 2023-10-06 | Paper |
A weight-scaling algorithm for \(f\)-factors of multigraphs
Algorithmica | 2023-10-06 | Paper |
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Algorithms for weighted matching generalizations. I: Bipartite graphs, \(b\)-matching, and unweighted \(f\)-factors
SIAM Journal on Computing | 2021-04-14 | Paper |
Algorithms for weighted matching generalizations. II: \(f\)-factors and the special case of shortest paths
SIAM Journal on Computing | 2021-04-14 | Paper |
Data structures for weighted matching and extensions to \(b\)-matching and \(f\)-factors
ACM Transactions on Algorithms | 2018-11-13 | Paper |
A Data Structure for Nearest Common Ancestors with Linking
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Finding a long directed cycle
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The Minset-Poset Approach to Representations of Graph Connectivity
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Algorithmic applications of Baur-Strassen's theorem, shortest cycles, diameter, and matchings
Journal of the ACM | 2018-08-02 | Paper |
The weighted matching approach to maximum cardinality matching
Fundamenta Informaticae | 2018-01-19 | Paper |
Unique maximum matching algorithms
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Efficient splitting off algorithms for graphs
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Path-based depth-first search for strong and biconnected components
Information Processing Letters | 2016-06-16 | Paper |
Using expander graphs to find vertex connectivity
Journal of the ACM | 2015-12-04 | Paper |
| Special edges, and approximating the smallest directed \(k\)-edge connected spanning subgraph | 2015-08-03 | Paper |
| scientific article; zbMATH DE number 6469131 (Why is no real title available?) | 2015-08-03 | Paper |
A model for minimizing active processor time
Algorithmica | 2015-01-19 | Paper |
| Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding | 2014-10-13 | Paper |
Algorithms for edge coloring bipartite graphs
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors
Theoretical Computer Science | 2012-10-11 | Paper |
A model for minimizing active processor time
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph
SIAM Journal on Computing | 2012-05-30 | Paper |
Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
Networks | 2010-11-24 | Paper |
Upper degree-constrained partial orientations
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Finding paths and cycles of superpolylogarithmic length
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 5764784 (Why is no real title available?) | 2010-08-06 | Paper |
Finding Long Paths, Cycles and Circuits
Algorithms and Computation | 2009-01-29 | Paper |
Finding Paths and Cycles of Superpolylogarithmic Length
SIAM Journal on Computing | 2008-01-03 | Paper |
On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
Formal Methods in System Design | 2006-09-28 | Paper |
COLORING ALGORITHMS ON SUBCUBIC GRAPHS
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 2119647 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2089961 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2089222 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2079371 (Why is no real title available?) | 2004-07-28 | Paper |
The limits of input-queued switch performance with future packet arrival information.
Computer Networks | 2003-08-07 | Paper |
Unique maximum matching algorithms
Journal of Algorithms | 2002-04-08 | Paper |
Incrementing bipartite digraph edge-connectivity
Journal of Combinatorial Optimization | 2001-11-16 | Paper |
| scientific article; zbMATH DE number 1555984 (Why is no real title available?) | 2001-01-24 | Paper |
Bipartition constrained edge-splitting in directed graphs
Discrete Applied Mathematics | 2001-01-01 | Paper |
Parallel tetrahedral mesh adaptation with dynamic load balancing
Parallel Computing | 2000-10-26 | Paper |
How to Make a Square Grid Framework with Cables Rigid
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1303570 (Why is no real title available?) | 2000-10-17 | Paper |
Computing Vertex Connectivity: New Bounds from Old Techniques
Journal of Algorithms | 2000-06-22 | Paper |
| scientific article; zbMATH DE number 1263260 (Why is no real title available?) | 1999-10-28 | Paper |
An efficient approximation algorithm for the survivable network design problem
Mathematical Programming. Series A. Series B | 1999-10-18 | Paper |
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
Mathematical Programming. Series A. Series B | 1999-09-15 | Paper |
Edge-Connectivity Augmentation with Partition Constraints
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
| scientific article; zbMATH DE number 1305425 (Why is no real title available?) | 1999-06-17 | Paper |
Algorithms for Graphic Polymatroids and Parametrics-Sets
Journal of Algorithms | 1998-09-08 | Paper |
Efficient theoretic and practical algorithms for linear matroid intersection problems
Journal of Computer and System Sciences | 1997-03-31 | Paper |
| scientific article; zbMATH DE number 910863 (Why is no real title available?) | 1996-12-12 | Paper |
| scientific article; zbMATH DE number 871952 (Why is no real title available?) | 1996-04-28 | Paper |
Centroids, Representations, and Submodular Flows
Journal of Algorithms | 1995-07-03 | Paper |
A matroid approach to finding edge connectivity and packing arborescences
Journal of Computer and System Sciences | 1995-06-08 | Paper |
| scientific article; zbMATH DE number 437545 (Why is no real title available?) | 1994-10-06 | Paper |
Faster scaling algorithms for general graph matching problems
Journal of the ACM | 1994-10-06 | Paper |
| scientific article; zbMATH DE number 432790 (Why is no real title available?) | 1994-09-20 | Paper |
An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
Journal of Algorithms | 1994-04-21 | Paper |
Forests, frames, and games: Algorithms for matroid sums and applications
Algorithmica | 1992-06-28 | Paper |
Faster Scaling Algorithms for Network Problems
SIAM Journal on Computing | 1989-01-01 | Paper |
Algorithms for two bottleneck optimization problems
Journal of Algorithms | 1988-01-01 | Paper |
A linear-time algorithm for finding a minimum spanning pseudoforest
Information Processing Letters | 1988-01-01 | Paper |
Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines
SIAM Journal on Computing | 1988-01-01 | Paper |
An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
SIAM Journal on Computing | 1986-01-01 | Paper |
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Combinatorica | 1986-01-01 | Paper |
An augmenting path algorithm for linear matroid parity
Combinatorica | 1986-01-01 | Paper |
Scaling algorithms for network problems
Journal of Computer and System Sciences | 1985-01-01 | Paper |
A linear-time algorithm for a special case of disjoint set union
Journal of Computer and System Sciences | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3904590 (Why is no real title available?) | 1985-01-01 | Paper |
Efficient algorithms for a family of matroid intersection problems
Journal of Algorithms | 1984-01-01 | Paper |
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
SIAM Journal on Computing | 1982-01-01 | Paper |
An Almost-Linear Algorithm for Two-Processor Scheduling
Journal of the ACM | 1982-01-01 | Paper |
A linear-time recognition algorithm for interval dags
Information Processing Letters | 1981-01-01 | Paper |
A Counting Approach to Lower Bounds for Selection Problems
Journal of the ACM | 1979-01-01 | Paper |
Algorithmic proofs of two relations between connectivity and the 1- factors of a graph
Discrete Mathematics | 1979-01-01 | Paper |
Finding All Spanning Trees of Directed and Undirected Graphs
SIAM Journal on Computing | 1978-01-01 | Paper |
A good algorithm for smallest spanning trees with a degree constraint
Networks | 1978-01-01 | Paper |
Two Algorithms for Generating Weighted Spanning Trees in Order
SIAM Journal on Computing | 1977-01-01 | Paper |
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM | 1976-01-01 | Paper |
Decomposing symmetric exchanges in matroid bases
Mathematical Programming | 1976-01-01 | Paper |
Using euler partitions to edge color bipartite multigraphs
International Journal of Computer & Information Sciences | 1976-01-01 | Paper |
Some improved bounds on the number of 1-factors of n-connected graphs
Information Processing Letters | 1976-01-01 | Paper |
A note on degree-constrained star subgraphs of bipartite graphs
Information Processing Letters | 1976-01-01 | Paper |
