Author of the publication

Minmax-Regret Evacuation Planning for Cycle Networks.

, , , , and . TAMC, volume 11436 of Lecture Notes in Computer Science, page 42-58. Springer, (2019)

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

Online graph exploration algorithms for cycles and trees by multiple searchers., , , and . J. Comb. Optim., 28 (2): 480-495 (2014)Minimax Regret 1-Sink Location Problems in Dynamic Path Networks., , , , , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 121-132. Springer, (2013)Online Exploration of All Vertices in a Simple Polygon., and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 315-326. Springer, (2012)An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths., , and . AAIM, volume 4508 of Lecture Notes in Computer Science, page 178-190. Springer, (2007)Multiple Sink Location Problems in Dynamic Path Networks., , and . AAIM, volume 8546 of Lecture Notes in Computer Science, page 149-161. Springer, (2014)Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior., , and . Discovery Science, volume 1967 of Lecture Notes in Computer Science, page 263-267. Springer, (2000)A Rooted-Forest Partition with Uniform Vertex Demand., and . WALCOM, volume 5942 of Lecture Notes in Computer Science, page 179-190. Springer, (2010)Minsum k-sink problem on path networks., , , , and . Theor. Comput. Sci., (2020)Foreword.. Algorithmica, 44 (2): 101-101 (2006)A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems., , and . Inf. Process. Lett., 64 (5): 255-261 (1997)