default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉlise Vandomme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j8]Katerina Medková
, Edita Pelantová, Élise Vandomme:
On non-repetitive complexity of Arnoux-Rauzy words. Discret. Appl. Math. 285: 423-433 (2020)- [j7]Émilie Charlier, Svetlana Puzynina, Élise Vandomme:
Recurrence along directions in multidimensional words. Discret. Math. 343(10): 112006 (2020) - 2019
- [j6]Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme:
Critical exponents of infinite balanced words. Theor. Comput. Sci. 777: 454-463 (2019) - 2018
- [j5]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) - 2017
- [j4]Sylvain Gravier, Élise Vandomme:
Constant 2-labellings and an application to (r, a, b)-covering codes. Discuss. Math. Graph Theory 37(4): 891-918 (2017) - 2015
- [j3]Aline Parreau, Michel Rigo, Eric Rowland, Élise Vandomme:
A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences. Electron. J. Comb. 22(1): 1 (2015) - [j2]Sylvain Gravier, Aline Parreau, Sara Rottey, Leo Storme, Élise Vandomme:
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs. Electron. J. Comb. 22(4): 4 (2015) - 2012
- [j1]Anne Lacroix, Narad Rampersad, Michel Rigo, Élise Vandomme:
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. Fundam. Informaticae 116(1-4): 175-187 (2012)
Conference and Workshop Papers
- 2019
- [c4]Émilie Charlier, Svetlana Puzynina, Élise Vandomme:
Recurrence in Multidimensional Words. LATA 2019: 397-408 - 2018
- [c3]Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme:
Nearest constrained circular words. CPM 2018: 6:1-6:14 - [c2]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme:
Fully Leafed Induced Subtrees. IWOCA 2018: 90-101 - 2011
- [c1]Michel Rigo, Élise Vandomme:
Syntactic Complexity of Ultimately Periodic Sets of Integers. LATA 2011: 477-488
Editorship
- 2017
- [e1]Srecko Brlek, Francesco Dolce, Christophe Reutenauer, Élise Vandomme:
Combinatorics on Words - 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings. Lecture Notes in Computer Science 10432, Springer 2017, ISBN 978-3-319-66395-1 [contents]
Informal and Other Publications
- 2018
- [i4]Narad Rampersad, Jeffrey O. Shallit, Élise Vandomme:
Critical exponents of infinite balanced words. CoRR abs/1801.05334 (2018) - 2017
- [i3]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme:
Fully leafed induced subtrees. CoRR abs/1709.09808 (2017) - 2014
- [i2]Aline Parreau, Michel Rigo, Eric Rowland, Élise Vandomme:
A new approach to the $2$-regularity of the l-abelian complexity of 2-automatic sequences. CoRR abs/1405.3532 (2014) - [i1]Sylvain Gravier, Aline Parreau, Sara Rottey, Leo Storme, Élise Vandomme:
Identifying codes in vertex-transitive graphs. CoRR abs/1411.5275 (2014)
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-04-24 23:09 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:
