Distributed selfish bin packing. - Flávio Keidi Miyazawa; André Luís Vignatti (IPDPS, 2009)

Long-term Digital Archiving Based on Selection of Repositories Over P2P Networks. - Tiago Vignatti; Luis Carlos Erpen De Bona; André Luís Vignatti; Marcos Sfair Sunyé (Peer-to-Peer Computing, 2009)

Convergence Time to Nash Equilibrium in Selfish Bin Packing. - Flávio Keidi Miyazawa; André Luís Vignatti (Electron. Notes Discret. Math., 2009)

Convergence time to the Nash equilibrium in packing and load balancing games. - André Luís Vignatti (2010)

Bounds on the Convergence Time of Distributed Selfish Bin Packing. - Flávio Keidi Miyazawa; André Luís Vignatti (Int. J. Found. Comput. Sci., 2011)

Extending OAI-PMH over structured P2P networks for digital preservation. - Everton F. R. Seára; Marcos Sfair Sunyé; Luis C. E. Bona; Tiago Vignatti; André Luís Vignatti; Anne Doucet (Int. J. Digit. Libr., 2012)

Distributed Load Balancing Algorithms for Heterogeneous Players in Asynchronous Networks. - Luiz F. Bittencourt; Flávio Keidi Miyazawa; André Luís Vignatti (J. Univers. Comput. Sci., 2012)

Programação matemática e imersões métricas para aproximações em problemas de corte. - Santiago Viertel; André Luís Vignatti (RITA, 2015)

Minimum vertex cover in generalized random graphs with power law degree distribution. - André Luís Vignatti; Murilo Vicente Gonçalves da Silva (Theor. Comput. Sci., 2016)

An Approximation Algorithm for the p-Hub Median Problem. - Camile Frazão Bordini; André Luís Vignatti (Electron. Notes Discret. Math., 2017)

A preselection algorithm for the influence maximization problem in power law graphs. - Renato S. Melo; André Luís Vignatti (SAC, 2018)

An Indexing for Quadratic Residues Modulo N and a Non-uniform Efficient Decoding Algorithm. - Nicollas M. Sdroievski; Murilo V. G. da Silva; André Luís Vignatti (CoRR, 2018)

Labeling Algorithm and Compact Routing Scheme for a Small World Network Model. - Santiago Viertel; André Luís Vignatti (CoRR, 2018)

Small World Model based on a Sphere Homeomorphic Geometry. - Santiago Viertel; André Luís Vignatti (CoRR, 2018)

Approximating the Percolation Centrality through Sampling and Pseudo-dimension. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (CoRR, 2019)

Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (CoRR, 2019)

The Hidden Subgroup Problem and MKTP. - Nicollas M. Sdroievski; Murilo V. G. da Silva; André Luís Vignatti (Theor. Comput. Sci., 2019)

Blocking the Spread of Misinformation in a Network under Distinct Cost Models. - Fernando C. Erd; André Luís Vignatti; Murilo V. G. da Silva (ASONAM, 2020)

Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (KDD, 2020)

The generalized influence blocking maximization problem. - Fernando C. Erd; André Luís Vignatti; Murilo V. G. da Silva (Soc. Netw. Anal. Min., 2021)

Estimating the Clustering Coefficient Using Sample Complexity Analysis. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (LATIN, 2022)

Percolation centrality via Rademacher Complexity. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (Discret. Appl. Math., 2022)

A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (J. Graph Algorithms Appl., 2023)