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
[1]
Hilfe
Suche: Author="Picouleau, C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a graph coloring problem arising from discrete tomography
C. Bentz
,
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Networks
51
(4), 2008, pp. 256-267
Reconstruction of binary matrices under fixed size neighborhood constraints
S. Brocchi
,
A. Frosini
,
C. Picouleau
Theoretical Computer Science
406
(1-2), 2008, pp. 43-54
Addendum to ``Bicolored matchings in some classes of graphs''
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Graphs and Combinatorics
24
(2), 2008, pp. 127-128
Bicolored matchings in some classes of graphs
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Graphs and Combinatorics
23
(1), 2007, pp. 47-60
Reconstruction of convex polyominoes from orthogonal projections of their contours
C. Picouleau
Theoretical Computer Science
346
(2-3), 2005, pp. 439-454
Reconstruction of domino tiling from its two orthogonal projections
C. Picouleau
Theoretical Computer Science
255
(1-2), 2001, pp. 437-447
Worst-case analysis of fast heuristics for packing squares into a square
C. Picouleau
Theoretical Computer Science
164
(1-2), 1996, pp. 59-72
New complexity results on scheduling with small communication delays
C. Picouleau
Discrete Applied Mathematics
60
, 1995, pp. 331-342
UET-UCT schedules on arbitrary networks
C. Picouleau
misc, 1994
Complexity of the hamiltonian cycle in regular graph problem
C. Picouleau
Theoretical Computer Science
131
(2), 1994, pp. 463-473