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="Colbourn, Charles"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sequence covering arrays
Yeow Meng Chee
,
Charles J. Colbourn
,
Daniel Horsley
,
Jungling Zhou
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1844-1861
Covering and packing for pairs
Yeow Meng Chee
,
Charles J. Colbourn
,
Alan C.H. Ling
,
Richard M. Wilson
Journal of Combinatorial Theory Series A
120
(7), 2013, pp. 1440-1449
The existence of
(K_2\times K_6)
-designs
Chengmin Wang
,
Charles J. Colbourn
Graphs and Combinatorics
29
(5), 2013, pp. 1557-1567
Drop cost and wavelength optimal two-period grooming with ratio 4
Jean-Claude Bermond
,
Charles J. Colbourn
,
Lucia Gionfriddo
,
Gaetano Quattrocchi
,
Ignasi Sau
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 400-419
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio seven
Charles J. Colbourn
,
Hung-Lin Fu
,
Gennian Ge
,
Alan C.H. Ling
,
Hui-Chuan Lu
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 109-122
Lower bounds for two-period grooming via linear programming duality
Charles J. Colbourn
,
Gaetano Quattrocchi
,
Violet R. Syrotiuk
Networks
52
(4), 2008, pp. 299-306
Grooming for two-period optical networks
Charles J. Colbourn
,
Gaetano Quattrocchi
,
Violet R. Syrotiuk
Networks
52
(4), 2008, pp. 307-324
Multiterminal resilience for series-parallel networks
Toni R. Farley
,
Charles J. Colbourn
Networks
50
(2), 2007, pp. 164-172
Traffic grooming in unidirectional wavelength-division multiplexed rings with grooming ratio
C = 6
Jean-Claude Bermond
,
Charles J. Colbourn
,
David Coudert
,
Gennian Ge
,
Alan C.H. Ling
,
Xavier Muñoz
SIAM Journal on Discrete Mathematics
19
(2), 2005, pp. 523-542
A recursive construction for regular difference triangle sets
Wensong Chu
,
Charles J. Colbourn
,
Solomon W. Golomb
SIAM Journal on Discrete Mathematics
18
(4), 2005, pp. 741-748
Optimal and pessimal orderings of Steiner triple systems in disk arrays
Myra B. Cohen
,
Charles J. Colbourn
Theoretical Computer Science
297
(1-3), 2003, pp. 103-117
Construction of optimal quality control for oligo arrays
Charles J. Colbourn
,
Alan C.H. Ling
,
Martin Tompa
Bioinformatics
18
(4), 2002, pp. 529-535
Equireplicate balanced binary codes for oligo arrays
Noga Alon
,
Charles J. Colbourn
,
Alan C.H. Ling
,
Martin Tompa
SIAM Journal on Discrete Mathematics
14
(4), 2001, pp. 481-497
Cluttered orderings for the complete graph
Myra B. Cohen
,
Charles J. Colbourn
,
Dalibor Froncek
Lecture Notes in Computer Science
2108
, 2001, pp. 420-431
Ordering disks for double erasure codes
Myra B. Cohen
,
Charles J. Colbourn
Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'2001 (Crete Island, Greece, July 3-6, 2001)
, 2001, pp. 229-236
Minimizing drop cost for SONET/WDM networks with
\frac{1}{8}
wavelength requirements
Charles J. Colbourn
,
Peng-Jun Wan
Networks
37
(2), 2001, pp. 107-116
Four-terminal reducibility and projective-planar Wye-Delta-Wye-reducible graphs
Dan Archdeacon
,
Charles J. Colbourn
,
Isidoro Gitler
,
J. Scott Provan
Journal of Graph Theory
33
(2), 2000, pp. 83-93
Transversal designs in classical planes and spaces
Aiden A. Bruen
,
Charles J. Colbourn
Journal of Combinatorial Theory Series A
92
(1), 2000, pp. 88-94
Asymptotically optimal erasure-resilient codes for large disk arrays
Yeow Meng Chee
,
Charles J. Colbourn
,
Alan C.H. Ling
Discrete Applied Mathematics
102
(1-2), 2000, pp. 3-36
Quorums from difference covers
Charles J. Colbourn
,
Alan C.H. Ling
Information Processing Letters
75
(1-2), 2000, pp. 9-12
A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges
Charles J. Colbourn
,
Guoliang Xue
Theoretical Computer Science
209
(1-2), 1998, pp. 331-345
Complete arcs in Steiner triple systems
Charles J. Colbourn
,
Jeffrey H. Dinitz
Journal of Combinatorial Theory Series A
80
(2), 1997, pp. 320-333
Balanced Steiner triple systems
Charles Colbourn
,
Lucien Haddad
,
Václav Linek
Journal of Combinatorial Theory Series A
78
(2), 1997, pp. 292-302
Pairwise balanced designs with block sizes 8, 9, and 10
Charles J. Colbourn
,
Alan C.H. Ling
Journal of Combinatorial Theory Series A
77
(2), 1997, pp. 228-245
Equitable embeddings of Steiner triple systems
Charles Colbourn
,
Lucien Haddad
,
Václav Linek
Journal of Combinatorial Theory Series A
73
(2), 1996, pp. 229-247
Seiten 1
2
3
>