Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the complexity of approximating the maximal inscribed ellipsoid for a polytope., and . Math. Program., (1993)Diagonal Matrix Scaling and Linear Programming., and . SIAM J. Optimization, 2 (4): 668-672 (1992)Generating all vertices of a polyhedron is hard., , , , and . SODA, page 758-765. ACM Press, (2006)Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction., , and . CSR, volume 3967 of Lecture Notes in Computer Science, page 221-234. Springer, (2006)Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems., , , and . IPCO, volume 3064 of Lecture Notes in Computer Science, page 152-162. Springer, (2004)Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions., , , and . Discret. Appl. Math., 156 (11): 2020-2034 (2008)On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets., , , and . STACS, volume 2285 of Lecture Notes in Computer Science, page 133-141. Springer, (2002)On the Complexity of Dualization of Monotone Disjunctive Normal Forms., and . J. Algorithms, 21 (3): 618-628 (1996)Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices., , , and . Math. Program., 98 (1-3): 355-368 (2003)An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation., , , and . Discret. Appl. Math., 154 (16): 2350-2372 (2006)