| Publication | Date of Publication | Type |
|---|
| Selected works | 2012-10-25 | Paper |
| Generating all vertices of a polyhedron is hard | 2010-08-16 | Paper |
| An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals | 2010-03-03 | Paper |
| A global parallel algorithm for the hypergraph transversal problem | 2010-01-29 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Generating all vertices of a polyhedron is hard | 2009-04-14 | Paper |
| Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions | 2008-09-10 | Paper |
| Generating cut conjunctions in graphs and related problems | 2008-07-01 | Paper |
| ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) | 2008-04-29 | Paper |
| Generating all vertices of a polyhedron is hard | 2008-04-16 | Paper |
| Enumerating Spanning and Connected Subsets in Graphs and Matroids | 2008-03-11 | Paper |
| On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs | 2007-09-18 | Paper |
| Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data | 2007-07-16 | Paper |
| Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction | 2007-05-02 | Paper |
| Enumerating disjunctions and conjunctions of paths and cuts in reliability theory | 2007-02-19 | Paper |
| An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| On the Complexity of Some Enumeration Problems for Matroids | 2006-06-01 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Dual-bounded generating problems: Weighted transversals of a hypergraph | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736834 | 2004-08-11 | Paper |
| Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449202 | 2004-02-08 | Paper |
| An inequality for polymatroid functions and its applications. | 2003-10-14 | Paper |
| On maximal frequent and minimal infrequent sets in binary matrices | 2003-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708565 | 2003-06-18 | Paper |
| Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities | 2002-09-29 | Paper |
| Transversal hypergraphs and families of polyhedral cones | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535012 | 2002-06-12 | Paper |
| Generating dual-bounded hypergraphs | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754179 | 2001-11-11 | Paper |
| Approximate max-min resource sharing for structured concave optimization | 2001-06-21 | Paper |
| Dual-bounded generating problems: Partial and multiple transversals of a hypergraph | 2001-06-21 | Paper |
| Integer optimization on convex semialgebraic sets | 2000-03-23 | Paper |
| On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions | 2000-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400635 | 1998-08-02 | Paper |
| On the Complexity of Matrix Balancing | 1998-02-03 | Paper |
| Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time | 1997-11-11 | Paper |
| On the frequency of the most frequently occurring variable in dual monotone DNFs | 1997-10-06 | Paper |
| An Interior Point Method for Bordered Block-Diagonal Linear Programs | 1997-08-18 | Paper |
| On the complexity of semidefinite programs | 1997-07-23 | Paper |
| A sublinear-time randomized approximation algorithm for matrix games | 1997-03-11 | Paper |
| Coordination Complexity of Parallel Price-Directive Decomposition | 1997-03-11 | Paper |
| On the Complexity of Dualization of Monotone Disjunctive Normal Forms | 1996-12-08 | Paper |
| Rounding of Polytopes in the Real Number Model of Computation | 1996-10-14 | Paper |
| An exponential‐function reduction method for block‐angular convex programs | 1996-10-07 | Paper |
| On the complexity of nonnegative-matrix scaling | 1996-06-30 | Paper |
| Diagonal matrix scaling is NP-hard | 1996-06-30 | Paper |
| On the complexity of approximating extremal determinants in matrices | 1995-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4323609 | 1995-02-23 | Paper |
| Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints | 1994-05-18 | Paper |
| On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms | 1994-04-06 | Paper |
| A greedy heuristic for a minimum-weight forest problem | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283695 | 1994-03-14 | Paper |
| On the complexity of approximating the maximal inscribed ellipsoid for a polytope | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138745 | 1993-11-11 | Paper |
| Diagonal Matrix Scaling and Linear Programming | 1993-01-13 | Paper |
| On the conductance of order Markov chains | 1992-06-27 | Paper |
| An inequality for the volume of inscribed ellipsoids | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3486373 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832046 | 1989-01-01 | Paper |
| The problem of calculating the volume of a polyhedron is enumerably hard | 1989-01-01 | Paper |
| Cyclic games and an algorithm to find minimax cycle means in directed graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4204004 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3812077 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3350760 | 1988-01-01 | Paper |
| A certain inequality for convex forms | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801352 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780012 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716822 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696862 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3042881 | 1982-01-01 | Paper |
| On the exact solution of systems of linear inequalities and linear programming problems | 1982-01-01 | Paper |
| Polynomial algorithms in linear programming | 1980-01-01 | Paper |
| The polynomial solvability of convex quadratic programming | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3869076 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3920993 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3931026 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3050157 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197641 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3873927 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048622 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186122 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4187578 | 1977-01-01 | Paper |
| Convergence rate of the game processes for solving matrix games | 1977-01-01 | Paper |
