Author of the publication

Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink.

, , and . IEEE Trans. Computers, 62 (10): 1932-1944 (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

Computing with Tangles., and . STOC, page 683-692. ACM, (2015)Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes., and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 111-118. Springer, (2013)Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic., and . Logical Methods in Computer Science, (2019)Switching Reconstruction of Digraphs., and . J. Graph Theory, 76 (4): 279-296 (2014)A Faster Isomorphism Test for Graphs of Small Degree., , and . SIAM J. Comput., 52 (6): S18-1 (December 2023)Engineering a Fast Probabilistic Isomorphism Test., and . ALENEX, page 73-84. SIAM, (2021)A Linear-Time Algorithm for Testing Outer-1-Planarity., , , , , and . GD, volume 8242 of Lecture Notes in Computer Science, page 71-82. Springer, (2013)The Weisfeiler-Leman dimension of planar graphs is at most 3., , and . LICS, page 1-12. IEEE Computer Society, (2017)An Upper Bound on the Weisfeiler-Leman Dimension., and . CoRR, (2024)Progress on Certifying Algorithms., and . FAW, volume 6213 of Lecture Notes in Computer Science, page 1-5. Springer, (2010)