| Year |
Citation |
Score |
| 2019 |
Dinneen MJ, Mahasinghe A, Liu K. Finding the chromatic sums of graphs using a D-Wave quantum computer The Journal of Supercomputing. 75: 4811-4828. DOI: 10.1007/S11227-019-02761-5 |
0.337 |
|
| 2017 |
Calude CS, Dinneen MJ, Hua R. QUBO formulations for the graph isomorphism problem and related problems Theoretical Computer Science. 701: 54-69. DOI: 10.1016/J.Tcs.2017.04.016 |
0.364 |
|
| 2015 |
Calude CS, Calude E, Dinneen MJ. Guest Column Acm Sigact News. 46: 40-61. DOI: 10.1145/2744447.2744459 |
0.302 |
|
| 2014 |
Dinneen MJ, Ke NR, Khosravani M. Arithmetic Progression Graphs Universal Journal of Applied Mathematics. 2: 290-297. DOI: 10.13189/Ujam.2014.020803 |
0.415 |
|
| 2013 |
Dinneen MJ, Wei K. On the analysis of a (1+1) adaptive memetic algorithm Proceedings of the 2013 Ieee Workshop On Memetic Computing, Mc 2013 - 2013 Ieee Symposium Series On Computational Intelligence, Ssci 2013. 24-31. DOI: 10.1109/Mc.2013.6608203 |
0.301 |
|
| 2013 |
Dinneen MJ, Wei K. A (1+1) adaptive memetic algorithm for the maximum clique problem 2013 Ieee Congress On Evolutionary Computation, Cec 2013. 1626-1634. DOI: 10.1109/CEC.2013.6557756 |
0.315 |
|
| 2012 |
Dinneen MJ, Kim YB, Nicolescu R. Faster synchronization in P systems Natural Computing. 11: 107-115. DOI: 10.1007/S11047-011-9271-Z |
0.314 |
|
| 2012 |
Dinneen MJ, Khosravani M, Wei K. A comparative study of parallel algorithms for the girth problem Conferences in Research and Practice in Information Technology Series. 127: 23-30. |
0.3 |
|
| 2011 |
Dinneen MJ, Khosravani M. Hardness of approximation and integer programming frameworks for searching for caterpillar trees Conferences in Research and Practice in Information Technology Series. 119: 145-150. |
0.333 |
|
| 2010 |
Dinneen MJ, Kim Y, Nicolescu R. Edge- and Node- Disjoint Paths in P Systems Arxiv: Distributed, Parallel, and Cluster Computing. 40: 121-141. DOI: 10.4204/Eptcs.40.9 |
0.395 |
|
| 2010 |
Calude CS, Dinneen MJ, Dumitrescu M, Svozil K. Experimental evidence of quantum randomness incomputability Physical Review a - Atomic, Molecular, and Optical Physics. 82. DOI: 10.1103/Physreva.82.022102 |
0.326 |
|
| 2010 |
Dinneen MJ, Kim YB, Nicolescu R. P systems and the Byzantine agreement Journal of Logic and Algebraic Programming. 79: 334-349. DOI: 10.1016/J.Jlap.2010.03.004 |
0.382 |
|
| 2010 |
Dinneen MJ, Khosravani M. A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6058: 237-246. DOI: 10.1007/978-3-642-13284-1_19 |
0.336 |
|
| 2007 |
Calude CS, Dinneen MJ. Exact approximations of Omega numbers International Journal of Bifurcation and Chaos. 17: 1937-1954. DOI: 10.1142/S0218127407018130 |
0.374 |
|
| 2007 |
Dinneen MJ, Lai R. Properties of vertex cover obstructions Discrete Mathematics. 307: 2484-2500. DOI: 10.1016/J.Disc.2007.01.003 |
0.354 |
|
| 2004 |
Arulanandham JJ, Calude CS, Dinneen MJ. A fast natural algorithm for searching Theoretical Computer Science. 320: 3-13. DOI: 10.1016/J.Tcs.2004.03.040 |
0.328 |
|
| 2003 |
Dinneen MJ, Zhou N. An optimal family of directed, bounded-degree broadcast networks Electronic Notes in Theoretical Computer Science. 78: 201-213. DOI: 10.1016/S1571-0661(04)81013-2 |
0.357 |
|
| 2003 |
Dinneen MJ, Khoussainov B. Update games and update networks Journal of Discrete Algorithms. 1: 53-65. DOI: 10.1016/S1570-8667(03)00006-6 |
0.405 |
|
| 2002 |
Calude CS, Dinneen MJ, Shu CK. Computing a glimpse of randomness Experimental Mathematics. 11: 361-370. DOI: 10.1080/10586458.2002.10504481 |
0.468 |
|
| 2002 |
Dinneen MJ, Pritchard G, Wilson MC. Degree- and Time-Constrained Broadcast Networks Networks. 39: 121-129. DOI: 10.1002/Net.10018 |
0.416 |
|
| 2002 |
Bodlaender HL, Dinneen MJ, Khoussainov B. Relaxed update and partition network games Fundamenta Informaticae. 49: 301-312. |
0.308 |
|
| 2001 |
Dinneen MJ, Cattell K, Fellows MR. Forbidden minors to graphs with small feedback sets Discrete Mathematics. 230: 215-252. DOI: 10.1016/S0012-365X(00)00083-2 |
0.368 |
|
| 2001 |
Bodlaender HL, Dinneen MJ, Khoussainov B. On game-theoretic models of networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2223: 550-561. DOI: 10.1007/3-540-45678-3_47 |
0.305 |
|
| 2000 |
Cattell K, Dinneen MJ, Downey RG, Fellows MR, Langston MA. On computing graph minor obstruction sets Theoretical Computer Science. 233: 107-127. DOI: 10.1016/S0304-3975(97)00300-9 |
0.408 |
|
| 2000 |
Calude CS, Dinneen MJ, Svozil K. Reflections on quantum computing Complexity. 6: 35-37. DOI: 10.1002/1099-0526(200009/10)6:1<35::Aid-Cplx1005>3.0.Co;2-T |
0.375 |
|
| 1999 |
Dinneen MJ, Ventura JA, Wilson MC, Zakeri G. Construction of time-relaxed minimal broadcast networks Parallel Processing Letters. 9: 53-68. DOI: 10.1142/S0129626499000086 |
0.322 |
|
| 1999 |
Dinneen MJ, Ventura JA, Wilson MC, Zakeri G. Compound constructions of broadcast networks Discrete Applied Mathematics. 93: 205-232. DOI: 10.1016/S0166-218X(99)00043-8 |
0.405 |
|
| 1997 |
Dinneen MJ. Too many minor order obstructions (For parameterized lower ideals) 1 Journal of Universal Computer Science. 3: 1199-1206. |
0.313 |
|
| 1996 |
Cattell K, Dinneen MJ, Fellows MR. A simple linear-time algorithm for finding path-decompositions of small width Information Processing Letters. 57: 197-203. DOI: 10.1016/0020-0190(95)00190-5 |
0.392 |
|
| 1995 |
Brewster TL, Dinneen MJ, Faber V. A computational attack on the conjectures of Graffiti: New counterexamples and proofs Discrete Mathematics. 147: 35-55. DOI: 10.1016/0012-365X(94)00227-A |
0.431 |
|
| 1995 |
Cattell K, Dinneen MJ, Fellows MR. Obstructions to within a few vertices or edges of acyclic Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 955: 415-427. DOI: 10.1007/3-540-60220-8_81 |
0.358 |
|
| 1994 |
Dinneen MJ, Hafner PR. New results for the degree/diameter problem Networks. 24: 359-367. DOI: 10.1002/Net.3230240702 |
0.41 |
|
| 1992 |
Campbell L, Carlsson GE, Dinneen MJ, Faber V, Fellows MR, Langston MA, Moore JW, Mullhaupt AP, Sexton HB. Small Diameter Symmetric Networks from Linear Groups Ieee Transactions On Computers. 41: 218-220. DOI: 10.1109/12.123397 |
0.374 |
|
| 1991 |
Dinneen MJ, Fellows MR, Faber V. Algebraic Constructions of Efficient Broadcast Networks Applicable Algebra in Engineering, Communication and Computing. 152-158. DOI: 10.1007/3-540-54522-0_104 |
0.381 |
|
| Show low-probability matches. |