André Vignatti is an associate professor at DINF-UFPR since 2011. His research seeks to discover the role of randomization in computational problems and the design of algorithms. For more details, you can read a short bibliography
Interests
- Design and Analysis of Algorithms
- Randomized Computation
- Complex Networks
- Theoretical Computer Science
Education
-
Visiting Scholar, 2019
Università di Salerno
-
PhD in Computer Science, 2010
University of Campinas (UNICAMP)
-
MSc in Computer Science, 2006
University of Campinas (UNICAMP)
-
BSc in Computer Science, 2004
Federal University of Paraná (UFPR)
Courses
Publications
(2023).
Combinatorial Dual Bounds on the Least Cost Influence Problem.
In Pesquisa Operacional.
(2022).
Estimating the Clustering Coefficient Using Sample Complexity Analysis.
In LATIN 2022 - 15th Latin American Theoretical Informatics Symposium.
(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.
(2021).
Percolation Centrality via Rademacher Complexity.
In Discrete Applied Mathematics.
(2021).
Problema APSP via Dimensão-VC e Médias de Rademacher.
In ETC'21 - VI Encontro de Teoria da Computação.
(2021).
The Generalized Influence Blocking Maximization Problem.
In Social Network Analysis and Mining.
(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.
(2020).
Preprocessing Rules for Target Set Selection in Complex Networks.
In BRASNAM'20 - IX Brazilian Workshop on Social Network Analysis and Mining.
(2020).
Tighter Dual Bounds on the Least Cost Influence Problem.
In SBPO'20 - LII Brazilian Symposium of Operational Research.
Contact
- vignatti@inf.ufpr.br
- +55 41 3361 3569
- Rua Cel. Francisco Heráclito dos Santos, 100, Curitiba, PR 81531-980
- Enter DINF building, take the stairs, search for a room with my name
- Telegram Me