| Publication | Date of Publication | Type |
|---|
| Selected works | 2012-10-25 | Paper |
Generating all vertices of a polyhedron is hard
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
Lecture Notes in Computer Science | 2010-03-03 | Paper |
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters | 2010-01-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 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
Discrete Applied Mathematics | 2008-09-10 | Paper |
Generating cut conjunctions in graphs and related problems
Algorithmica | 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)
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
Generating all vertices of a polyhedron is hard
Discrete & Computational Geometry | 2008-04-16 | Paper |
Enumerating Spanning and Connected Subsets in Graphs and Matroids
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Theoretical Computer Science | 2007-09-18 | Paper |
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
Theoretical Computer Science | 2007-07-16 | Paper |
Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
Discrete Applied Mathematics | 2007-02-19 | Paper |
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
Discrete Applied Mathematics | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Dual-bounded generating problems: Weighted transversals of a hypergraph
Discrete Applied Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2086380 (Why is no real title available?) | 2004-08-11 | Paper |
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2038737 (Why is no real title available?) | 2004-02-08 | Paper |
An inequality for polymatroid functions and its applications.
Discrete Applied Mathematics | 2003-10-14 | Paper |
On maximal frequent and minimal infrequent sets in binary matrices
Annals of Mathematics and Artificial Intelligence | 2003-08-21 | Paper |
| scientific article; zbMATH DE number 1929933 (Why is no real title available?) | 2003-06-18 | Paper |
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
SIAM Journal on Computing | 2002-09-29 | Paper |
| Transversal hypergraphs and families of polyhedral cones | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1754587 (Why is no real title available?) | 2002-06-12 | Paper |
Generating dual-bounded hypergraphs
Optimization Methods & Software | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1670855 (Why is no real title available?) | 2001-11-11 | Paper |
Approximate max-min resource sharing for structured concave optimization
SIAM Journal on Optimization | 2001-06-21 | Paper |
Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
SIAM Journal on Computing | 2001-06-21 | Paper |
Integer optimization on convex semialgebraic sets
Discrete & Computational Geometry | 2000-03-23 | Paper |
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
Discrete Applied Mathematics | 2000-02-14 | Paper |
| scientific article; zbMATH DE number 1182565 (Why is no real title available?) | 1998-08-02 | Paper |
On the Complexity of Matrix Balancing
SIAM Journal on Matrix Analysis and Applications | 1998-02-03 | Paper |
Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
Mathematical Programming. Series A. Series B | 1997-11-11 | Paper |
On the frequency of the most frequently occurring variable in dual monotone DNFs
Discrete Mathematics | 1997-10-06 | Paper |
An Interior Point Method for Bordered Block-Diagonal Linear Programs
SIAM Journal on Optimization | 1997-08-18 | Paper |
On the complexity of semidefinite programs
Journal of Global Optimization | 1997-07-23 | Paper |
A sublinear-time randomized approximation algorithm for matrix games
Operations Research Letters | 1997-03-11 | Paper |
Coordination Complexity of Parallel Price-Directive Decomposition
Mathematics of Operations Research | 1997-03-11 | Paper |
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
Journal of Algorithms | 1996-12-08 | Paper |
Rounding of Polytopes in the Real Number Model of Computation
Mathematics of Operations Research | 1996-10-14 | Paper |
An exponential‐function reduction method for block‐angular convex programs
Networks | 1996-10-07 | Paper |
On the complexity of nonnegative-matrix scaling
Linear Algebra and its Applications | 1996-06-30 | Paper |
Diagonal matrix scaling is NP-hard
Linear Algebra and its Applications | 1996-06-30 | Paper |
On the complexity of approximating extremal determinants in matrices
Journal of Complexity | 1995-04-05 | Paper |
| scientific article; zbMATH DE number 724209 (Why is no real title available?) | 1995-02-23 | Paper |
Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
SIAM Journal on Optimization | 1994-05-18 | Paper |
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
Operations Research Letters | 1994-04-06 | Paper |
A greedy heuristic for a minimum-weight forest problem
Operations Research Letters | 1994-03-24 | Paper |
| scientific article; zbMATH DE number 519872 (Why is no real title available?) | 1994-03-14 | Paper |
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
Mathematical Programming. Series A. Series B | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 431987 (Why is no real title available?) | 1993-11-11 | Paper |
Diagonal Matrix Scaling and Linear Programming
SIAM Journal on Optimization | 1993-01-13 | Paper |
On the conductance of order Markov chains
Order | 1992-06-27 | Paper |
An inequality for the volume of inscribed ellipsoids
Discrete & Computational Geometry | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4158395 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4108152 (Why is no real title available?) | 1989-01-01 | Paper |
The problem of calculating the volume of a polyhedron is enumerably hard
Russian Mathematical Surveys | 1989-01-01 | Paper |
Cyclic games and an algorithm to find minimax cycle means in directed graphs
USSR Computational Mathematics and Mathematical Physics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4123531 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4081342 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4201621 (Why is no real title available?) | 1988-01-01 | Paper |
A certain inequality for convex forms
Mathematical Notes | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4068626 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4041638 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3945887 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3922374 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3837783 (Why is no real title available?) | 1982-01-01 | Paper |
On the exact solution of systems of linear inequalities and linear programming problems
USSR Computational Mathematics and Mathematical Physics | 1982-01-01 | Paper |
Polynomial algorithms in linear programming
USSR Computational Mathematics and Mathematical Physics | 1980-01-01 | Paper |
The polynomial solvability of convex quadratic programming
USSR Computational Mathematics and Mathematical Physics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3672004 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3733656 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3746828 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3644821 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3637614 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3677572 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3643071 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3623340 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3625111 (Why is no real title available?) | 1977-01-01 | Paper |
Convergence rate of the game processes for solving matrix games
USSR Computational Mathematics and Mathematical Physics | 1977-01-01 | Paper |
