( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Theoretical Framework of Hybrid Approaches to MAX SAT.

, , , и . ISAAC, том 1350 из Lecture Notes in Computer Science, стр. 153-162. Springer, (1997)

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.

Tomio Ino

Alessandro Hirata

Margarete Tomio

Carlos Eiji Hirata Ventura

 

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

Efficient routability checking for global wires in planar layouts., , и . ASP-DAC, стр. 641-644. IEEE, (1997)Refined Computations for Points of the Form 2kP Based on Montgomery Trick., и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 89-A (1): 334-339 (2006)Corrigendum to Än Incremental Algorithm for Constructing Shortest Watchman Routes"., , и . Int. J. Comput. Geom. Appl., 9 (3): 319-323 (1999)A note on the Greedy algorithm for finding independent sets of Ck-free graphs., , и . Inf. Process. Lett., 109 (10): 485-489 (2009)Shortest Safari Routes in Simple Polygon., и . ISAAC, том 834 из Lecture Notes in Computer Science, стр. 523-531. Springer, (1994)On Approximation Algorithms for Coloring k-Colorable Graphs., , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 86-A (5): 1046-1051 (2003)Reconfiguration of a fault-tolerant rectangular systolic array., , , , и . Syst. Comput. Jpn., 19 (1): 79-89 (1988)A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian., и . TJJCCGG, том 8296 из Lecture Notes in Computer Science, стр. 143-149. Springer, (2012)The Intersection Searching Problem for c-Oriented Polygons., , и . Inf. Process. Lett., 37 (4): 201-204 (1991)A Systolic Algorithm for Euclidean Distance Transform., , , и . IEEE Trans. Pattern Anal. Mach. Intell., 28 (7): 1127-1134 (2006)