default search action
Michaël Rao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Anahí Gajardo, Victor H. Lutfalla, Michaël Rao:
Ants on the highway. CoRR abs/2409.10124 (2024) - 2020
- [c6]Vincent Despré, Michaël Rao, Stéphan Thomassé:
Testing Balanced Splitting Cycles in Complete Triangulations. CCCG 2020: 167-173
2010 – 2019
- 2019
- [j26]Michaël Rao, Alexandre Talon:
The 2-domination and Roman domination numbers of grid graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - 2018
- [j25]Michaël Rao, Matthieu Rosenfeld
:
Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ2. SIAM J. Discret. Math. 32(4): 2381-2397 (2018) - [i11]Michaël Rao, Alexandre Talon:
The 2-domination and Roman domination numbers of grid graphs. CoRR abs/1810.12896 (2018) - 2017
- [b2]Michaël Rao:
Preuves aidées par ordinateur en combinatoire des mots. ENS de Lyon, France, 2017 - [j24]Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
On cardinalities of k-abelian equivalence classes. Theor. Comput. Sci. 658: 190-204 (2017) - 2016
- [j23]Michaël Rao, Matthieu Rosenfeld
Avoidability of long k-abelian repetitions. Math. Comput. 85(302): 3051-3060 (2016) - [i10]Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland:
On cardinalities of k-abelian equivalence classes. CoRR abs/1605.03319 (2016) - 2015
- [j22]Mike Müller, Svetlana Puzynina, Michaël Rao:
On Shuffling of Infinite Square-Free Words. Electron. J. Comb. 22(1): 1 (2015) - [j21]Michaël Rao, Michel Rigo
Avoiding 2-binomial squares and cubes. Theor. Comput. Sci. 572: 83-91 (2015) - [j20]Michaël Rao:
On some generalizations of abelian power avoidability. Theor. Comput. Sci. 601: 39-46 (2015) - [i9]Emmanuel Jeandel, Michaël Rao:
An aperiodic set of 11 Wang tiles. CoRR abs/1506.06492 (2015) - [i8]Michaël Rao, Matthieu Rosenfeld:
Avoidability of long k-abelian repetitions. CoRR abs/1507.02581 (2015) - [i7]Michaël Rao, Matthieu Rosenfeld:
On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers. CoRR abs/1511.05875 (2015) - 2014
- [j19]Golnaz Badkobeh, Maxime Crochemore
Finite repetition threshold for large alphabets. RAIRO Theor. Informatics Appl. 48(4): 419-430 (2014) - [j18]Pascal Ochem, Michaël Rao:
On the number of prime factors of an odd perfect number. Math. Comput. 83(289): 2435-2439 (2014) - [i6]Mike Müller, Svetlana Puzynina, Michaël Rao:
Infinite square-free self-shuffling words. CoRR abs/1401.6536 (2014) - 2013
- [j17]Mamadou Moustapha Kanté, Michaël Rao:
The Rank-Width of Edge-Coloured Graphs. Theory Comput. Syst. 52(4): 599-644 (2013) - [i5]Michaël Rao, Michel Rigo, Pavel Salimov:
Avoiding 2-binomial squares and cubes. CoRR abs/1310.4743 (2013) - 2012
- [j16]Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao:
Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5): 688-711 (2012) - [j15]Pascal Ochem, Michaël Rao:
Odd perfect numbers are greater than 101500. Math. Comput. 81(279): 1869-1877 (2012) - 2011
- [j14]Daniel Gonçalves
The Domination Number of Grids. SIAM J. Discret. Math. 25(3): 1443-1453 (2011) - [j13]Michaël Rao:
Last cases of Dejean's conjecture. Theor. Comput. Sci. 412(27): 3010-3018 (2011) - [j12]Olivier Bodini, Thomas Fernique, Michaël Rao, Eric Rémila:
Distances on rhombus tilings. Theor. Comput. Sci. 412(36): 4787-4794 (2011) - [j11]Roman Kolpakov
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. Theor. Comput. Sci. 412(46): 6507-6516 (2011) - [c5]Mamadou Moustapha Kanté, Michaël Rao:
\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs. CAI 2011: 158-173 - [i4]Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé:
The Domination Number of Grids. CoRR abs/1102.5206 (2011) - [i3]Roman Kolpakov, Michaël Rao:
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. CoRR abs/1105.3116 (2011) - 2010
- [j10]Jean Daligault, Daniel Gonçalves
Diamond-free circle graphs are Helly circle. Discret. Math. 310(4): 845-849 (2010) - [j9]Jean Daligault, Michaël Rao, Stéphan Thomassé
Well-Quasi-Order of Relabel Functions. Order 27(3): 301-315 (2010)
2000 – 2009
- 2009
- [j8]Peter Allen, Vadim V. Lozin, Michaël Rao:
Clique-Width and the Speed of Hereditary Properties. Electron. J. Comb. 16(1) (2009) - [c4]Mamadou Moustapha Kanté, Michaël Rao:
Directed Rank-Width and Displit Decomposition. WG 2009: 214-225 - 2008
- [j7]Michaël Rao:
Solving some NP-complete problems using split decomposition. Discret. Appl. Math. 156(14): 2768-2780 (2008) - [j6]Michaël Rao:
Clique-width of graphs defined by one-vertex extensions. Discret. Math. 308(24): 6157-6165 (2008) - [j5]Pierre Charbit
A note on computing set overlap classes. Inf. Process. Lett. 108(4): 186-191 (2008) - 2007
- [j4]Michaël Rao:
MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theor. Comput. Sci. 377(1-3): 260-267 (2007) - [c3]Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
NLC-2 Graph Recognition and Isomorphism. WG 2007: 86-98 - [i2]Pierre Charbit, Michel Habib
A Note On Computing Set Overlap Classes. CoRR abs/0711.4573 (2007) - [i1]Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
NLC-2 graph recognition and isomorphism. CoRR abs/cs/0703013 (2007) - 2006
- [b1]Michaël Rao:
Décompositions de graphes et algorithmes efficaces. University of Metz, France, 2006 - 2005
- [j3]Fabien de Montgolfier, Michaël Rao:
The bi-join decomposition. Electron. Notes Discret. Math. 22: 173-177 (2005) - [j2]Hans L. Bodlaender
On algorithms for (P5, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005) - 2004
- [c2]Michaël Rao:
Coloring a Graph Using Split Decomposition. WG 2004: 129-141 - 2003
- [j1]Gregory Kucherov, Pascal Ochem, Michaël Rao:
How Many Square Occurrences Must a Binary Sequence Contain? Electron. J. Comb. 10 (2003) - [c1]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. FCT 2003: 61-72
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-17 20:28 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: