Alan C. H. Ling

From MaRDI portal
Person:189441

Available identifiers

zbMath Open ling.alan-chi-hungWikidataQ102200122 ScholiaQ102200122MaRDI QIDQ189441

List of research outcomes





PublicationDate of PublicationType
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing2023-11-20Paper
Access balancing in storage systems by labeling partial Steiner systems2020-10-21Paper
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families2019-01-23Paper
Relative difference sets partitioned by cosets2017-10-16Paper
Limit on the Addressability of Fault-Tolerant Nanowire Decoders2017-08-08Paper
A finite embedding theorem for partial Steiner 3-designs2017-08-03Paper
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization2017-07-27Paper
Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes2017-07-27Paper
Resolvable group divisible designs with large groups2016-12-06Paper
Quorums from difference covers2016-06-16Paper
An existence theory for incomplete designs2016-06-03Paper
Thickly-resolvable block designs2016-04-18Paper
Graph divisible designs and packing constructions2015-12-17Paper
Matching divisible designs with block size four2015-12-08Paper
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses2015-10-26Paper
Existence of balanced sampling plans avoiding cyclic distances2015-10-14Paper
A Three‐Factor Product Construction for Mutually Orthogonal Latin Squares2015-06-19Paper
Covering and packing for pairs2015-06-19Paper
https://portal.mardi4nfdi.de/entity/Q49829112015-04-13Paper
Pairwise balanced designs with prescribed minimum dimension2014-07-04Paper
The Asymptotic Existence of Resolvable Group Divisible Designs2013-05-10Paper
https://portal.mardi4nfdi.de/entity/Q31149792012-02-20Paper
Grooming traffic to minimize load2012-01-11Paper
Spectrum of Sizes for Perfect Deletion-Correcting Codes2011-03-15Paper
Optical grooming with grooming ratio nine2011-01-07Paper
The Existence of $N_2$ Resolvable Latin Squares2010-08-27Paper
https://portal.mardi4nfdi.de/entity/Q35677952010-06-17Paper
The Existence of $r\times4$ Grid-Block Designs with $r=3,4$2010-06-01Paper
A recursive construction for perfect hash families2010-05-06Paper
Optical grooming with grooming ratio eight2010-04-28Paper
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven2010-03-17Paper
Maximum uniformly resolvable designs with block sizes 2 and 42009-12-15Paper
Graph designs for the eight-edge five-vertex graphs2009-12-15Paper
Further results on \((v,\{5,w^*\},1)\)-PBDs2009-06-19Paper
The fine intersection problem for Steiner triple systems2009-05-08Paper
The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle2009-04-08Paper
Linear hash families and forbidden configurations2009-03-31Paper
Linear spaces with small generated subspaces2009-03-04Paper
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three2009-02-24Paper
The Sizes of Optimal $q$-Ary Codes of Weight Three and Distance Four: A Complete Solution2009-02-24Paper
A Systematic Construction for Radar Arrays2009-02-24Paper
Minimum embedding of Steiner triple systems into \((K_4 - e)\)-designs. II2009-01-28Paper
Minimum embedding of Steiner triple systems into \((K4-e)\)-designs. I2009-01-27Paper
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares2008-12-21Paper
On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks2008-12-05Paper
Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles2008-10-21Paper
On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges2008-08-13Paper
Asymptotic Existence of Resolvable Graph Designs2008-06-18Paper
Two new infinite families of extremal class-uniformly resolvable designs2008-06-05Paper
Constructing strength three covering arrays with augmented annealing2008-05-29Paper
Resolvable balanced incomplete block designs with subdesigns of block size 42008-05-29Paper
On the existence of resolvable K4 − e designs2008-01-07Paper
https://portal.mardi4nfdi.de/entity/Q54225022007-10-26Paper
https://portal.mardi4nfdi.de/entity/Q52949342007-07-26Paper
Linear programming bounds for balanced arrays2006-10-30Paper
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 62006-06-01Paper
Scheduling CCRR tournaments2006-03-16Paper
https://portal.mardi4nfdi.de/entity/Q57036762005-11-08Paper
Embedding path designs into kite systems2005-09-22Paper
Resolvable maximum packings with quadruples2005-08-17Paper
https://portal.mardi4nfdi.de/entity/Q54633552005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54633632005-08-04Paper
Constructions of quad-rooted double covers2005-07-28Paper
https://portal.mardi4nfdi.de/entity/Q54615252005-07-26Paper
Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs2005-06-01Paper
Difference triangle sets from affine planes2005-05-11Paper
https://portal.mardi4nfdi.de/entity/Q46655402005-04-11Paper
Group divisible designs with block size four and group type \(g^u m^1\) with minimum \(m\)2005-02-28Paper
A combinatorial error bound for \(t\)-point-based sampling2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48219502004-10-22Paper
A systematic approach to some block design constructions2004-10-14Paper
Grooming in unidirectional rings: \(K_{4}-e\) designs2004-08-20Paper
Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)2004-08-19Paper
Cover-free families and topology-transparent scheduling for MANETs2004-08-16Paper
Splitting systems and separating systems.2004-03-29Paper
Super-simple (\(v\),\,5,\,2)-designs.2004-03-29Paper
A survey on resolvable group divisible designs with block size four.2004-03-29Paper
Some more 5-GDDs and optimal (v), 5, 1)-packings2004-03-15Paper
Some New uniform frames with block size four and index one or three2004-03-15Paper
An infinite class of fibres in CURDs with block sizes two and three2004-02-12Paper
Skolem-type difference sets for cycle systems2004-02-05Paper
https://portal.mardi4nfdi.de/entity/Q47985142004-02-03Paper
A new construction for \(Z\)-cyclic whist tournaments2003-11-20Paper
Minimum embedding of P3-designs into (K4?e)-designs2003-11-10Paper
Hyperovals in Steiner systems2003-09-16Paper
On PBIBD designs based on triangular schemes2003-03-27Paper
Sets of three pairwise orthogonal Steiner triple systems2003-03-26Paper
Uniform group divisible designs with block sizes three and \(n\)2003-03-25Paper
Constrained Ramsey numbers of graphs2003-03-19Paper
Slope packings and coverings, and generic algorithms for the discrete logarithm problem2003-03-19Paper
Complementary partial resolution squares for Steiner triple systems2003-03-16Paper
An application of splittable 4-frames to coloring of \(K_{n,n}\)2003-03-16Paper
A note on \(\{4\}\)-GDDs of type 2\(^{10}\)2003-03-16Paper
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs2003-03-16Paper
Further results on the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size2002-09-29Paper
Frames with block size four and index three2002-09-18Paper
Totally magic graphs2002-08-29Paper
More on the existence of small quasimultiples of affine and projective planes of arbitrary order2002-06-24Paper
The existence of referee squares2002-05-02Paper
Kirkman triple systems of order 21 with nontrivial automorphism group2002-03-19Paper
The spectrum of ?-resolvable designs with block size four2001-11-28Paper
Equireplicate balanced binary codes for oligo arrays2001-11-11Paper
(M,S)-optimal designs with block size three2001-09-02Paper
Deleting lines in projective planes2001-06-10Paper
An application of permutatation arrays to block ciphers2001-05-16Paper
Construction Techniques for Anti-Pasch Steiner Triple Systems2000-12-13Paper
https://portal.mardi4nfdi.de/entity/Q44874542000-09-15Paper
Modified group divisible designs with block size four2000-08-28Paper
https://portal.mardi4nfdi.de/entity/Q44874672000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42694302000-05-18Paper
On 2-chromatic \((v,5,1)\)-designs2000-05-04Paper
https://portal.mardi4nfdi.de/entity/Q49400152000-03-01Paper
Kirkman school project designs2000-01-11Paper
Asymptotically optimal erasure-resilient codes for large disk arrays.2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42376701999-08-16Paper
A direct product construction for 5-sparse triple systems1999-05-16Paper
The existence of uniform 5-GDDs1999-05-16Paper
Weakly union-free twofold triple systems1999-01-14Paper
Point code minimum Steiner triple systems1999-01-14Paper
A class of partial triple systems with applications in survey sampling1998-11-25Paper
https://portal.mardi4nfdi.de/entity/Q43932491998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43573481998-03-02Paper
Pairwise balanced designs with block sizes 8, 9, and 101997-08-27Paper
Pairwise balanced designs with consecutive block sizes1997-05-20Paper
https://portal.mardi4nfdi.de/entity/Q43373551997-05-19Paper
https://portal.mardi4nfdi.de/entity/Q48769341996-06-23Paper

Research outcomes over time

This page was built for person: Alan C. H. Ling