Author of the publication

Edge and Node Searching Problems on Trees.

, , , , and . COCOON, volume 1276 of Lecture Notes in Computer Science, page 284-293. 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. 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

BASE: an assistant tool to precisely simulate energy consumption and reliability of energy-efficient storage systems., , and . Softw. Pract. Exp., 46 (5): 581-599 (2016)Changing of Spreading Dynamics for Infectious Diseases in an Aging Society: A Simulation Case Study on Flu Pandemic., , , , , , and . SIMULTECH, page 453-460. SCITEPRESS, (2021)Value versus damage of information release: A data privacy perspective., , , and . Int. J. Approx. Reason., 43 (2): 179-201 (2006)The bridge-connectivity augmentation problem with a partition constraint., , , , and . Theor. Comput. Sci., 411 (31-33): 2878-2889 (2010)Knowledge Inferencing on Chinese Chess Endgames., , , and . Computers and Games, volume 5131 of Lecture Notes in Computer Science, page 180-191. Springer, (2008)Graph Searching on Chordal Graphs., , , , and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 156-165. Springer, (1996)Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)., , , , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 1195-1204. Springer, (2009)Executing Divisible Jobs on a Network with a Fixed Number of Processors., and . COCOON, volume 1449 of Lecture Notes in Computer Science, page 241-250. Springer, (1998)Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications., and . COCOON, volume 1090 of Lecture Notes in Computer Science, page 169-178. Springer, (1996)Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chess., , and . CIG, page 260-266. IEEE, (2015)