Henrique Stagni

Orcid: 0000-0002-3649-0481

According to our database1, Henrique Stagni authored at least 10 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Tight Bound for Testing Partition Properties.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Resilience for loose Hamilton cycles.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2021
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties.
SIAM J. Discret. Math., 2021

2020
Testing linear inequalities of subgraph statistics.
Electron. Colloquium Comput. Complex., 2020

Estimating parameters associated with monotone properties.
Comb. Probab. Comput., 2020

2019
Extremal and probabilistic results for order types.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Property Testing for Point Sets on the Plane.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Estimating the distance to a hereditary graph property.
Electron. Notes Discret. Math., 2017

2012
Semantic information extraction from images of complex documents.
Appl. Intell., 2012

2009
Budding yeast cell cycle modeled by context-sensitive probabilistic Boolean network.
Proceedings of the 2009 IEEE International Workshop on Genomic Signal Processing and Statistics, 2009


  Loading...