Author of the publication

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)

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

An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension., , , and . Parallel Process. Lett., 10 (4): 253-266 (2000)Diagonal Matrix Scaling and Linear Programming., and . SIAM J. Optimization, 2 (4): 668-672 (1992)On the complexity of approximating the maximal inscribed ellipsoid for a polytope., and . Math. Program., (1993)Fourier-Motzkin Elimination Method.. Encyclopedia of Optimization, Springer, (2009)Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data., , , , and . Theor. Comput. Sci., 379 (3): 361-376 (2007)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)Generating all vertices of a polyhedron is hard., , , , and . SODA, page 758-765. ACM Press, (2006)Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph., , , and . SIAM J. Comput., 30 (6): 2036-2050 (2000)On the Complexity of Dualization of Monotone Disjunctive Normal Forms., and . J. Algorithms, 21 (3): 618-628 (1996)Generating Cut Conjunctions in Graphs and Related Problems., , , , , and . Algorithmica, 51 (3): 239-263 (2008)