Conference Papers

  1. K. Sarkar, C.J. Colbourn, A. De Bonis, and U. Vaccaro, Partial covering arrays: Algorithms and Asymptotics, Lecture Notes in Computer Science 9843 (2016), 437-448.
  2. C.J. Colbourn and V.R. Syrotiuk, Coverage, Location, Detection, and Measurement, 2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), 2016, IEEE Press, 19-25.
  3. Randy Compton, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, and Violet R. Syrotiuk, Screening Interacting Factors in a Wireless Network Testbed Using Locating Arrays, Proc. 2016 IEEE INFOCOM International Workshop on Computer and Networking Experimental Research Using Testbeds, 2016, IEEE Press, 650-655.
  4. Patrick C. Murray and Charles J. Colbourn, Sequence Covering Arrays and Linear Extensions, IWOCA 2014, Lecture Notes in Computer Science 8986 (2015), 274-285.
  5. C. Nie, J. Jiang, H. Wu, H. Leung, and C.J. Colbourn, Empirically Identifying the Best Greedy Algorithm for Covering Array Generation, Proc. The 2nd International Workshop on Combinatorial Testing (IWCT 2013), Luxembourg, IEEE Press, 2013, pp. 239-248.
  6. W.-T. Tsai, Q. Li, C.J. Colbourn, and X. Bai, Adaptive Combinatorial Testing with Reasoning for Testing Tenant Applications in Multi-Tenancy SaaS Systems, in Proc. IEEE International Conference on Cloud Engineering (IC2E). March 2013. San Francisco, CA, USA, 183-192.
  7. W.-T. Tsai, C.J. Colbourn, J. Luo, G. Qi, Q. Li, and X. Bai, Test algebra for combinatorial testing, Proc. 8th International Workshop Automation of Software Test (AST13), IEEE Press, 2013, 19-25.
  8. J. Lutz, C.J. Colbourn, and V.R. Syrotiuk, Variable weight sequences for adaptive scheduled access in MANETs, Lecture Notes in Computer Science 7280 (2012), 53-64.
  9. C.J. Colbourn and P. Nayeri, Randomized post-optimization for $t$-restrictions, Lecture Notes in Computer Science 7777 (2013), 597-608.
  10. C.J. Colbourn, Efficient Conditional Expectation Algorithms for Constructing Hash Families, Proceedings of the International Workshop on Combinatorial Algorithms, Victoria, Canada, Lecture Notes in Computer Science 7056 (2011), 144-155.
  11. R.C. Bryce, C.J. Colbourn, and D.R. Kuhn, Interaction Faults Adaptively using Distance-Based Strategies, Proceedings of the 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (ECBS11), Las Vegas NV, April 2011, pp. 4-15.
  12. J. Lutz, C. J. Colbourn, and V. R. Syrotiuk, Apples and Oranges: Comparing Schedule- and Contention-based Medium Access Control, Proceedings of the 13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM'10), Bodrum, Turkey, October 17-21, 2010, pp. 319-326.
  13. C.J. Colbourn, D. Horsley, and V.R. Syrotiuk, Frameproof codes and compressive sensing, Proceedings of the Forty-Eighth Allerton Conference on Communications, Control, and Computing, Allerton, Illinois, October 2010, pp. 985--990.
  14. T.R. Farley and C.J. Colbourn, Multiterminal Measures for Network Reliability and Resilience, Proc. Design of Reliable Computer Networks (DRCN2009), October 2009, pp. 107-114.
  15. P. Nayeri, C.J. Colbourn, and G. Konjevod, Randomized Postoptimization of Covering Arrays, Proc. Int. Workshop on Combinatorial Algorithms (IWOCA2009), Lecture Notes in Computer Science 5874 (2009), 408-419.
  16. C.J. Colbourn and G. Kéri, Binary Covering Arrays and Existentially Closed Graphs, Proc. Int. Workshop Coding and Cryptology, Lecture Notes in Computer Science 5557 (2009), 22-33.
  17. R.C. Bryce and C.J. Colbourn, One-test-at-a-time heuristic search for interaction test suites, Proc. Genetic and Evolutionary Computation Conference (GECCO-2007), London, England, July 2007, pp. 1082-1089.
  18. M.P. McGarry, M. Reisslein, C.J. Colbourn, and M. Maier, Just-in-Time Online Scheduling for WDM EPONs, Proceedings of the International Conference on Communications (ICC 2007), Glasgow, UK, June 2007, pp. 2174-2179.
  19. Y.M. Chee, C.J. Colbourn, and A.C.H. Ling, Optimal memoryless encoding for low power off-chip data buses, Proceedings Inter. Conf. Computer-Aided Design (ICCAD2006), San Jose CA, November 2006, pp. 369-374.
  20. C.J. Colbourn, K.N. Johnson, V.R. Syrotiuk, M. Kraetzl, and K.-P. Hui, System Lifetime: A Global Problem and Local Solutions, Proceedings of the Fifth Annual Mediterranean Ad Hoc Networking Workshop (MedHocNet'06), Lipari, Italy, June 2006, pp. 208-215.
  21. C.J. Colbourn, M. Cui, V.R. Syrotiuk, and E.L. Lloyd, A Carrier Sense Multiple Access Protocol with Power Backoff (CSMA/PB), Proceedings of the Fifth Annual Mediterranean Ad Hoc Networking Workshop (MedHocNet'06), Lipari, Italy, June 2006, pp. 76-83.
  22. P.J. Dukes, C.J. Colbourn, and V.R. Syrotiuk, Topology-transparent schedules for energy-limited ad hoc networks, Proc. IEEE International Workshop on Foundations and Algorithms for Wireless Networks (FAWN), Pisa, Italy, March 2006, pp. 85-90.
  23. D.S. Hoskins, C.J. Colbourn, and D.C. Montgomery, Software Performance Testing Using Covering Arrays, Fifth International Workshop on Software and Performance (WOSP 2005), Palma de Mallorca, Illes Balears, SPAIN, July 2005, pp. 131-137.
  24. R.C. Bryce, C.J. Colbourn, and M.B. Cohen, A Framework of Greedy Methods for Constructing Interaction Test Suites, Proc. 27th International Conference on Software Engineering (ICSE2005), St. Louis MO, May 2005, pp. 146-155.
  25. R.C. Bryce and C.J. Colbourn, Test Prioritization for Pairwise Coverage, Proc. ACM Workshop on Advances in Model-Based Software Testing (A-MOST), St. Louis MO, May 2005, pp. 1-7.
  26. C.J. Colbourn, Y. Chen, and W.-T. Tsai, Progressive Ranking and Composition of Web Services Using Covering Arrays, Tenth IEEE International Workshop on Object-oriented Real-time Dependable Systems (WORDS2005) , Sedona AZ, February 2005, pp. 179-186.
  27. D. Hoskins, R.C. Turban and C.J. Colbourn, Experimental Designs in Software Engineering: D-Optimal Designs and Covering Arrays, Proc. SIGSOFT 2004/FSE-12 Workshop on Interdisciplinary Software Engineering Research (WISER 2004), November 2004, Newport Beach CA, pp. 55-66.
  28. M.M. Coahran and C.J. Colbourn, Maximum and average access cost in double erasure RAID disk arrays, Proc. 35th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton FL, 2004, Congressus Numerantium 167 (2004), 209-219.
  29. C.J. Colbourn and V.R. Syrotiuk, Scheduled Persistence for Medium Access Control in Sensor Networks, Proc. First IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS2004), Fort Lauderdale FL, October 2004, pp. 264-273.
  30. M. Cui, V.R. Syrotiuk, and C.J. Colbourn, Securing dynamic spectrum use, Proc. Vehicular Technology Conference (VTC2004), Los Angeles CA, September 2004, pp. 1153-1157.
  31. W. Chu, C.J. Colbourn, and V.R. Syrotiuk, Topology Transparent Scheduling, Synchronization and Maximum Delay, Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS2004), Santa Fe, New Mexico, April, 2004, pp. 223-228.
  32. C.J. Colbourn, M.B. Cohen, and R.C. Turban, A Deterministic Density Algorithm for Pairwise Interaction Coverage, Proceedings of the International Conference on Software Engineering (SE 2004), Innsbruck, Austria, February 2004, pp. 245-252.
  33. M.B. Cohen, C.J. Colbourn, and A.C.H. Ling, Augmenting simulated annealing to build interaction test suites, Proc. IEEE Int Symp Software Reliability Eng (ISSRE 2003), Denver CO, November 2003, pp. 394-405.
  34. V.R. Syrotiuk, C.J. Colbourn, and A.C.H. Ling, Topology-Transparent Scheduling for MANETs using Orthogonal Arrays, Proceedings Conf. Principles of Mobile Computing (DIALM-POMC2003), San Diego CA, September 2003, 43-49.
  35. C.J. Colbourn, V.R. Syrotiuk, and A.C.H. Ling, Steiner Systems for Topology-Transparent Access Control in MANETs, Proceedings of AdHocNow03, Second International Conference on AD-HOC Networks and Wireless , Montreal CA, October 2003, Lecture Notes in Computer Science 2865 (2003), 247-258.
  36. M.B. Cohen, C.J. Colbourn, J.S. Collofello, P.B. Gibbons, and W.B. Mugridge, Variable Strength Interaction Testing of Components, Proc. 27th Annual International Computer Software and Applications Conference (COMPSAC 2003), Dallas TX, November 2003, pp. 413--418.
  37. V.R. Syrotiuk and C.J. Colbourn, Adaptive bandwidth utilization via frequency hopping and erasure coding, Special session on Combinatorial Optimization in Telecommunications and Mobile Computing, Proc. International Conference on Computer, Communication and Control Technologies: CCCT '03 , July 2003, pp. V.62-V.66.
  38. C.J. Colbourn and M.K. Gupta, On quaternary MacDonald codes, Proc. Intern. Conf. Information Technology: Coding and Computing (ITCC03), Las Vegas NV, April 2003, pp. 212-215.
  39. V.R. Syrotiuk and C.J. Colbourn, Routing in mobile aerial networks, Proc. Conf. Modeling and Optimization in Wireless, Mobile, and Ad Hoc Networks (WiOPT03), Sophia-Antipolis, France, March 2003, pp. 293-301.
  40. M.B. Cohen, C.J. Colbourn, P.B. Gibbons, and W.B. Mugridge, Constructing test suites for interaction testing, Proc. International Conf. Software Engineering (ICSE03), Portland OR, May 2003, pp. 38-48.
  41. C.J. Colbourn, Multiple access communications using combinatorial designs, Lecture Notes in Computer Science 2292 (2002), 1-29.
  42. M.B. Cohen, C.J. Colbourn and D. Froncek, Cluttered orderings for the complete graph, COCOON 2001, Guilin, China, Lecture Notes in Computer Science 2108 (2001), 420-431.
  43. M.B. Cohen and C.J. Colbourn, Ordering disks for double erasure codes, Proc. Symp. Parallel Algorithms and Architectures (SPAA01), Crete, July 2001, pp. 229-236.
  44. D.R. de la Torre, C.J. Colbourn, and A.C.H. Ling, An application of permutation arrays to block ciphers, Proceedings Thirty-first Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium 145 (2000), 5-7.
  45. M.B. Cohen and C.J. Colbourn, Optimal and pessimal orderings of Steiner triple systems in disk arrays, LATIN 2000 (Punta del Este, Uruguay), Lecture Notes in Computer Science 1776 (2000), 95-104.
  46. M.B. Cohen and C.J. Colbourn, Steiner triple systems as multiple erasure correcting codes in disk arrays, Proceedings of IPCCC 2000 (19th IEEE International Conference on Performance, Computing and Communications), 2000, pp. 288-294.
  47. H.J. Strayer, K.C. Wellsch, C.J. Colbourn, and F. Glover, ``Planarization, Dualization, and All-Terminal Reliability'', Proceedings of the Eighth International Conference on Graph Theory, Combinatorics, Algorithms and Applications (Y. Alavi, D.R. Lick, and A. Schwenk; editors) Volume II, New Issues Press, Kalamazoo MI, 1999, pp. 873-882.
  48. A.C.H. Ling and C.J. Colbourn, Concerning the generating set of Zn, Congressus Numerantium 114 (1996), 65-72.
  49. V.R. Syrotiuk, C.J. Colbourn, D.A. Klarner and J. Pachl, ``Characterizing Wang tilings using finite automata'', Proc. Third International Workshop on Polyominoes and Tilings, Toulouse, France, 1994, pp. 11-30.
  50. D.L. Erickson and C.J. Colbourn, ``Combinatorics and the conflict-free access problem'', Proc. Twentyfourth Southeastern Conf. Combin., Graph Theory Computing, Congr. Numer. 94 (1993), 115-121.
  51. C.J. Colbourn, ``Some open problems for reliability polynomials'', Proc. Twentyfourth Southeastern Conf. Combin., Graph Theory Computing, Congr. Numer. 93 (1993), 187-202.
  52. M. Kraetzl, C.J. Colbourn and J.S. Devitt, ``Bounding Techniques for the Reliability of Multistage Interconnection Networks'', Proceedings of IEEE Singapore International Conference on Networks/International Conference on Information Engineering '93, 1993, pp. 766-770.
  53. V.R. Syrotiuk, C.J. Colbourn and J. Pachl, ``Wang Tilings and Distributed Orientation on Anonymous Torus Networks'' (Extended Abstract), Lecture Notes in Computer Science 725 (1993), pp. 264-278.
  54. C.J. Colbourn and D.D. Harms, ``Evaluating performability: most probable states and bounds'', Proc. Telecommunications Systems Conf., Nashville, 1993, pp. 91-103.
  55. D.L. Erickson and C.J. Colbourn, ``Conflict-free access for collections of templates'', Proc. Sixth SIAM Conf. Parallel Processing for Scientific Computing, 1993, volume II, pp. 949-952.
  56. H.J. Strayer and C.J. Colbourn, ``Bounding network reliability via surface duality'', Proc. Sixth Latin American Conference on Operations Research, Mexico City, 1992, proc. to appear.
  57. C.J. Colbourn, M. Elbert, E. Litvak and T. Weyant, ``Performability analysis of large-scale packet-switching networks'', International Conference on Communications (SUPERCOMM/ICC) 1992, Chicago, pp. 416-419.
  58. D.L. Erickson and C.J. Colbourn, ``Conflict-free access to rectangular subarrays'', Congr. Numer. 90 (1992), 239-253.
  59. C.J. Colbourn, J.S. Devitt, D.D. Harms and M. Kraetzl, ``Renormalization for channel graphs'', Actas XI Congreso de Metodologias en Ingenieria de Sistemas, Santiago, Chile, 1991, pp. 171-174.
  60. C.J. Colbourn and L.D. Nel, ``Using and abusing bounds for network reliability'', Proceedings of the IEEE Telecommunications Conference (Globecom90), IEEE Press, pp. 663-667.
  61. C.J. Colbourn and A. Rosa, ``Support sizes of $\lambda$-factorizations'', Combinatorics88, Proc. Int. Conf. on Incidence Geometries and Combinatorial Structures, volume I, 1991, pp. 249-265.
  62. E.S. Elmallah and C.J. Colbourn, ``Partitioning the edges of a planar graph into two partial k-trees'', Proc. Nineteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, 1988, Congressus Numerantium 66 (1988) 69-80.
  63. C.J. Colbourn, B.M. Debroni and W.J. Myrvold, ``Estimating the coefficients of the reliability polynomial'', Proc. Seventeenth Manitoba Conference on Numerical Mathematics and Computing, 1987, Congressus Numerantium 62 (1988) 217-223.
  64. E.S. El Mallah and C.J. Colbourn, ``Edge deletion problems: properties defined by weakly connected forbidden subgraphs'', Proc. Eighteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, 1987, Congressus Numerantium 61 (1988) 275-285.
  65. J.I. Brown and C.J. Colbourn, ``A combinatorial study of the reliability polynomial'', Proc. Sixteenth Manitoba Conference on Numerical Mathematics and Computing, October 1986, pp. 71-89.
  66. C.J. Colbourn, P.J. Slater, and L.K. Stewart, ``Locating dominating sets in series-parallel networks'', Proc. Sixteenth Manitoba Conference on Numerical Mathematics and Computing, October 1986, pp. 135-162.
  67. J.J. Harms, C.J. Colbourn, and A.V. Ivanov, ``A census of (9,3,3) designs without repeated blocks'', Proc. Sixteenth Manitoba Conference on Numerical Mathematics and Computing, October 1986, pp. 147-170.
  68. E.S. El Mallah and C.J. Colbourn, ``Partial k-tree algorithms'', Proceedings of the Indiana Conference on Graph Theory and Applications, Congressus Numerantium 64 (1988) 105-119.
  69. T.B. Brecht and C.J. Colbourn, ``Improving bounds on network reliability: some examples'', Proceedings of the Fifteenth Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, Manitoba, October 1985, pp. 93-102.
  70. C.J. Colbourn, ``Exact algorithms for network reliability'', Proceedings of the Fifteenth Manitoba Conference on Numerical Mathematics and Computing, October 1985, pp. 7-57.
  71. E.H. Carrasco and C.J. Colbourn, ``Reliability bounds for networks with statistical dependence'', Proceedings of INFOCOM86, Miami, March 1986, pp. 290-292. (reprinted in Advances in Distributed System Reliability (S. Rai, D.P. Agrawal, eds.), IEEE Press, 1990, pp. 157-159.)
  72. C.J. Colbourn, ``Network reliability: new bounds from old'', Proceedings of IEEE Electronicom85, October 1985, pp. 124-126.
  73. E.S. El Mallah and C.J. Colbourn, ``Reliability of $\Delta$-Y reducible networks'', Proceedings of the Sixteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, February 1985, pp. 49-54.
  74. B.N. Clark, C.J. Colbourn, and P. Erdös, ``A conjecture on dominating cycles'', Proceedings of the Sixteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, February 1985, pp. 189-198.
  75. C.J. Colbourn, R.C. Hamm, and A. Rosa, ``Embedding, immersing, and enclosing'', Proceedings of the Sixteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, February 1985, pp. 229-238.
  76. E.S. El Mallah and C.J. Colbourn, ``Optimum communication spanning trees in chordal graphs'', Proceedings of the Fifteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, March 1984, pp. 301-316.
  77. C.J. Colbourn and A. Proskurowski, ``Concurrent transmissions in broadcast networks'', ICALP-84, June 1984, Lecture Notes in Computer Science 172 (1984) 128-136.
  78. E.M. Neufeld and C.J. Colbourn, ``The Construction of Reliable Series-Parallel Networks'', Proceedings of the Second West Coast Conference on Computing in Graph Theory, June 1983, pp. 21-26.
  79. C.J. Colbourn, M.J. Colbourn, and D.R. Stinson, ``The computational complexity of recognizing critical sets'', Proceedings of the First Southeast Asian Conference on Graph Theory, May 1983, Lecture Notes in Mathematics 1073 (1984) 248-253.
  80. C.J. Colbourn and M.J. Colbourn, ``Directing graph designs'', Proceedings of the Fourteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, February 1983, pp. 225-230.
  81. J.J. Harms and C.J. Colbourn, ``An efficient algorithm for directing triple systems'', Proceedings of the Fourteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, February 1983, pp. 455-462.
  82. J.B. Peachey, R.B. Bunt, and C.J. Colbourn, ``Towards an intrinsic measure of program locality'', Proceedings of the Sixteenth Annual Hawaii International Conference on System Sciences, January 1983, pp. 128-137.
  83. J.A. Wald and C.J. Colbourn, ``Computing reliability for a generalization of series-parallel networks'', Proceedings of the Twentieth Allerton Conference on Communication, Control, and Computing, October 1982, pp. 25-26.
  84. C.J. Colbourn, M.J. Colbourn, J.J. Harms, and A. Rosa, ``A complete census of (10,3,2) block designs and of Mendelsohn triple systems of order ten. III. (10,3,2) block designs without repeated blocks'', Proceedings of the Twelfth Manitoba Conference on Numerical Mathematics and Computing, October 1982, pp. 211-234.
  85. C.J. Colbourn and M.J. Colbourn, ``Decomposition of block designs: computational issues'', Proceedings of the Tenth Australian Conference on Combinatorial Mathematics, Lecture Notes in Mathematics 1036 (1983) 141-146.
  86. J.B. Peachey, R.B. Bunt and C.J. Colbourn, ``Bradford-Zipf phenomena in computer systems'', Proceedings of CIPS Session 82, May 1982, pp. 155-161.
  87. C.J. Colbourn and M.J. Colbourn, ``A recursive construction for 1-rotational Steiner 2-designs'', Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, February 1982, pp. 163-167.
  88. J.A. Wald and C.J. Colbourn, ``Steiner trees in outerplanar graphs'', Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, February 1982, pp. 15-22. (reprinted in Advances in Discrete Mathematics and Computer Science 5).
  89. C.J. Colbourn and S.A. Vanstone, ``Doubly resolvable twofold triple systems'', Proceedings of the Eleventh Manitoba Conference on Numerical Mathematics and Computing, October 1981, pp. 219-223.
  90. C.J. Colbourn, ``Some NP-complete problems on graph decompositions'', Proceedings of the Nineteenth Allerton Conference on Communication, Control, and Computing, October 1981, pp. 741-745.
  91. C.J. Colbourn, ``Disjoint cyclic Steiner triple systems'', Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, March 1981, pp. 205-212.
  92. M.J. Colbourn and C.J. Colbourn, ``Some small directed triple systems'', Proceedings of the Tenth Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, October 1980, pp. 247-255.
  93. C.J. Colbourn, M.J. Colbourn, and J.B. MacAulay, ``A clustering algorithm for locating scientific research fronts'', Proceedings of the Tenth Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, October 1980, pp. 235-246.
  94. C.J. Colbourn, ``Isomorphism complete problems on matrices'', Proceedings of the West Coast Conference on Combinatorics, Graph Theory, and Computing, Arcata CA, September 1979, pp. 101-107.
  95. C.J. Colbourn and M.J. Colbourn, ``The complexity of combinatorial isomorphism problems II'', Proceedings of the Ninth Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, October 1979, pp. 167-172.
  96. C.J. Colbourn, M.J. Colbourn, and K.T. Phelps, ``Combinatorial algorithms for generating cyclic Steiner quadruple systems'', Proceedings of the Conference on Discrete Mathematical Analysis and Combinatorial Computation, Fredericton, May 1980, pp. 25-39.
  97. C.J. Colbourn, ``Refinement techniques for graph isomorphism'', Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton FLA, April 1979, pp. 281-288.
  98. C.J. Colbourn and M.J. Colbourn, ``Isomorphism problems involving self-complementary graphs and tournaments'', Proceedings of the Eighth Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, October 1978, pp. 153-164.