default search action
Hugo Tremblay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Hugo Tremblay, Julien Vernay:
On the generation of discrete figures with connectivity constraints. RAIRO Theor. Informatics Appl. 58: 16 (2024) - [c11]Yannick Francillette, Hugo Tremblay, Bruno Bouchard:
Automated Difficulty Assessment Model for Comprehensive Difficulty in Games. GEM 2024: 1-6 - 2023
- [c10]Yannick Francillette, Hugo Tremblay, Bruno Bouchard, Simon Lescieux, Mathis Rozon, Jules Linard:
Automated Difficulty Assessment Model for Platformer Games: A Comprehensive Approach. GEM 2023: 1-6 - [c9]Hugo Tremblay, Sara Séguin
, Laurie-Ann Boily, Véronique Du Paul, Sophie Lalancette:
Robotic Process Automation (RPA) using a heuristic method and the effective resistance of a graph. KES 2023: 3388-3394 - 2021
- [c8]Sylvain Hallé, Hugo Tremblay
Foundations of Fine-Grained Explainability. CAV (2) 2021: 500-523 - [c7]Sara Séguin, Hugo Tremblay, Imène Benkalaï, David-Emmanuel Perron-Chouinard, Xavier Lebeuf:
Minimizing the number of robots required for a Robotic Process Automation (RPA) problem. KES 2021: 709-716 - [c6]Sara Séguin
Minimizing the number of robots required for a Robotic Process Automation (RPA) problem. KES 2021: 2689-2698 - 2020
- [c5]Imène Benkalaï, Sara Séguin
Computing a lower bound for the solution of a Robotic Process Automation (RPA) problem using network flows. CoDIT 2020: 118-123 - [c4]Sylvain Hallé, Hugo Tremblay:
A Generic Explainability Framework for Function Circuits. TaPP 2020 - [i1]Hugo Tremblay, Fábio Petrillo:
The cross cyclomatic complexity: a bi-dimensional measure for program complexity on graphs. CoRR abs/2003.00399 (2020)
2010 – 2019
- 2016
- [j2]Alexandre Blondin Massé, Srecko Brlek, Hugo Tremblay
Efficient operations on discrete paths. Theor. Comput. Sci. 624: 121-135 (2016) - [c3]Alexandre Blondin Massé, Mélodie Lapointe, Hugo Tremblay
Parallelogram Morphisms and Circular Codes. LATA 2016: 221-232 - 2014
- [j1]Hugo Tremblay
Exhaustive generation of atomic combinatorial differential operators. Theor. Comput. Sci. 536: 62-69 (2014) - [c2]Srecko Brlek, Hugo Tremblay, Jérôme Tremblay, Romaine Weber:
Efficient Computation of the Outer Hull of a Discrete Path. DGCI 2014: 122-133 - [c1]Alexandre Blondin Massé, Amadou Makhtar Tall, Hugo Tremblay
On the Arithmetics of Discrete Figures. LATA 2014: 198-209
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: