Author of the publication

A Note on Total and Paired Domination of Cartesian Product Graphs.

, , and . Electron. J. Comb., 20 (3): 25 (2013)

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

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs., , , , , and . CoRR, (2023)Fault-Tolerant ST-Diameter Oracles., , , , , and . ICALP, volume 261 of LIPIcs, page 24:1-24:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Dynamic DFS in Undirected Graphs: breaking the O(m) barrier., , , and . SODA, page 730-739. SIAM, (2016)Efficient Oracles and Routing Schemes for Replacement Paths., , , , , and . STACS, volume 96 of LIPIcs, page 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)An Optimal Dual Fault Tolerant Reachability Oracle.. ICALP, volume 55 of LIPIcs, page 130:1-130:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Diameter Spanner, Eccentricity Spanner, and Approximating Extremal Graph Distances: Static, Dynamic, and Fault Tolerant., and . CoRR, (2018)Efficiently Realizing Interval Sequences., , , and . SIAM J. Discret. Math., 34 (4): 2318-2337 (2020)Graph realizations: Maximum degree in vertex neighborhoods., , , and . Discret. Math., 346 (9): 113483 (September 2023)Pairwise Reachability Oracles and Preservers under Failures., , and . CoRR, (2021)Approximate Single Source Fault Tolerant Shortest Path., , , and . SODA, page 1901-1915. SIAM, (2018)