From post

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

, , , и . ISAAC, том 1969 из Lecture Notes in Computer Science, стр. 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.

 

Другие публикации лиц с тем же именем

Generalized Manhattan path algorithm with applications.. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 7 (7): 797-804 (1988)Graphical Degree Sequence Problems with Connectivity Requirements.. ISAAC, том 762 из Lecture Notes in Computer Science, стр. 38-47. Springer, (1993)Edge-Deletion and Edge-Contraction Problems, и . STOC, стр. 245-254. ACM, (1982)Modularity and monotonicity of games., и . Math. Methods Oper. Res., 80 (1): 29-46 (2014)Guest Editors' Foreword., , и . Int. J. Comput. Geom. Appl., 23 (2): 73-74 (2013)Visibility of Disjoint Polygons., , , , и . Algorithmica, 1 (1): 49-63 (1986)An Application of Duality to Edge-Deletion Problems.. SIAM J. Comput., 16 (2): 312-331 (1987)Nash Equilibria in Combinatorial Auctions with Item Bidding by Two Bidders., и . J. Inf. Process., (2017)The smallest 2-connected cubic bipartite planar nonhamiltonian graph., , , и . Discret. Math., 38 (1): 1-6 (1982)Portfolio inertia under ambiguity.. Math. Soc. Sci., 52 (3): 223-232 (2006)