Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Rao, Micha{\"e}l"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Avoiding 2-binomial squares and cubes
Michaël Rao
,
Michel Rigo
,
Pavel Salimov
Theoretical Computer Science
572
, 2015, pp. 83-91
The domination number of grids
Daniel Gonçalves
,
Alexandre Pinlou
,
Michaël Rao
,
Stéphan Thomassé
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1443-1453
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
Roman Kolpakov
,
Michaël Rao
Theoretical Computer Science
412
(46), 2011, pp. 6507-6516
Last cases of Dejean's conjecture
Michaël Rao
Theoretical Computer Science
412
(27), 2011, pp. 3010-3018
Directed rank-width and displit decomposition
Mamadou Moustapha Kanté
,
Michaël Rao
Lecture Notes in Computer Science
5911
, 2010, pp. 214-225
A note on computing set overlap classes
Pierre Charbit
,
Michel Habib
,
Vincent Limouzy
,
Fabien de Montgolfier
,
Mathieu Raffinot
,
Michaël Rao
Information Processing Letters
108
(4), 2008, pp. 186-191
NLC-2 graph recognition and isomorphism
Vincent Limouzy
,
Fabien de Montgolfier
,
Michaël Rao
Lecture Notes in Computer Science
4769
, 2007, pp. 86-98
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Michaël Rao
Theoretical Computer Science
377
(1-3), 2007, pp. 260-267
On algorithms for
(P_5,gem)
-free graphs
Hans L. Bodlaender
,
Andreas Brandstädt
,
Dieter Kratsch
,
Michaël Rao
,
Jeremy Spinrad
Theoretical Computer Science
349
(1), 2005, pp. 2-21