| Publication | Date of Publication | Type |
|---|
Polyhedral computational geometry for averaging metric phylogenetic trees
Advances in Applied Mathematics | 2015-06-16 | Paper |
Sudoku: strategy versus structure
American Mathematical Monthly | 2012-01-01 | Paper |
| scientific article; zbMATH DE number 5542490 (Why is no real title available?) | 2009-04-14 | Paper |
Enumeration in convex geometries and associated polytopal subdivisions of spheres
Discrete & Computational Geometry | 2008-04-16 | Paper |
A polynomial-time algorithm to find shortest paths with recourse
Networks | 2003-04-10 | Paper |
On the structure and complexity of the 2-connected Steiner network problem in the plane
Operations Research Letters | 2001-02-08 | Paper |
| scientific article; zbMATH DE number 1424552 (Why is no real title available?) | 2000-11-06 | Paper |
| Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs | 2000-07-24 | Paper |
Two-Connected Augmentation Problems in Planar Graphs
Journal of Algorithms | 1999-09-22 | Paper |
Minimal connected enclosures on an embedded planar graph
Discrete Applied Mathematics | 1999-03-30 | Paper |
Two-path subsets: Efficient counting and applications to performability analysis
Discrete Applied Mathematics | 1998-07-28 | Paper |
Counting Problems Associated With Steiner Trees In Graphs
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
On finding two-connected subgraphs in planar graphs
Operations Research Letters | 1997-12-17 | Paper |
The Delta-Wye Approximation Procedure for Two-Terminal Reliability
Operations Research | 1997-07-23 | Paper |
Calculating <i>K</i>-Connectedness Reliability Using Steiner Bounds
Mathematics of Operations Research | 1997-02-13 | Paper |
A paradigm for listing \((s,t)\)-cuts in graphs
Algorithmica | 1996-08-13 | Paper |
A new approach to solving three combinatorial enumeration problems on planar graphs
Discrete Applied Mathematics | 1996-03-11 | Paper |
| scientific article; zbMATH DE number 795224 (Why is no real title available?) | 1996-02-18 | Paper |
Threshold reliability of networks with small failure sets
Networks | 1995-07-20 | Paper |
The complexity of computing the Tutte polynomial on transversal matroids
Combinatorica | 1995-05-04 | Paper |
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
Operations Research | 1994-03-21 | Paper |
Efficient enumeration of the vertices of polyhedra associated with network LP's
Mathematical Programming. Series A. Series B | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 176261 (Why is no real title available?) | 1993-05-18 | Paper |
Two new criteria for finding Steiner hulls in Steiner tree problems
Algorithmica | 1992-06-28 | Paper |
The role of Steiner hulls in the solution to Steiner tree problems
Annals of Operations Research | 1992-06-27 | Paper |
Reliability covering problems
Networks | 1992-06-25 | Paper |
Shortest enclosing walks and cycles in embedded graphs
Information Processing Letters | 1989-01-01 | Paper |
Exact cuts in networks
Networks | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4095482 (Why is no real title available?) | 1988-01-01 | Paper |
Convexity and the Steiner tree problem
Networks | 1988-01-01 | Paper |
Disjoint Products and Efficient Computation of Reliability
Operations Research | 1988-01-01 | Paper |
An Approximation Scheme for Finding Steiner Trees with Obstacles
SIAM Journal on Computing | 1988-01-01 | Paper |
Substitutes and Complements in Constrained Linear Models
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
The Complexity of Reliability Computations in Planar and Acyclic Graphs
SIAM Journal on Computing | 1986-01-01 | Paper |
Bounds on the Reliability of Networks
IEEE Transactions on Reliability | 1986-01-01 | Paper |
Polyhedral Combinatorics and Network Reliability
Mathematics of Operations Research | 1986-01-01 | Paper |
Technical Note—An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks
Operations Research | 1985-01-01 | Paper |
Computing Network Reliability in Time Polynomial in the Number of Cuts
Operations Research | 1984-01-01 | Paper |
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
SIAM Journal on Computing | 1983-01-01 | Paper |
Calculating bounds on reachability and connectedness in stochastic networks
Networks | 1983-01-01 | Paper |
Determinacy in Linear Systems and Networks
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
Bounds on the Reliability Polynomial for Shellable Independence Systems
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
Leontief Substitution Systems and Matroid Complexes
Mathematics of Operations Research | 1982-01-01 | Paper |
Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
Mathematics of Operations Research | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3760913 (Why is no real title available?) | 1979-01-01 | Paper |
