Publications

André Vignatti, Renato S. de Melo, Flávio K. Miyazawa, Matheus J. Ota (2023). Combinatorial Dual Bounds on the Least Cost Influence Problem. In Pesquisa Operacional 2023, Volume 43.

André Vignatti, Fernando F. Druszcz (2023). Citation Disparity in Sub-Areas of Brazilian Computer Science. In WPCCG 2023 - V Workshop de Pesquisa em Computação dos Campos Gerais.

André Vignatti, Alane M. de Lima, Murilo V. G. da Silva (2023). A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs. In Journal of Graph Algorithms and Applications.

André Vignatti, Alane M. de Lima, Murilo V. G. da Silva (2022). Estimating the Clustering Coefficient Using Sample Complexity Analysis. In LATIN 2022 - 15th Latin American Theoretical Informatics Symposium.

André Vignatti, Alane M. de Lima, Murilo V. G. da Silva (2021). A Deductive-Formal Derivation for the Preferential Attachment Metric for Link Prediction. In WPCCG 2021 - IV Workshop de Pesquisa em Computação dos Campos Gerais.

André Vignatti, Alane M. Lima, Murilo V. G. Silva (2021). Percolation Centrality via Rademacher Complexity. In Discrete Applied Mathematics.

André Vignatti, Fernando C. Erd, Murilo V. G. Silva (2021). The Generalized Influence Blocking Maximization Problem. In Social Network Analysis and Mining.

André Vignatti, Alane M. Lima, Murilo V. G. Silva (2021). Problema APSP via Dimensão-VC e Médias de Rademacher. In ETC'21 - VI Encontro de Teoria da Computação.

André Vignatti, Fernando C. Erd, Murilo V. G. da Silva (2020). Blocking the Spread of Misinformation in a Network under Distinct Cost Models. In ASONAM'20 - IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

André Vignatti, Renato S. Melo, Flávio K. Miyazawa, Matheus J. Ota (2020). Tighter Dual Bounds on the Least Cost Influence Problem. In SBPO'20 - LII Brazilian Symposium of Operational Research.

André Vignatti, Renato S. Melo (2020). Preprocessing Rules for Target Set Selection in Complex Networks. In BRASNAM'20 - IX Brazilian Workshop on Social Network Analysis and Mining.

André Vignatti, Alane M. de Lima, Murilo V. G. da Silva (2020). Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory. In ACM SIGKDD'20 - International Conference on Knowledge Discovery & Data Mining.

André Vignatti, Nicollas M. Sdroievski, Murilo V. G. da Silva (2019). The Hidden Subgroup Problem and MKTP. Theoretical Computer Science Vol. 795, p. 204-212 (also on ECCC - Electronic Colloquium on Computational Complexity).

André Vignatti, Alane M. de Lima, Giovanne M. Santos, Murilo V. G. da Silva (2019). Estimando Centralidade de Percolação utilizando Amostragem e Teoria da Dimensão Vapnik-Chervonenkis. In WPCCG 2019 - III Workshop de Pesquisa em Computação dos Campos Gerais.

André Vignatti, Alane M. de Lima, Murilo V. G. da Silva (2019). Recognizing Power-law Graphs by Machine Learning Algorithms using a Reduced Set of Structural Features. In SBC ENIAC'19 - XVI National Meeting on Artificial and Computational Intelligence.

André Vignatti, Bruno H. Labres (2018). Características Topológicas de Redes do Mundo Real. In EVINCI'18 - XXVI Evento de Iniciação Científica da Universidade Federal do Paraná.

André Vignatti, Renato S. Melo (2018). A preselection algorithm for the influence maximization problem in power law graphs. In ACM SAC'18 - 33rd Annual ACM Symposium on Applied Computing.

André Vignatti, Camile F. Bordini (2017). An Approximation Algorithm for the p-Hub Median Problem. In LAGOS'17 – IX Latin and American Algorithms, Graphs and Optimization (Electronic Notes in Discrete Mathematics Vol. 62, p. 183-188).

André Vignatti, Renato S. Melo, Arthur P. Costa, Felipe Nascimento (2017). Participação Feminina no Cinema Brasileiro: Análise Através de Redes Sociais. In WPCCG 2017 - II Workshop de Pesquisa em Computação dos Campos Gerais.

André Vignatti, Murilo V. G. da Silva (2016). Minimum Vertex Cover in Generalized Random Graphs with Power Law Degree Distribution. Theoretical Computer Science, Vol. 647, p. 101-111.

André Vignatti, Edgar O. Cabral Filho, Mariana O. da Silva (2015). Utilização de Regras de Redução em Grafos Power Law: Problema da Cobertura por Vértices. In VI Escola Regional de Informática da SBC - Mato Grosso.

André Vignatti, Santiago Viertel (2015). Programação matemática e imersões métricas para aproximações em problemas de corte. *Revista de Informática Teórica e Aplicada, Vol 22, No. 1.

André Vignatti, Flávio K. Miyazawa, Luiz F. Bittencourt (2012). Distributed Load Balancing Algorithms for Heterogeneous Players in Asynchronous Networks. Journal of Universal Computer Science, Vol. 18, No. 20, p. 2771–2797.

André Vignatti, Tiago Vignatti, Everton F. R. Seára, Marcos S. Sunye, Luís C. E. Bona, Anne Doucet (2012). Extending OAI-PMH over structured P2P networks for digital preservation. International Journal on Digital Libraries, Vol 12, p. 13–26.

André Vignatti, Flávio K. Miyazawa (2011). Bounds on the Convergence Time of Distributed Selfish Bin Packing. International Journal of Foundations of Computer Science Vol. 22, No. 03, p. 565-582.

André Vignatti, Flávio K. Miyazawa (2009). Convergence Time to Nash Equilibrium in Selfish Bin Packing. In LAGOS'09 – V Latin-American Algorithms, Graphs and Optimization Symposium (Electronic Notes in Discrete Mathematics, 35, p. 151 - 156).

André Vignatti, Tiago Vignatti, Luís C. E. Bona, Marcos S. Sunye (2009). Long-term digital archiving based on selection of repositories over P2P networks. In IEEE P2P'09 - International Conference on Peer-to-Peer Computing.

André Vignatti, Flávio K. Miyazawa (2009). Distributed Selfish Bin Packing. In IEEE IPDPS'09 - International Symposium on Parallel & Distributed Processing.

André Vignatti, Tiago Vignatti, Luiz C. E. Bona, Marcos S. Sunye (2009). Arquivamento Digital a Longo Prazo Baseado em Selecao de Repositorios em Redes Peer-to-Peer. In SBC WP2P'09 - Workshop de Redes Dinâmicas e Sistemas P2P.