Marlene J. Colbourn

440 total citations
14 papers, 216 citations indexed

About

Marlene J. Colbourn is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Marlene J. Colbourn has authored 14 papers receiving a total of 216 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Electrical and Electronic Engineering, 7 papers in Computational Theory and Mathematics and 5 papers in Artificial Intelligence. Recurrent topics in Marlene J. Colbourn's work include graph theory and CDMA systems (11 papers), Advanced Graph Theory Research (5 papers) and Optimal Experimental Design Methods (3 papers). Marlene J. Colbourn is often cited by papers focused on graph theory and CDMA systems (11 papers), Advanced Graph Theory Research (5 papers) and Optimal Experimental Design Methods (3 papers). Marlene J. Colbourn collaborates with scholars based in Canada. Marlene J. Colbourn's co-authors include Charles J. Colbourn, John McLeod, Alexander Rosa, Vojtěch Rödl and Kevin T. Phelps and has published in prestigious journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Statistical Planning and Inference.

In The Last Decade

Marlene J. Colbourn

13 papers receiving 181 citations

Peers

Marlene J. Colbourn

EEE

AI

DMC

CTM

CNC

D. Jungnickel Germany

Earl S. Kramer United States

Saad I. El‐Zanati United States

Heather Gavlas United States

Sharad S. Sane India

Lucien Haddad Canada

Peter Danziger Canada

Dalibor Fronček United States

Mario Gionfriddo Italy

Elizabeth J. Billington Australia

D. Jungnickel Germany

Marlene J. Colbourn

207 ×1.2

EEE

193 ×1.6

AI

120 ×1.6

DMC

44 ×0.6

CTM

30 ×1.7

CNC

Citations per year, relative to Marlene J. Colbourn Marlene J. Colbourn (= 1×) peers D. Jungnickel

Countries citing papers authored by Marlene J. Colbourn

Since Specialization

Citations

This map shows the geographic impact of Marlene J. Colbourn's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Marlene J. Colbourn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marlene J. Colbourn more than expected).

Fields of papers citing papers by Marlene J. Colbourn

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marlene J. Colbourn. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Marlene J. Colbourn. The network helps show where Marlene J. Colbourn may publish in the future.

Co-authorship network of co-authors of Marlene J. Colbourn

This figure shows the co-authorship network connecting the top 25 collaborators of Marlene J. Colbourn. A scholar is included among the top collaborators of Marlene J. Colbourn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Marlene J. Colbourn. Marlene J. Colbourn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

14 of 14 papers shown

1.

Colbourn, Charles J. & Marlene J. Colbourn. (1985). Algorithms in combinatorial design theory. CERN Document Server (European Organization for Nuclear Research). 8 indexed citations

2.

Colbourn, Charles J., Marlene J. Colbourn, & Alexander Rosa. (1985). Indecomposable 1-factorizations of the complete multigraph. Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics. 39(3). 334–343. 5 indexed citations

3.

Colbourn, Marlene J. & Charles J. Colbourn. (1984). Recursive constructions for cyclic block designs. Journal of Statistical Planning and Inference. 10(1). 97–103. 70 indexed citations

4.

Colbourn, Marlene J. & John McLeod. (1983). The Potential and Feasibility of Computer Guided Educational Diagnosis.. IFIP Congress. 891–896.

5.

Colbourn, Charles J., Marlene J. Colbourn, & Alexander Rosa. (1983). Completing small partial triple systems. Discrete Mathematics. 45(2-3). 165–179. 12 indexed citations

6.

Colbourn, Charles J. & Marlene J. Colbourn. (1983). Every twofold triple system can be directed. Journal of Combinatorial Theory Series A. 34(3). 375–378. 14 indexed citations

7.

Colbourn, Charles J., Marlene J. Colbourn, Kevin T. Phelps, & Vojtěch Rödl. (1982). Colouring steiner quadruple systems. Discrete Applied Mathematics. 4(2). 103–111. 7 indexed citations

8.

Colbourn, Charles J. & Marlene J. Colbourn. (1982). The chromatic index of cyclic Steiner 2‐designs. International Journal of Mathematics and Mathematical Sciences. 5(4). 823–825. 13 indexed citations

9.

Colbourn, Charles J., Marlene J. Colbourn, Kevin T. Phelps, & Vojtěch Rödl. (1982). Coloring Block Designs is NP-Complete. SIAM Journal on Algebraic and Discrete Methods. 3(3). 305–307. 5 indexed citations

10.

Colbourn, Marlene J. & John McLeod. (1982). Computer Guided Educational Diagnosis: A Prototype Expert System. Journal of Special Education Technology. 6(1). 30–39. 19 indexed citations

11.

Colbourn, Marlene J. & Charles J. Colbourn. (1981). Cyclic Block Designs With Block Size 3. European Journal of Combinatorics. 2(1). 21–26. 34 indexed citations

12.

Colbourn, Marlene J. & Charles J. Colbourn. (1981). Concerning the complexity of deciding isomorphism of block designs. Discrete Applied Mathematics. 3(3). 155–162. 8 indexed citations

13.

Colbourn, Charles J. & Marlene J. Colbourn. (1981). Deciding Hadamard equivalence of Hadamard matrices. BIT Numerical Mathematics. 21(3). 374–376. 4 indexed citations

14.

Colbourn, Marlene J. & Charles J. Colbourn. (1978). Graph isomorphism and self-complementary graphs. ACM SIGACT News. 10(1). 25–29. 17 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact