Author of the publication

Models and Algorithms for Graph Watermarking.

, , , , , and . ISC, volume 9866 of Lecture Notes in Computer Science, page 283-301. Springer, (2016)

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

New Applications of the Nearest-Neighbor Chain Algorithm.. University of California, Irvine, USA, (2019)Taming the Knight's Tour: Minimizing Turns and Crossings., , , and . CoRR, (2019)Taming the Knight's Tour: Minimizing Turns and Crossings., , , and . FUN, volume 157 of LIPIcs, page 4:1-4:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)SANA: simulated annealing far outperforms many other search algorithms for biological network alignment., and . Bioinform., 33 (14): 2156-2164 (2017)Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms., , , and . ICALP, volume 107 of LIPIcs, page 89:1-89:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Algorithms for Stable Matching and Clustering in a Grid., , and . IWCIA, volume 10256 of Lecture Notes in Computer Science, page 117-131. Springer, (2017)Defining Equitable Geographic Districts in Road Networks via Stable Matching., , , and . SIGSPATIAL/GIS, page 52:1-52:4. ACM, (2017)Reactive Proximity Data Structures for Graphs., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 777-789. Springer, (2018)New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs., , , , , , , and . ISAAC, volume 149 of LIPIcs, page 51:1-51:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)