Vinícius G. P. de Sá

According to our database1, Vinícius G. P. de Sá authored at least 28 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On the embedding of cone graphs in the line with distinct distances between neighbors.
Discret. Appl. Math., 2019

Dijkstra graphs.
Discret. Appl. Math., 2019

Full Characterization of a Class of Graphs Tailored for Software Watermarking.
Algorithmica, 2019

2018
On the resilience of canonical reducible permutation graphs.
Discret. Appl. Math., 2018

2017
Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs.
Int. J. Comput. Geom. Appl., 2017

2016
Software control and intellectual property protection in cyber-physical systems.
EURASIP J. Inf. Secur., 2016

Near-linear-time algorithm for the geodetic Radon number of grids.
Discret. Appl. Math., 2016

Dijkstra Graphs.
CoRR, 2016

2015
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges.
Discret. Appl. Math., 2015

The Graphs of Structured Programming.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Fair Fingerprinting Protocol for Attesting Software Misuses.
Proceedings of the 10th International Conference on Availability, Reliability and Security, 2015

2014
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs.
Theor. Comput. Sci., 2014

Blind-friendly von Neumann's Heads or Tails.
Am. Math. Mon., 2014

Linear-Time Approximation Algorithms for Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013
Geodetic Number versus Hull Number in P<sub>3</sub>-Convexity.
SIAM J. Discret. Math., 2013

A tight bound for exhaustive key search attacks against Message Authentication Codes.
RAIRO Theor. Informatics Appl., 2013

Polynomial time algorithm for the Radon number of grids in the geodetic convexity.
Electron. Notes Discret. Math., 2013

On the geodetic Radon number of grids.
Discret. Math., 2013

Towards a provably robust graph-based watermarking scheme
CoRR, 2013

Towards a Provably Resilient Scheme for Graph-Based Watermarking.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

2011
Complexity dichotomy on partial grid recognition.
Theor. Comput. Sci., 2011

2010
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges.
Electron. Notes Discret. Math., 2010

2006
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem.
Inf. Process. Lett., 2006

Algorithms for the Homogeneous Set Sandwich Problem.
Algorithmica, 2006

2005
Note on the Homogeneous Set Sandwich Problem.
Inf. Process. Lett., 2005

2004
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004


  Loading...