Author of the publication

Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.

, , , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 204-215. Springer, (2000)

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

Visibility of Disjoint Polygons., , , , and . Algorithmica, 1 (1): 49-63 (1986)Guest Editors' Foreword., , and . Int. J. Comput. Geom. Appl., 23 (2): 73-74 (2013)Generalized Manhattan path algorithm with applications.. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 7 (7): 797-804 (1988)An Application of Duality to Edge-Deletion Problems.. SIAM J. Comput., 16 (2): 312-331 (1987)Graphical Degree Sequence Problems with Connectivity Requirements.. ISAAC, volume 762 of Lecture Notes in Computer Science, page 38-47. Springer, (1993)Modularity and monotonicity of games., and . Math. Methods Oper. Res., 80 (1): 29-46 (2014)Edge-Deletion and Edge-Contraction Problems, and . STOC, page 245-254. ACM, (1982)Nash Equilibria in Combinatorial Auctions with Item Bidding by Two Bidders., and . J. Inf. Process., (2017)The smallest 2-connected cubic bipartite planar nonhamiltonian graph., , , and . Discret. Math., 38 (1): 1-6 (1982)A Theoretical Framework of Hybrid Approaches to MAX SAT., , , and . ISAAC, volume 1350 of Lecture Notes in Computer Science, page 153-162. Springer, (1997)