The SCEAS System
| |||||||

## Search the dblp DataBase
Alan C. H. Ling:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Charles J. Colbourn, Violet R. Syrotiuk, Alan C. H. Ling
**Steiner Systems for Topology-Transparent Access Control in MANETs.**[Citation Graph (0, 0)][DBLP] ADHOC-NOW, 2003, pp:247-258 [Conf] - Violet R. Syrotiuk, Charles J. Colbourn, Alan C. H. Ling
**Topology-transparent scheduling for MANETs using orthogonal arrays.**[Citation Graph (0, 0)][DBLP] DIALM-POMC, 2003, pp:43-49 [Conf] - Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling
**Optimal memoryless encoding for low power off-chip data buses.**[Citation Graph (0, 0)][DBLP] ICCAD, 2006, pp:369-374 [Conf] - Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling
**Augmenting Simulated Annealing to Build Interaction Test Suites.**[Citation Graph (0, 0)][DBLP] ISSRE, 2003, pp:394-405 [Conf] - Katerina Simonova, Alan C. H. Ling, Xiaoyang Sean Wang
**Location-aware key predistribution scheme for wide area wireless sensor networks.**[Citation Graph (0, 0)][DBLP] SASN, 2006, pp:157-168 [Conf] - Hui Kheng Aw, Yeow Meng Chee, Alan C. H. Ling
**Six New Constant Weight Binary Codes.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2003, v:67, n:, pp:- [Journal] - Alan C. H. Ling
**Packings with block size five and index one: v \equiv 2 (mod 4).**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:63, n:, pp:- [Journal] - Alan C. H. Ling
**Some applications of combinatorial designs to extremal graph theory.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2003, v:67, n:, pp:- [Journal] - Alan C. H. Ling, Charles J. Colbourn
**Deleting Lines in Projective Planes.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1998, v:50, n:, pp:- [Journal] - Ronald C. Mullin, Alan C. H. Ling, R. Julian R. Abel, Frank E. Bennett
**On the Closure of Subsets of {4, 5, ..., 9} which contain {4}.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1997, v:45, n:, pp:- [Journal] - Brett Stevens, Alan C. H. Ling, Eric Mendelsohn
**A direct construction of transversal covers using group divisible designs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:63, n:, pp:- [Journal] - Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
**Construction of optimal quality control for oligo arrays.**[Citation Graph (0, 0)][DBLP] Bioinformatics, 2002, v:18, n:4, pp:529-535 [Journal] - Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling
**Skolem-type Difference Sets for Cycle Systems.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal] - Gennian Ge, Alan C. H. Ling
**A new construction for Z-cyclic whist tournaments.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:3, pp:643-650 [Journal] - Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling
**Asymptotically optimal erasure-resilient codes for large disk arrays.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:102, n:1-2, pp:3-36 [Journal] - Hans-Dietrich O. F. Gronau, Donald L. Kreher, Alan C. H. Ling
**Super-simple (v, 5, 2)-designs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:65-77 [Journal] - Gennian Ge, Alan C. H. Ling
**Group Divisible Designs with Block Size Four and Group Type**[Citation Graph (0, 0)][DBLP]*g*^{u}*m*^{1}with Minimum*m*. Des. Codes Cryptography, 2005, v:34, n:1, pp:117-126 [Journal] - Charles J. Colbourn, Alan C. H. Ling
**Point Code Minimum Steiner Triple Systems.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1998, v:14, n:2, pp:141-146 [Journal] - Charles J. Colbourn, Esther R. Lamken, Alan C. H. Ling, W. H. Mills
**The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2002, v:26, n:1-3, pp:169-196 [Journal] - Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk
**Cover-Free Families and Topology-Transparent Scheduling for MANETs.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2004, v:32, n:1-3, pp:65-95 [Journal] - Gennian Ge, Clement W. H. Lam, Alan C. H. Ling, Hao Shen
**Resolvable Maximum Packings with Quadruples.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2005, v:35, n:3, pp:287-302 [Journal] - Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin
**Pairwise Balanced Designs with Consecutive Block Sizes.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1997, v:10, n:2, pp:203-222 [Journal] - Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu
**Grooming in unidirectional rings:**[Citation Graph (0, 0)][DBLP]*K*_{4}-*e*designs. Discrete Mathematics, 2004, v:284, n:1-3, pp:57-62 [Journal] - Charles J. Colbourn, Alan C. H. Ling
**Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:261, n:1-3, pp:141-156 [Journal] - Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi
**Embedding path designs into kite systems.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:297, n:1-3, pp:38-48 [Journal] - Jeffrey H. Dinitz, Alan C. H. Ling
**The existence of referee squares.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:232, n:1-3, pp:109-112 [Journal] - Jeffrey H. Dinitz, Esther R. Lamken, Alan C. H. Ling
**Complementary partial resolution squares for Steiner triple systems.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:261, n:1-3, pp:243-254 [Journal] - Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis
**Totally magic graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:254, n:1-3, pp:103-113 [Journal] - Gennian Ge, Alan C. H. Ling
**A survey on resolvable group divisible designs with block size four.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:279, n:1-3, pp:225-245 [Journal] - Gennian Ge, Alan C. H. Ling
**Group divisible designs with block size four and group type**[Citation Graph (0, 0)][DBLP]*g*^{u}m^{1}for small*g*. Discrete Mathematics, 2004, v:285, n:1-3, pp:97-120 [Journal] - Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, Clement W. H. Lam
**A note on {4}-GDDs of type 2**[Citation Graph (0, 0)][DBLP]^{10}. Discrete Mathematics, 2003, v:261, n:1-3, pp:373-376 [Journal] - Alan C. H. Ling
**An application of splittable 4-frames to coloring of**[Citation Graph (0, 0)][DBLP]*K*._{n, n} Discrete Mathematics, 2003, v:261, n:1-3, pp:377-382 [Journal] - Alan C. H. Ling, Charles J. Colbourn
**Modified group divisible designs with block size four.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:219, n:1-3, pp:207-221 [Journal] - Alan C. H. Ling, Pak Ching Li, G. H. John van Rees
**Splitting systems and separating systems.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:279, n:1-3, pp:355-368 [Journal] - Gennian Ge, Alan C. H. Ling
**Constructions of Quad-Rooted Double Covers.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2005, v:21, n:2, pp:231-238 [Journal] - Yeow Meng Chee, Alan C. H. Ling
**Uniform Group Divisible Designs with Block Sizes Three and n.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:3, pp:421-445 [Journal] - Charles J. Colbourn, Alan C. H. Ling
**Quorums from difference covers.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:1-2, pp:9-12 [Journal] - Charles J. Colbourn, Alan C. H. Ling
**Pairwise Balanced Designs with Block Sizes 8, 9, and 10.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1997, v:77, n:2, pp:228-245 [Journal] - Jeffrey H. Dinitz, Peter Dukes, Alan C. H. Ling
**Sets of three pairwise orthogonal Steiner triple systems.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2003, v:101, n:1, pp:90-116 [Journal] - Gennian Ge, Alan C. H. Ling
**A systematic approach to some block design constructions.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2004, v:108, n:1, pp:89-97 [Journal] - Gennian Ge, Esther R. Lamken, Alan C. H. Ling
**Scheduling**[Citation Graph (0, 0)][DBLP]*CCRR*tournaments. J. Comb. Theory, Ser. A, 2006, v:113, n:2, pp:352-379 [Journal] - Myra B. Cohen, Charles J. Colbourn, Lee A. Ives, Alan C. H. Ling
**Kirkman triple systems of order 21 with nontrivial automorphism group.**[Citation Graph (0, 0)][DBLP] Math. Comput., 2002, v:71, n:238, pp:873-881 [Journal] - Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson
**Fault-tolerant routings with minimum optical index.**[Citation Graph (0, 0)][DBLP] Networks, 2006, v:48, n:1, pp:47-55 [Journal] - Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz
**Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio**[Citation Graph (0, 0)][DBLP]*C*= 6. SIAM J. Discrete Math., 2005, v:19, n:2, pp:523-542 [Journal] - Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
**Equireplicate Balanced Binary Codes for Oligo Arrays.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2001, v:14, n:4, pp:481-497 [Journal] - Peter Dukes, Alan C. H. Ling
**A combinatorial error bound for t-point-based sampling.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:310, n:1-3, pp:479-488 [Journal] - Charles J. Colbourn, Torleiv Kløve, Alan C. H. Ling
**Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1289-1291 [Journal] - Alan C. H. Ling
**Difference triangle sets from affine planes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2399-2401 [Journal] - Charles J. Colbourn, Alan C. H. Ling
**Kirkman school project designs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:203, n:1-3, pp:49-60 [Journal] **A Fast Algorithm for the Constrained Multiple Sequence Alignment Problem.**[Citation Graph (, )][DBLP]**Note edge-colourings of**[Citation Graph (, )][DBLP]*K*_{ n, n }with no long two-coloured cycles.**The PBD-Closure of Constant-Composition Codes**[Citation Graph (, )][DBLP]**Optimal Memoryless Encoding for Low Power Off-Chip Data Buses**[Citation Graph (, )][DBLP]**The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A Complete Solution**[Citation Graph (, )][DBLP]**Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three**[Citation Graph (, )][DBLP]**Limit on the Addressability of Fault-Tolerant Nanowire Decoders**[Citation Graph (, )][DBLP]**Spectrum of Sizes for Perfect Deletion-Correcting Codes**[Citation Graph (, )][DBLP]**Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes**[Citation Graph (, )][DBLP]**Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization**[Citation Graph (, )][DBLP]**Optical grooming with grooming ratio eight.**[Citation Graph (, )][DBLP]**Linear hash families and forbidden configurations.**[Citation Graph (, )][DBLP]**Constructing strength three covering arrays with augmented annealing.**[Citation Graph (, )][DBLP]**Minimum embedding of Steiner triple systems into (K**[Citation Graph (, )][DBLP]_{4}-e)-designs I.**Resolvable balanced incomplete block designs with subdesigns of block size 4.**[Citation Graph (, )][DBLP]**Minimum embedding of Steiner triple systems into (K**[Citation Graph (, )][DBLP]_{4}-e)-designs II.**Further results on (v, {5, w**[Citation Graph (, )][DBLP]^{*}}, 1)-PBDs.**Graph designs for the eight-edge five-vertex graphs.**[Citation Graph (, )][DBLP]**Maximum uniformly resolvable designs with block sizes 2 and 4.**[Citation Graph (, )][DBLP]
Search in 0.358secs, Finished in 0.362secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |