( en | de | ru )

 

Disambiguation of "de Sá, Vinícius Gusmão Pereira"

Author of the publication

copydeleteadd this publication to your clipboard
The Graphs of Structured Programming.

, , , , and . CTW, page 105-108. (2015)

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.

Fernando Leal Sá Pereira

Roberto Horácio Sá Pereira

Vinícius Liebel

Vinícius Maran

Bailon Sá

 

Other publications of authors with the same name

Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity., , , and . WG, volume 7551 of Lecture Notes in Computer Science, page 262-273. Springer, (2012)Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs., , and . Int. J. Comput. Geom. Appl., 27 (4): 255-276 (2017)Polynomial time algorithm for the Radon number of grids in the geodetic convexity., , , and . Electron. Notes Discret. Math., (2013)Full Characterization of a Class of Graphs Tailored for Software Watermarking., , , , and . Algorithmica, 81 (7): 2899-2916 (2019)Near-linear-time algorithm for the geodetic Radon number of grids., , , and . Discret. Appl. Math., (2016)Efficient sub-5 approximations for minimum dominating sets in unit disk graphs., , , and . Theor. Comput. Sci., (2014)Dijkstra graphs., , , , , and . Discret. Appl. Math., (2019)Linear-Time Approximation Algorithms for Unit Disk Graphs., , and . WAOA, volume 8952 of Lecture Notes in Computer Science, page 132-143. Springer, (2014)Towards a provably robust graph-based watermarking scheme, , , , and . CoRR, (2013)Dijkstra Graphs., , , , and . CoRR, (2016)