Vinícius G. P. de Sá
Orcid: 0000-0002-4925-9609Affiliations:
- Federal University of Rio de Janeiro, Brazil
According to our database1,
Vinícius G. P. de Sá
authored at least 29 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dcc.ufrj.br
On csauthors.net:
Bibliography
2024
2019
On the embedding of cone graphs in the line with distinct distances between neighbors.
Discret. Appl. Math., 2019
Algorithmica, 2019
2018
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
EURASIP J. Inf. Secur., 2016
Discret. Appl. Math., 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
Proceedings of the 10th International Conference on Availability, Reliability and Security, 2015
2014
Theor. Comput. Sci., 2014
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014
2013
SIAM J. Discret. Math., 2013
A tight bound for exhaustive key search attacks against Message Authentication Codes.
RAIRO Theor. Informatics Appl., 2013
Electron. Notes Discret. Math., 2013
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
2010
Electron. Notes Discret. Math., 2010
2006
Inf. Process. Lett., 2006
2005
2004
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004