World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
63
Citations
21884
World Ranking
2699
National Ranking
1338

Mathematics

D-Index
61
Citations
20705
World Ranking
503
National Ranking
264

Overview

Charles J. Colbourn is affiliated with Arizona State University in the United States. Their research primarily spans the fields of Computer Science and Engineering, with a significant focus on subfields such as Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering, Computational Theory and Mathematics, and Software.

The scientist has published extensively on various topics related to graph theory and CDMA systems, VLSI and analog circuit testing, software testing and debugging techniques, cryptography and data security, advanced graph theory research, internet traffic analysis and secure e-voting, as well as advanced data storage technologies.

Frequent coauthors of Charles J. Colbourn include Violet R. Syrotiuk, Dylan Lusi, Ryan Gabrys, Olgica Milenković, and Jonathan Jedwab, highlighting collaboration across multiple projects.

Their papers have appeared in a variety of journals, with multiple publications in the Journal of Combinatorial Designs, arXiv (Cornell University), Designs Codes and Cryptography, Discrete Mathematics, and Networks. Recent research papers include:

  • "Network reliability: Heading out on the highway" (2020) published in Networks
  • "Egalitarian Steiner triple systems for data popularity" (2021) published in Designs Codes and Cryptography
  • "In-Parameter-Order strategies for covering perfect hash families" (2022) published in Applied Mathematics and Computation
  • "Algorithmic methods for covering arrays of higher index" (2022) published in Journal of Combinatorial Optimization
  • "Egalitarian Edge Orderings of Complete Graphs" (2021) published in Graphs and Combinatorics

Best Publications

  • Handbook of Combinatorial Designs

    Charles J. Colbourn;Jeffrey H. Dinitz

  • CRC Handbook of Combinatorial Designs

    Charles J. Colbourn;Jeffrey H. Dinitz

  • Unit disk graphs

    Brent N. Clark;Brent N. Clark;Charles J. Colbourn;Charles J. Colbourn;David S. Johnson;David S. Johnson

  • The Combinatorics of Network Reliability

    Charles J. Colbourn

  • Constructing test suites for interaction testing

    Myra B. Cohen;Peter B. Gibbons;Warwick B. Mugridge;Charles J. Colbourn

  • Mutually orthogonal latin squares (MOLS)

    R. Julian;R. Abel;Charles J. Colbourn;Jeffrey H. Dinitz

  • Steiner trees, partial 2–trees, and minimum IFI networks

    Joseph A. Wald;Charles J. Colbourn

  • Combinatorial aspects of covering arrays

    Charles J. Colbourn

  • Prioritized interaction testing for pair-wise coverage with seeding and constraints☆

    Renée C. Bryce;Charles J. Colbourn

  • The complexity of completing partial Latin squares

    Charles J. Colbourn

  • Constructions for permutation codes in powerline communications

    Wensong Chu;Charles J. Colbourn;Peter Dukes

  • The density algorithm for pairwise interaction testing

    Renée C. Bryce;Charles J. Colbourn

  • Optimal frequency-hopping sequences via cyclotomy

    Wensong Chu;C.J. Colbourn

  • A new class of group divisible designs with block size three

    Charles J. Colbourn;Dean G. Hoffman;Rolf Rees

  • A variable strength interaction testing of components

    M.B. Cohen;P.B. Gibbons;W.B. Mugridge;C.J. Colbourn

  • Permutation arrays for powerline communication and mutually orthogonal latin squares

    C.J. Colbourn;T. Klove;A.C.H. Ling

  • A density-based greedy algorithm for higher strength covering arrays

    Renée C. Bryce;Charles J. Colbourn

  • A deterministic density algorithm for pairwise interaction coverage.

    Charles J. Colbourn;Myra B. Cohen;Renée Turban

  • A framework of greedy methods for constructing interaction test suites

    Renée C. Bryce;Charles J. Colbourn;Myra B. Cohen

  • Augmenting simulated annealing to build interaction test suites

    M.B. Cohen;C.J. Colbourn;A.C.H. Ling

  • Lower bounds on multiple sequence alignment using exact 3-way alignment.

    Charles J Colbourn;Sudhir Kumar

Frequent Co-Authors

Douglas R. Stinson
Douglas R. Stinson University of Waterloo
Myra B. Cohen
Myra B. Cohen Iowa State University
Gennian Ge
Gennian Ge Capital Normal University
Olgica Milenkovic
Olgica Milenkovic University of Illinois at Urbana-Champaign
Wei-Tek Tsai
Wei-Tek Tsai Arizona State University
Vojtěch Rödl
Vojtěch Rödl Emory University
Ugo Vaccaro
Ugo Vaccaro University of Salerno
Douglas C. Montgomery
Douglas C. Montgomery Arizona State University
William R. Pulleyblank
William R. Pulleyblank United States Military Academy
Eli De Poorter
Eli De Poorter Ghent University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics, expanding your skillset with complementary online degrees can open diverse career pathways. Business-oriented programs such as an shortest online mba programs offer a fast-tracked route to leadership roles, combining quantitative skills with management expertise.

Exploring fields like marketing can also be advantageous. Affordable options like the marketing graduate programs available online provide practical knowledge that pairs well with analytical backgrounds, leading to lucrative careers in data-driven marketing and strategy.

If speed is a priority, consider the array of one year mba programs designed to efficiently enhance business acumen without a lengthy time commitment. These can be an excellent bridge from mathematics to executive positions.

Additionally, many programs recognize prior learning, allowing students to can you transfer credits into an mba program. This flexibility helps learners reduce time and cost, making advanced degrees more accessible and tailored to individual career goals.

Best Scientists Citing Charles J. Colbourn

Trending Scientists

Recently Published Articles