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="Crespelle, Christophe"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Termination of the iterated strong-factor operator on multipartite graphs
Christophe Crespelle
,
Thi Ha Duong Phan
,
The Hung Tran
Theoretical Computer Science
571
, 2015, pp. 67-77
(Nearly-)tight bounds on the contiguity and linearity of cographs
Christophe Crespelle
,
Philippe Gambette
Theoretical Computer Science
522
, 2014, pp. 1-12
A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product
Christophe Crespelle
,
Eric Thierry
,
Thomas Lambert
Lecture Notes in Computer Science
7936
, 2013, pp. 469-480
An
O(n^2)
-time algorithm for the minimal interval completion problem
Christophe Crespelle
,
Ioan Todinca
Theoretical Computer Science
494
, 2013, pp. 75-85
Unrestricted and complete Breadth-First Search of trapezoid graphs in
O(n)
time
Christophe Crespelle
,
Philippe Gambette
Information Processing Letters
110
(12-13), 2010, pp. 497-502
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
Christophe Crespelle
,
Christophe Paul
Algorithmica
58
(2), 2010, pp. 405-432
Fully dynamic representations of interval graphs
Christophe Crespelle
Lecture Notes in Computer Science
5911
, 2010, pp. 77-87
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
Christophe Crespelle
,
Christophe Paul
Lecture Notes in Computer Science
3787
, 2005, pp. 38-48
Fully-dynamic recognition algorithm and certificate for directed cographs
Christophe Crespelle
,
Christophe Paul
Lecture Notes in Computer Science
3353
, 2004, pp. 93-104