| Publication | Date of Publication | Type |
|---|
| Blocking trails for \(f\)-factors of multigraphs | 2023-10-06 | Paper |
| A weight-scaling algorithm for \(f\)-factors of multigraphs | 2023-10-06 | Paper |
| Packing algorithms for arborescences (and spanning trees) in capacitated graphs | 2022-08-30 | Paper |
| Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors | 2021-04-14 | Paper |
| Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths | 2021-04-14 | Paper |
| Data Structures for Weighted Matching and Extensions to b -matching and f -factors | 2018-11-13 | Paper |
| A Data Structure for Nearest Common Ancestors with Linking | 2018-11-12 | Paper |
| Finding a long directed cycle | 2018-11-05 | Paper |
| The Minset-Poset Approach to Representations of Graph Connectivity | 2018-10-30 | Paper |
| Algorithmic Applications of Baur-Strassen’s Theorem | 2018-08-02 | Paper |
| The Weighted Matching Approach to Maximum Cardinality Matching | 2018-01-19 | Paper |
| Unique maximum matching algorithms | 2016-09-29 | Paper |
| Efficient splitting off algorithms for graphs | 2016-09-01 | Paper |
| Path-based depth-first search for strong and biconnected components | 2016-06-16 | Paper |
| Using expander graphs to find vertex connectivity | 2015-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501241 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501264 | 2015-08-03 | Paper |
| A model for minimizing active processor time | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921713 | 2014-10-13 | Paper |
| Algorithms for edge coloring bipartite graphs | 2014-03-14 | Paper |
| A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors | 2012-10-11 | Paper |
| A model for minimizing active processor time | 2012-09-25 | Paper |
| Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph | 2012-05-30 | Paper |
| Approximating the smallest k -edge connected spanning subgraph by LP-rounding | 2010-11-24 | Paper |
| Upper degree-constrained partial orientations | 2010-08-16 | Paper |
| Finding paths and cycles of superpolylogarithmic length | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579373 | 2010-08-06 | Paper |
| Finding Long Paths, Cycles and Circuits | 2009-01-29 | Paper |
| Finding Paths and Cycles of Superpolylogarithmic Length | 2008-01-03 | Paper |
| On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs | 2007-08-30 | Paper |
| On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs | 2007-04-19 | Paper |
| An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps | 2006-09-28 | Paper |
| COLORING ALGORITHMS ON SUBCUBIC GRAPHS | 2005-10-19 | Paper |
| An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph | 2005-09-16 | Paper |
| A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis | 2005-08-04 | Paper |
| An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph | 2005-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828918 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046491 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808623 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471330 | 2004-07-28 | Paper |
| The limits of input-queued switch performance with future packet arrival information. | 2003-08-07 | Paper |
| Unique Maximum Matching Algorithms | 2002-04-08 | Paper |
| Incrementing bipartite digraph edge-connectivity | 2001-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525757 | 2001-01-24 | Paper |
| Bipartition constrained edge-splitting in directed graphs | 2001-01-01 | Paper |
| Parallel tetrahedral mesh adaptation with dynamic load balancing | 2000-10-26 | Paper |
| How to Make a Square Grid Framework with Cables Rigid | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250196 | 2000-10-17 | Paper |
| Computing Vertex Connectivity: New Bounds from Old Techniques | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234132 | 1999-10-28 | Paper |
| An efficient approximation algorithm for the survivable network design problem | 1999-10-18 | Paper |
| Packing algorithms for arborescences (and spanning trees) in capacitated graphs | 1999-09-15 | Paper |
| Edge-Connectivity Augmentation with Partition Constraints | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252308 | 1999-06-17 | Paper |
| Algorithms for Graphic Polymatroids and Parametrics-Sets | 1998-09-08 | Paper |
| Efficient theoretic and practical algorithms for linear matroid intersection problems | 1997-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886037 | 1996-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875227 | 1996-04-28 | Paper |
| Centroids, Representations, and Submodular Flows | 1995-07-03 | Paper |
| A matroid approach to finding edge connectivity and packing arborescences | 1995-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140422 | 1994-10-06 | Paper |
| Faster scaling algorithms for general graph matching problems | 1994-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138921 | 1994-09-20 | Paper |
| An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs | 1994-04-21 | Paper |
| Forests, frames, and games: Algorithms for matroid sums and applications | 1992-06-28 | Paper |
| Faster Scaling Algorithms for Network Problems | 1989-01-01 | Paper |
| A linear-time algorithm for finding a minimum spanning pseudoforest | 1988-01-01 | Paper |
| Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines | 1988-01-01 | Paper |
| Algorithms for two bottleneck optimization problems | 1988-01-01 | Paper |
| Efficient algorithms for finding minimum spanning trees in undirected and directed graphs | 1986-01-01 | Paper |
| An augmenting path algorithm for linear matroid parity | 1986-01-01 | Paper |
| An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs | 1986-01-01 | Paper |
| A linear-time algorithm for a special case of disjoint set union | 1985-01-01 | Paper |
| Scaling algorithms for network problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3682487 | 1985-01-01 | Paper |
| Efficient algorithms for a family of matroid intersection problems | 1984-01-01 | Paper |
| An Almost-Linear Algorithm for Two-Processor Scheduling | 1982-01-01 | Paper |
| Algorithms for Edge Coloring Bipartite Graphs and Multigraphs | 1982-01-01 | Paper |
| A linear-time recognition algorithm for interval dags | 1981-01-01 | Paper |
| Algorithmic proofs of two relations between connectivity and the 1- factors of a graph | 1979-01-01 | Paper |
| A Counting Approach to Lower Bounds for Selection Problems | 1979-01-01 | Paper |
| Finding All Spanning Trees of Directed and Undirected Graphs | 1978-01-01 | Paper |
| A good algorithm for smallest spanning trees with a degree constraint | 1978-01-01 | Paper |
| Two Algorithms for Generating Weighted Spanning Trees in Order | 1977-01-01 | Paper |
| A note on degree-constrained star subgraphs of bipartite graphs | 1976-01-01 | Paper |
| Some improved bounds on the number of 1-factors of n-connected graphs | 1976-01-01 | Paper |
| An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs | 1976-01-01 | Paper |
| Decomposing symmetric exchanges in matroid bases | 1976-01-01 | Paper |
| Using euler partitions to edge color bipartite multigraphs | 1976-01-01 | Paper |
