default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVinícius G. P. de Sá
Person information
- affiliation: Federal University of Rio de Janeiro, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Lucila M. S. Bento
, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius G. P. de Sá, Jayme Luiz Szwarcfiter:
Structured Watermarks for Structured Software. SN Comput. Sci. 5(5): 568 (2024)
2010 – 2019
- 2019
- [j19]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Full Characterization of a Class of Graphs Tailored for Software Watermarking. Algorithmica 81(7): 2899-2916 (2019) - [j18]Rodrigo M. Zhou, Celina M. H. de Figueiredo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá:
On the embedding of cone graphs in the line with distinct distances between neighbors. Discret. Appl. Math. 256: 157-162 (2019) - [j17]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Flávio Keidi Miyazawa, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Dijkstra graphs. Discret. Appl. Math. 261: 52-62 (2019) - 2018
- [j16]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
On the resilience of canonical reducible permutation graphs. Discret. Appl. Math. 234: 32-46 (2018) - 2017
- [j15]Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina Miraglia Herrera de Figueiredo:
Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 27(4): 255-276 (2017) - 2016
- [j14]Mitre Costa Dourado, Vinícius Gusmão Pereira de Sá, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Near-linear-time algorithm for the geodetic Radon number of grids. Discret. Appl. Math. 210: 277-283 (2016) - [j13]Raphael C. S. Machado, Davidson R. Boccardo, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Software control and intellectual property protection in cyber-physical systems. EURASIP J. Inf. Secur. 2016: 8 (2016) - [i7]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Dijkstra Graphs. CoRR abs/1602.08653 (2016) - 2015
- [j12]Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Raphael Carlos Santos Machado, Celina Miraglia Herrera de Figueiredo:
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges. Discret. Appl. Math. 197: 3-19 (2015) - [c6]Raphael C. S. Machado, Davidson R. Boccardo, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Fair Fingerprinting Protocol for Attesting Software Misuses. ARES 2015: 110-119 - [i6]Lucila M. S. Bento, Davidson R. Boccardo, Raphael Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
The Graphs of Structured Programming. CTW 2015: 105-108 - 2014
- [j11]Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo:
Blind-friendly von Neumann's Heads or Tails. Am. Math. Mon. 121(7): 600-609 (2014) - [j10]Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius Gusmão Pereira de Sá, Raphael C. S. Machado:
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. Theor. Comput. Sci. 540: 70-81 (2014) - [c5]Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo:
Linear-Time Approximation Algorithms for Unit Disk Graphs. WAOA 2014: 132-143 - [i5]Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo:
Linear-Time Approximation Algorithms for Unit Disk Graphs. CoRR abs/1402.4722 (2014) - [i4]Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo:
Blind-friendly von Neumann's Heads or Tails. CoRR abs/1403.2092 (2014) - 2013
- [j9]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
On the geodetic Radon number of grids. Discret. Math. 313(1): 111-121 (2013) - [j8]Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Polynomial time algorithm for the Radon number of grids in the geodetic convexity. Electron. Notes Discret. Math. 44: 371-376 (2013) - [j7]Vinícius G. P. de Sá, Davidson R. Boccardo, Luiz Fernando Rust C. Carmo, Raphael C. S. Machado:
A tight bound for exhaustive key search attacks against Message Authentication Codes. RAIRO Theor. Informatics Appl. 47(2): 171-180 (2013) - [j6]Carmen C. Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
Geodetic Number versus Hull Number in P3-Convexity. SIAM J. Discret. Math. 27(2): 717-731 (2013) - [c4]Lucila Maria Souza Bento, Davidson R. Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Towards a Provably Resilient Scheme for Graph-Based Watermarking. WG 2013: 50-63 - [i3]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Towards a provably robust graph-based watermarking scheme. CoRR abs/1302.7262 (2013) - 2012
- [c3]Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado:
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. WAOA 2012: 82-92 - [c2]Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity. WG 2012: 262-273 - [i2]Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado:
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. CoRR abs/1204.3488 (2012) - 2011
- [j5]Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael C. S. Machado, Celina M. H. de Figueiredo:
Complexity dichotomy on partial grid recognition. Theor. Comput. Sci. 412(22): 2370-2379 (2011) - 2010
- [j4]Vinícius G. P. de Sá, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Raphael Machado:
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. Electron. Notes Discret. Math. 36: 391-398 (2010) - [i1]Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael Machado, Celina M. H. de Figueiredo:
Complexity dichotomy on partial grid recognition. CoRR abs/1006.3541 (2010)
2000 – 2009
- 2006
- [j3]Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad:
Algorithms for the Homogeneous Set Sandwich Problem. Algorithmica 46(2): 149-180 (2006) - [j2]Claudson F. Bornstein, Celina M. H. de Figueiredo, Vinícius G. P. de Sá:
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem. Inf. Process. Lett. 98(3): 87-91 (2006) - 2005
- [j1]Celina M. H. de Figueiredo, Vinícius G. P. de Sá:
Note on the Homogeneous Set Sandwich Problem. Inf. Process. Lett. 93(2): 75-81 (2005) - 2004
- [c1]Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad:
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. WEA 2004: 243-252
Coauthor Index
aka: Celina Miraglia Herrera de Figueiredo
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
