993 results on '"Colbourn, Charles J."'
Search Results
102. Transitive Steiner and Kirkman Triple Systems of Order 27
103. Trails of triples in partial triple systems
104. Mixed covering arrays on graphs of small treewidth
105. Improving Two Recursive Constructions for Covering Arrays
106. Optimality and Constructions of Locating Arrays
107. Constructing heterogeneous hash families by puncturing linear transversal designs
108. Fully gated graphs: Recognition and convex operations
109. Constructing strength three covering arrays with augmented annealing
110. Strength two covering arrays: Existence tables and projection
111. Directed complete bipartite graph decompositions: Indirect constructions
112. Covering arrays from cyclotomy
113. D-Optimal Designs with Interaction Coverage
114. Linear hash families and forbidden configurations
115. Small stopping sets in Steiner triple systems
116. The configuration polytope of ℓ-line configurations in Steiner triple systems
117. Locating and detecting arrays for interaction faults
118. Transport schemes for topology-transparent scheduling
119. The effects of synchronization on topology-transparent scheduling
120. Roux-type constructions for covering arrays of strengths three and four
121. Ternary schedules for energy-limited sensor networks
122. Designs and graphs
123. Randomized Post-optimization for t-Restrictions
124. Constructions for Permutation Codes in Powerline Communications
125. Cover-Free Families and Topology-Transparent Scheduling for MANETs
126. Popularity Block Labelling for Steiner Systems
127. Sequence designs for ultra-wideband impulse radio with optimal correlation properties
128. The Existence of Kirkman Squares—Doubly Resolvable (v,3,1)-BIBDs
129. Mixed covering arrays on graphs of small treewidth.
130. Prioritized interaction testing for pair-wise coverage with seeding and constraints
131. Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-UserCommunication Systems
132. Covering Arrays of Strength Three
133. Group testing for consecutive positives
134. Pooling, lattice square, and union jack designs
135. Weakly union-free maximum packings
136. Network reliability: Heading out on the highway
137. On the maximum double independence number of Steiner triple systems
138. Distributing hash families with few rows
139. Constructions of optimal orthogonal arrays with repeated rows
140. Point Code Minimum Steiner Triple Systems
141. Embedding path designs into kite systems
142. Ovals and hyperovals in nets
143. Weakly union-free twofold triple systems
144. Existence of Incomplete Transversal Designs with Block Size Five and Any Index λ
145. Pairwise Balanced Designs with Consecutive Block Sizes
146. Preface
147. Non-Stanley Bounds for Network Reliability
148. Steiner Systems for Topology-Transparent Access Control in MANETs
149. Thwarts in transversal designs
150. The complexity of computing the tutte polynomial on transversal matroids
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.