default search action
André Luís Vignatti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs. J. Graph Algorithms Appl. 27(7): 603-619 (2023) - 2022
- [j10]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Percolation centrality via Rademacher Complexity. Discret. Appl. Math. 323: 201-216 (2022) - [c6]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Estimating the Clustering Coefficient Using Sample Complexity Analysis. LATIN 2022: 328-341 - 2021
- [j9]Fernando C. Erd, André Luís Vignatti, Murilo V. G. da Silva:
The generalized influence blocking maximization problem. Soc. Netw. Anal. Min. 11(1): 55 (2021) - 2020
- [c5]Fernando C. Erd, André Luís Vignatti, Murilo V. G. da Silva:
Blocking the Spread of Misinformation in a Network under Distinct Cost Models. ASONAM 2020: 232-236 - [c4]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory. KDD 2020: 1839-1847
2010 – 2019
- 2019
- [j8]Nicollas M. Sdroievski, Murilo V. G. da Silva, André Luís Vignatti:
The Hidden Subgroup Problem and MKTP. Theor. Comput. Sci. 795: 204-212 (2019) - [i6]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Approximating the Percolation Centrality through Sampling and Pseudo-dimension. CoRR abs/1910.00494 (2019) - [i5]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity. CoRR abs/1911.13144 (2019) - 2018
- [c3]Renato S. Melo, André Luís Vignatti:
A preselection algorithm for the influence maximization problem in power law graphs. SAC 2018: 1782-1789 - [i4]Nicollas M. Sdroievski, Murilo V. G. da Silva, André Luís Vignatti:
An Indexing for Quadratic Residues Modulo N and a Non-uniform Efficient Decoding Algorithm. CoRR abs/1805.04731 (2018) - [i3]Santiago Viertel, André Luís Vignatti:
Labeling Algorithm and Compact Routing Scheme for a Small World Network Model. CoRR abs/1806.01469 (2018) - [i2]Santiago Viertel, André Luís Vignatti:
Small World Model based on a Sphere Homeomorphic Geometry. CoRR abs/1808.01028 (2018) - [i1]Nicollas M. Sdroievski, Murilo V. G. da Silva, André Luís Vignatti:
The Hidden Subgroup Problem and MKTP. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j7]Camile Frazão Bordini, André Luís Vignatti:
An Approximation Algorithm for the p-Hub Median Problem. Electron. Notes Discret. Math. 62: 183-188 (2017) - 2016
- [j6]André Luís Vignatti, Murilo Vicente Gonçalves da Silva:
Minimum vertex cover in generalized random graphs with power law degree distribution. Theor. Comput. Sci. 647: 101-111 (2016) - 2015
- [j5]Santiago Viertel, André Luís Vignatti:
Programação matemática e imersões métricas para aproximações em problemas de corte. RITA 22(1): 95-118 (2015) - 2012
- [j4]Everton F. R. Seára, Marcos Sfair Sunyé, Luis C. E. Bona, Tiago Vignatti, André Luís Vignatti, Anne Doucet:
Extending OAI-PMH over structured P2P networks for digital preservation. Int. J. Digit. Libr. 12(1): 13-26 (2012) - [j3]Luiz F. Bittencourt, Flávio Keidi Miyazawa, André Luís Vignatti:
Distributed Load Balancing Algorithms for Heterogeneous Players in Asynchronous Networks. J. Univers. Comput. Sci. 18(20): 2771-2797 (2012) - 2011
- [j2]Flávio Keidi Miyazawa, André Luís Vignatti:
Bounds on the Convergence Time of Distributed Selfish Bin Packing. Int. J. Found. Comput. Sci. 22(3): 565-582 (2011) - 2010
- [b1]André Luís Vignatti:
Convergence time to the Nash equilibrium in packing and load balancing games. University of Campinas, Brazil, 2010
2000 – 2009
- 2009
- [j1]Flávio Keidi Miyazawa, André Luís Vignatti:
Convergence Time to Nash Equilibrium in Selfish Bin Packing. Electron. Notes Discret. Math. 35: 151-156 (2009) - [c2]Flávio Keidi Miyazawa, André Luís Vignatti:
Distributed selfish bin packing. IPDPS 2009: 1-8 - [c1]Tiago Vignatti, Luis Carlos Erpen De Bona, André Luís Vignatti, Marcos Sfair Sunyé:
Long-term Digital Archiving Based on Selection of Repositories Over P2P Networks. Peer-to-Peer Computing 2009: 194-203
Coauthor Index
aka: Murilo Vicente Gonçalves da Silva
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-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint