André Luís Vignatti

Orcid: 0000-0001-8268-5215

According to our database1, André Luís Vignatti authored at least 23 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs.
J. Graph Algorithms Appl., 2023

2022
Percolation centrality via Rademacher Complexity.
Discret. Appl. Math., 2022

Estimating the Clustering Coefficient Using Sample Complexity Analysis.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
The generalized influence blocking maximization problem.
Soc. Netw. Anal. Min., 2021

2020
Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Blocking the Spread of Misinformation in a Network under Distinct Cost Models.
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2020

2019
The Hidden Subgroup Problem and MKTP.
Theor. Comput. Sci., 2019

Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity.
CoRR, 2019

Approximating the Percolation Centrality through Sampling and Pseudo-dimension.
CoRR, 2019

2018
Small World Model based on a Sphere Homeomorphic Geometry.
CoRR, 2018

Labeling Algorithm and Compact Routing Scheme for a Small World Network Model.
CoRR, 2018

An Indexing for Quadratic Residues Modulo N and a Non-uniform Efficient Decoding Algorithm.
CoRR, 2018

A preselection algorithm for the influence maximization problem in power law graphs.
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018

2017
An Approximation Algorithm for the <i>p</i>-Hub Median Problem.
Electron. Notes Discret. Math., 2017

2016
Minimum vertex cover in generalized random graphs with power law degree distribution.
Theor. Comput. Sci., 2016

2015
Programação matemática e imersões métricas para aproximações em problemas de corte.
RITA, 2015

2012
Distributed Load Balancing Algorithms for Heterogeneous Players in Asynchronous Networks.
J. Univers. Comput. Sci., 2012

Extending OAI-PMH over structured P2P networks for digital preservation.
Int. J. Digit. Libr., 2012

2011
Bounds on the Convergence Time of Distributed Selfish Bin Packing.
Int. J. Found. Comput. Sci., 2011

2010
Convergence time to the Nash equilibrium in packing and load balancing games.
PhD thesis, 2010

2009
Convergence Time to Nash Equilibrium in Selfish Bin Packing.
Electron. Notes Discret. Math., 2009

Long-term Digital Archiving Based on Selection of Repositories Over P2P Networks.
Proceedings of the Proceedings P2P 2009, 2009

Distributed selfish bin packing.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009


  Loading...