default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Goupil
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil, Odile Marcotte:
On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality. GASCom 2024: 6-11- 2023
- [i2]Carole Porrier, Alexandre Blondin Massé, Alain Goupil:
The Leaf Function of Penrose P2 Graphs. CoRR abs/2312.08262 (2023)
2010 – 2019
- 2018
- [j10]Alain Goupil, Marie-Eve Pellerin, Jérôme de Wouters d'oplinter:
Partially directed snake polyominoes. Discret. Appl. Math. 236: 223-234 (2018) - [j9]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil:
Saturated fully leafed tree-like polyforms and polycubes. J. Discrete Algorithms 52-53: 38-54 (2018) - [j8]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme
:
Leaf realization problem, caterpillar graphs and prefix normal words. Theor. Comput. Sci. 732: 1-13 (2018) - [c4]Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil:
On the maximal number of leaves in induced subtrees of series-parallel graphs. GASCom 2018: 24-31 - [c3]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil:
Non saturated polyhexes and polyiamonds. GASCom 2018: 116-123 - [c2]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme:
Fully Leafed Induced Subtrees. IWOCA 2018: 90-101 - 2017
- [c1]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Maxime Samson:
Fully Leafed Tree-Like Polyominoes and Polycubes. IWOCA 2017: 206-218 - [i1]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme:
Fully leafed induced subtrees. CoRR abs/1709.09808 (2017) - 2013
- [j7]Alain Goupil, Hugo Cloutier, Marie-Eve Pellerin:
Generating functions for inscribed polyominoes. Discret. Appl. Math. 161(1-2): 151-166 (2013) - [j6]Jérôme Fortier, Alain Goupil, Jonathan Lortie, Jérôme Tremblay:
Exhaustive generation of gominoes. Theor. Comput. Sci. 502: 76-87 (2013) - 2010
- [j5]Alain Goupil, Hugo Cloutier, Fathallah Nouboud:
Enumeration of polyominoes inscribed in a rectangle. Discret. Appl. Math. 158(18): 2014-2023 (2010)
1990 – 1999
- 1998
- [j4]Alain Goupil, Gilles Schaeffer:
Factoring N-Cycles and Counting Maps of Given Genus. Eur. J. Comb. 19(7): 819-834 (1998) - 1995
- [j3]Alain Goupil:
Reflection decompositions in the classical Weyl groups. Discret. Math. 137(1-3): 195-209 (1995) - 1994
- [j2]Alain Goupil:
Decomposition of Certain Products of Conjugacy Classes of Sn. J. Comb. Theory A 66(1): 102-117 (1994) - 1990
- [j1]Alain Goupil:
On products of conjugacy classes of the symmetric group. Discret. Math. 79(1): 49-57 (1990)
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-09-05 23:44 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:
