| Publication | Date of Publication | Type |
|---|
A network flow approach to a common generalization of Clar and Fries numbers
Discrete Mathematics | 2024-08-19 | Paper |
Fair Integral Network Flows
Mathematics of Operations Research | 2024-02-27 | Paper |
| A network flow approach to a common generalization of Clar and Fries numbers | 2023-07-06 | Paper |
| Two arc disjoint paths in Eulerian digraphs | 2023-03-21 | Paper |
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
Japan Journal of Industrial and Applied Mathematics | 2023-01-17 | Paper |
Decreasing minimization on M-convex sets: algorithms and applications
Mathematical Programming. Series A. Series B | 2022-10-24 | Paper |
Decreasing minimization on M-convex sets: background and structures
Mathematical Programming. Series A. Series B | 2022-10-24 | Paper |
Fair integral submodular flows
Discrete Applied Mathematics | 2022-08-24 | Paper |
A discrete convex min-max formula for box-TDI polyhedra
Mathematics of Operations Research | 2022-06-27 | Paper |
Decreasing Minimization on Base-Polyhedra: Relation Between Discrete and Continuous Cases
(available as arXiv preprint) | 2022-02-14 | Paper |
A simple algorithm and min-max formula for the inverse arborescence problem
Discrete Applied Mathematics | 2021-04-01 | Paper |
Supermodularity in unweighted graph optimization. I: Branchings and matchings
Mathematics of Operations Research | 2020-03-12 | Paper |
Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
Mathematics of Operations Research | 2020-03-12 | Paper |
Supermodularity in unweighted graph optimization. III: Highly connected digraphs
Mathematics of Operations Research | 2020-03-12 | Paper |
| Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis | 2018-08-25 | Paper |
| Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization | 2018-08-22 | Paper |
| scientific article; zbMATH DE number 6863587 (Why is no real title available?) | 2018-04-23 | Paper |
A Survey on Covering Supermodular Functions
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
| Edge-connectivities of graphs and digraphs | 2016-07-01 | Paper |
Sink-Stable Sets of Digraphs
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Sink-Stable Sets of Digraphs
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Characterizing and recognizing generalized polymatroids
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Tree-compositions and orientations
Operations Research Letters | 2014-05-14 | Paper |
| Balanced list edge-colourings of bipartite graphs | 2013-11-08 | Paper |
Independent arborescences in directed graphs
Discrete Mathematics | 2013-03-01 | Paper |
Simple push-relabel algorithms for matroids and submodular flows
Japan Journal of Industrial and Applied Mathematics | 2012-12-28 | Paper |
| Packing arborescences | 2011-05-16 | Paper |
| Connections in combinatorial optimization | 2011-03-31 | Paper |
Rooted \(k\)-connections in digraphs
Discrete Applied Mathematics | 2009-06-23 | Paper |
| Connections in combinatorial optimization. I: optimization in graphs | 2009-03-30 | Paper |
| An algorithm to increase the node-connectivity of a digraph by one | 2009-03-30 | Paper |
Variations for Lovász’ Submodular Ideas
Bolyai Society Mathematical Studies | 2009-02-12 | Paper |
An algorithm to increase the node-connectivity of a digraph by one
Discrete Optimization | 2008-11-19 | Paper |
A note on degree-constrained subgraphs
Discrete Mathematics | 2008-05-13 | Paper |
An algorithm for node-capacitated ring routing
Operations Research Letters | 2008-01-21 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Node-Capacitated Ring Routing
Mathematics of Operations Research | 2005-11-11 | Paper |
An algorithm for source location in directed graphs
Operations Research Letters | 2005-06-01 | Paper |
On Kuhn's Hungarian Method?A tribute from Hungary
Naval Research Logistics | 2005-06-01 | Paper |
A constrained independent set problem for matroids
Operations Research Letters | 2004-07-01 | Paper |
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Discrete Applied Mathematics | 2003-10-14 | Paper |
Constructive characterizations for packing and covering with trees
Discrete Applied Mathematics | 2003-10-14 | Paper |
Restricted \(t\)-matchings in bipartite graphs
Discrete Applied Mathematics | 2003-10-14 | Paper |
On the orientation of graphs and hypergraphs
Discrete Applied Mathematics | 2003-10-14 | Paper |
Combined connectivity augmentation and orientation problems
Discrete Applied Mathematics | 2003-10-14 | Paper |
Note on the path‐matching formula
Journal of Graph Theory | 2003-03-19 | Paper |
Graph orientations with edge-connection and parity constraints
Combinatorica | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1757954 (Why is no real title available?) | 2002-06-20 | Paper |
| scientific article; zbMATH DE number 1757953 (Why is no real title available?) | 2002-06-20 | Paper |
An orientation theorem with parity conditions
Discrete Applied Mathematics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1342129 (Why is no real title available?) | 2000-11-27 | Paper |
Finding minimum generators of path systems
Journal of Combinatorial Theory. Series B | 2000-06-09 | Paper |
Directed vertex-connectivity augmentation
Mathematical Programming. Series A. Series B | 2000-04-10 | Paper |
Increasing the rooted connectivity of a digraph by one
Mathematical Programming. Series A. Series B | 2000-01-30 | Paper |
Connectivity augmentation of networks: Structures and algorithms. Papers from the workshop held at Eötvös University, Budapest, Hungary, November 1994
Mathematical Programming. Series A. Series B | 2000-01-04 | Paper |
Covering symmetric supermodular functions by graphs
Mathematical Programming. Series A. Series B | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1341908 (Why is no real title available?) | 1999-11-21 | Paper |
| scientific article; zbMATH DE number 1342130 (Why is no real title available?) | 1999-09-22 | Paper |
Minimum multiway cuts in trees
Discrete Applied Mathematics | 1999-04-19 | Paper |
Two Arc-Disjoint Paths in Eulerian Digraphs
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1146228 (Why is no real title available?) | 1998-08-25 | Paper |
Applications of relaxed submodularity
Documenta Mathematica | 1998-08-05 | Paper |
Applications of relaxed submodularity
Documenta Mathematica | 1998-08-05 | Paper |
| scientific article; zbMATH DE number 1175945 (Why is no real title available?) | 1998-07-19 | Paper |
On Integer Multiflow Maximization
SIAM Journal on Discrete Mathematics | 1997-05-20 | Paper |
| scientific article; zbMATH DE number 863470 (Why is no real title available?) | 1996-09-29 | Paper |
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
SIAM Journal on Discrete Mathematics | 1996-04-08 | Paper |
A note on packing paths in planar graphs
Mathematical Programming. Series A. Series B | 1996-02-06 | Paper |
Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory. Series B | 1995-09-20 | Paper |
On packing \(T\)-cuts
Journal of Combinatorial Theory. Series B | 1995-03-02 | Paper |
| scientific article; zbMATH DE number 475590 (Why is no real title available?) | 1994-06-12 | Paper |
Submodular functions in graph theory
Discrete Mathematics | 1994-01-04 | Paper |
| scientific article; zbMATH DE number 446490 (Why is no real title available?) | 1993-12-12 | Paper |
On sparse subgraphs preserving connectivity properties
Journal of Graph Theory | 1993-08-24 | Paper |
Conservative weightings and ear-decompositions of graphs
Combinatorica | 1993-08-16 | Paper |
Algorithms for routing around a rectangle
Discrete Applied Mathematics | 1993-05-16 | Paper |
On a theorem of Mader
Discrete Mathematics | 1993-01-16 | Paper |
Augmenting Graphs to Meet Edge-Connectivity Requirements
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 16298 (Why is no real title available?) | 1992-06-26 | Paper |
On circuit decomposition of planar Eulerian graphs
Journal of Combinatorial Theory. Series B | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4204382 (Why is no real title available?) | 1990-01-01 | Paper |
Packing paths in planar graphs
Combinatorica | 1990-01-01 | Paper |
An application of submodular flows
Linear Algebra and its Applications | 1989-01-01 | Paper |
Generalized polymatroids and submodular flows
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
An application of simultaneous diophantine approximation in combinatorial optimization
Combinatorica | 1987-01-01 | Paper |
A Primal-Dual Algorithm for Submodular Flows
Mathematics of Operations Research | 1985-01-01 | Paper |
Edge-disjoint paths in planar graphs
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3885621 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3910407 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3904606 (Why is no real title available?) | 1984-01-01 | Paper |
Covering directed and odd cuts
Mathematical Programming Studies | 1984-01-01 | Paper |
Finding feasible vectors of Edmonds-Giles polyhedra
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3831979 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3779067 (Why is no real title available?) | 1982-01-01 | Paper |
A note on k-strongly connected orientations of an undirected graph
Discrete Mathematics | 1982-01-01 | Paper |
An Algorithm for Submodular Functions on Graphs
North-Holland Mathematics Studies | 1982-01-01 | Paper |
Disjoint paths in a rectilinear grid
Combinatorica | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3744939 (Why is no real title available?) | 1981-01-01 | Paper |
A weighted matroid intersection algorithm
Journal of Algorithms | 1981-01-01 | Paper |
How to make a digraph strongly connected
Combinatorica | 1981-01-01 | Paper |
On chain and antichain families of a partially ordered set
Journal of Combinatorial Theory. Series B | 1980-01-01 | Paper |
On the orientation of graphs
Journal of Combinatorial Theory. Series B | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3661345 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3659627 (Why is no real title available?) | 1979-01-01 | Paper |
On a class of balanced hypergraphs
Discrete Mathematics | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3513839 (Why is no real title available?) | 1976-01-01 | Paper |
