Efficient Computation of the Outer Hull of a Discrete Path. - Srecko Brlek; Hugo Tremblay; Jérôme Tremblay; Romaine Weber (DGCI, 2014)

On the Arithmetics of Discrete Figures. - Alexandre Blondin Massé; Amadou Makhtar Tall; Hugo Tremblay (LATA, 2014)

Exhaustive generation of atomic combinatorial differential operators. - Hugo Tremblay; Gilbert Labelle; Srecko Brlek; Alexandre Blondin Massé (Theor. Comput. Sci., 2014)

Parallelogram Morphisms and Circular Codes. - Alexandre Blondin Massé; Mélodie Lapointe; Hugo Tremblay (LATA, 2016)

Efficient operations on discrete paths. - Alexandre Blondin Massé; Srecko Brlek; Hugo Tremblay (Theor. Comput. Sci., 2016)

Computing a lower bound for the solution of a Robotic Process Automation (RPA) problem using network flows. - Imène Benkalaï; Sara Séguin; Hugo Tremblay; Geoffrey Glangine (CoDIT, 2020)

A Generic Explainability Framework for Function Circuits. - Sylvain Hallé; Hugo Tremblay (TaPP, 2020)

The cross cyclomatic complexity: a bi-dimensional measure for program complexity on graphs. - Hugo Tremblay; Fábio Petrillo (CoRR, 2020)

Foundations of Fine-Grained Explainability. - Sylvain Hallé; Hugo Tremblay (CAV (2), 2021)

Minimizing the number of robots required for a Robotic Process Automation (RPA) problem. - Sara Séguin; Hugo Tremblay; Imène Benkalaï; David-Emmanuel Perron-Chouinard; Xavier Lebeuf (KES, 2021)

Automated Difficulty Assessment Model for Platformer Games: A Comprehensive Approach. - Yannick Francillette; Hugo Tremblay; Bruno Bouchard 001; Simon Lescieux; Mathis Rozon; Jules Linard (GEM, 2023)

Robotic Process Automation (RPA) using a heuristic method and the effective resistance of a graph. - Hugo Tremblay; Sara Séguin; Laurie-Ann Boily; Véronique Du Paul; Sophie Lalancette (KES, 2023)

Automated Difficulty Assessment Model for Comprehensive Difficulty in Games. - Yannick Francillette; Hugo Tremblay; Bruno Bouchard 001 (GEM, 2024)

A heuristic method to solve an assignment problem using a random walk approximation. - Léo Monteiro; Hugo Tremblay; Sara Séguin (KES, 2024)

On the generation of discrete figures with connectivity constraints. - Hugo Tremblay; Julien Vernay (RAIRO Theor. Informatics Appl., 2024)

A Comprehensive Model of Automated Evaluation of Difficulty in Platformer Games. - Yannick Francillette; Hugo Tremblay; Bruno Bouchard 001; Bob-Antoine Menelas (Games Res. Pract., 2025)

A theory of fine-grained lineage for functions on structured objects. - Sylvain Hallé; Hugo Tremblay (Theor. Comput. Sci., 2025)