| Publication | Date of Publication | Type |
|---|
Finding triangle-free 2-factors in general graphs
Journal of Graph Theory | 2024-05-15 | Paper |
Generalized max flows and augmenting paths
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
A submodular optimization problem with side constraints
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Packing $k$-Matchings and $k$-Critical Graphs
SIAM Journal on Discrete Mathematics | 2018-02-07 | Paper |
Polyhedron of triangle-free simple 2-matchings in subcubic graphs
Mathematical Programming. Series A. Series B | 2013-05-06 | Paper |
Maximum Cardinality Simple 2-matchings in Subcubic Graphs
SIAM Journal on Optimization | 2012-01-09 | Paper |
Neighbor systems and the greedy algorithm
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
| Neighbor systems and the greedy algorithm. (Extended abstract). | 2011-05-16 | Paper |
Optimal electronic musical instruments
European Journal of Operational Research | 2010-06-11 | Paper |
Polyhedral Results for 1-Restricted Simple 2-Matchings
SIAM Journal on Optimization | 2009-08-20 | Paper |
The \(S\)-digraph optimization problem and the greedy algorithm
Discrete Optimization | 2009-06-02 | Paper |
The Action Gambler and Equal-Sized Wagering
Journal of Applied Probability | 2009-04-14 | Paper |
Maximum cardinality 1-restricted simple 2-matchings
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Maximum cardinality 1-restricted simple 2-matchings
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Vote trading in public elections
Mathematical Social Sciences | 2006-12-07 | Paper |
The k‐piece packing problem
Journal of Graph Theory | 2006-09-06 | Paper |
Finding maximum square-free 2-matchings in bipartite graphs
Journal of Combinatorial Theory. Series B | 2006-08-16 | Paper |
| scientific article; zbMATH DE number 2230217 (Why is no real title available?) | 2005-11-18 | Paper |
Representing the strengths and directions of pairwise comparisons
European Journal of Operational Research | 2005-02-09 | Paper |
Characterizing the flow equivalent trees of a network
Discrete Applied Mathematics | 2003-06-10 | Paper |
Crossing properties of multiterminal cuts
Networks | 2002-01-27 | Paper |
A submodular optimization problem with side constraints
Mathematics of Operations Research | 2001-11-26 | Paper |
Compact representations of cuts
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
A strongly polynomial time algorithm for a constrained submodular optimization problem
Discrete Applied Mathematics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1342133 (Why is no real title available?) | 1999-09-22 | Paper |
The planar multiterminal cut problem
Discrete Applied Mathematics | 1998-08-20 | Paper |
Multiterminal flows and cuts
Operations Research Letters | 1996-10-20 | Paper |
Generalizing the all-pairs min cut problem
Discrete Mathematics | 1996-03-24 | Paper |
Outer-Facial Graphs and the Traveling Salesman Problem
SIAM Journal on Optimization | 1995-05-09 | Paper |
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
SIAM Journal on Discrete Mathematics | 1994-10-24 | Paper |
Minimum Path Bases
Journal of Algorithms | 1994-03-27 | Paper |
Recognizing Voronoi Diagrams with Linear Programming
ORSA Journal on Computing | 1993-02-25 | Paper |
The complexity of lifted inequalities for the knapsack problem
Discrete Applied Mathematics | 1993-01-17 | Paper |
When do short cycles generate the cycle space?
Journal of Combinatorial Theory. Series B | 1993-01-01 | Paper |
Cycle bases from orderings and coverings
Discrete Mathematics | 1992-06-28 | Paper |
The prism-free planar graphs and their cycles bases
Journal of Graph Theory | 1992-06-26 | Paper |
Path-isomorphic networks
Journal of Graph Theory | 1990-01-01 | Paper |
Is every cycle basis fundamental?
Journal of Graph Theory | 1989-01-01 | Paper |
Recognizing max-flow min-cut path matrices
Operations Research Letters | 1988-01-01 | Paper |
An extension of matching theory
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
Packing subgraphs in a graph
Operations Research Letters | 1982-01-01 | Paper |
