Giovanna Kobus Conrado

Orcid: 0000-0001-9474-6505

According to our database1, Giovanna Kobus Conrado authored at least 11 papers between 2023 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
On the Decidability of Verification under Release/Acquire.
CoRR, April, 2026

2025
CFL-based methods for approximating interleaved Dyck reachability.
Int. J. Softw. Tools Technol. Transf., April, 2025

Parameterized Graph Algorithms and Their Role in Static Program Analysis. (Algorithmes de graphes paramétrés et leur rôle dans l'analyse statique des programmes).
PhD thesis, 2025

Program Analysis via Multiple Context Free Language Reachability.
Proc. ACM Program. Lang., 2025

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity.
Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2024
Faster Treewidth-Based Approximations for Wiener Index.
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

A Better Approximation for Interleaved Dyck Reachability.
Proceedings of the 13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, 2024

PYRAMID: A Protocol for Private and Trustless Multi-level Marketing on the Blockchain.
Proceedings of the 6th International Conference on Blockchain Computing and Applications, 2024

2023
The Bounded Pathwidth of Control-Flow Graphs.
Proc. ACM Program. Lang., October, 2023

Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis.
Proc. ACM Program. Lang., October, 2023

Parameterized Algorithms for Topological Indices in Chemistry.
CoRR, 2023


  Loading...