Author of the publication

Lower Bounds and Algorithms for Dominating Sets in Web Graphs.

, , and . Internet Math., 2 (3): 275-300 (2005)

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

Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017., and . J. Comput. Syst. Sci., (2020)From Balls and Bins to Points and Vertices., , , and . Algorithmic Oper. Res., 4 (2): 133-143 (2009)Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality., , , , , , and . J. Comput. Syst. Sci., (2018)Monitoring the edges of product networks using distances., , , and . CoRR, (2022)On the distance-edge-monitoring numbers of graphs., , , and . Discret. Appl. Math., (January 2024)Optimal Embedding of Complete Binary Trees into Lines and Grids., , , and . J. Parallel Distributed Comput., 49 (1): 40-56 (1998)Hardness and Approximation of Gathering in Static Radio Networks., , , , and . Parallel Process. Lett., 16 (2): 165-184 (2006)Computing Parameters of Sequence-Based Dynamic Graphs., , , and . Theory Comput. Syst., 63 (3): 394-417 (2019)Efficient Exploration of Anonymous Undirected Graphs.. IWOCA, volume 8288 of Lecture Notes in Computer Science, page 7-13. Springer, (2013)A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks., , , , and . J. Parallel Distributed Comput., (November 2023)