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

Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph., , and . ISCAS, page 2311-2314. IEEE, (1993)A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph., , and . ISCAS (3), page 236-239. IEEE, (2003)An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants., , and . ISCAS (3), page 172-175. IEEE, (2003)Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph., and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 217-225. Springer, (1994)Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 101-A (2): 357-366 (2018)Performance Comparison of Algorithms for the Dynamic Shortest Path Problem., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 90-A (4): 847-856 (2007)An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets., , , and . ISCAS, IEEE, (2006)Efficient approximation algorithms for the maximum weight matching problem., , and . ISCAS (4), page 457-460. IEEE, (2002)Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree., , and . ISCAS, page 2934-2937. IEEE, (2009)Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants., , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 85-A (11): 2436-2446 (2002)