Journal of
Combinatorial Mathematics and
Combinatorial Computing
Volume 86, August, 2013
25th MCCC Conference

  • Sergey Gubin, "Compatibility Matrix Method", pp. 3-32
  • Daniel Bryce, "Greedy Coverage of Incomplete Planning Domain Interpretations by t-strength Diagnoses", pp. 33-49
  • Schuyler Manchester, Renee Bryce, Sreedevi Sampath, Nishant Samant, D. Richard Kuhn and Raghu Kacker, "Applying higher stength combinatorial criteria to test case prioritization: a case study", pp. 51-72
  • Vassil Yorgov, "On the Existance of Certain Circulant Weighing Matrices", pp. 73-85
  • Renee C. Bryce and Charles J. Colbourn, "Expected Time To Detection Of Interaction Faults", pp. 87-110
  • Linyuan Lu, Austin Mohr and Laszlo Szekely, "Connected Balanced Subgraphs in Random Regular Multigraphs Under the Configuration Model", pp. 111-123
  • J.C. George, Alison Marr and W.D. Wallis, "Minimal Pancyclic Graphs", pp. 125-133
  • Laxmi P. Gewali and Romas Hada, "Roaming Regions for Delaunay Nodes", pp. 135-149
  • Garrett Mitchener, Dinesh G. Sarvate and Andrew Shealy, "Further Existence Results on Beautifully Ordered Balanced Incomplete Block Designs", pp. 151-161
  • E.A. Yfantis, "Dynamic Redundancy Bit Allocation And Packet Size To Increase Throughput In Noisy Real Time Video Wireless Transmission", pp. 163-169
  • D.V. Chopra, Richard M. Low and R. Dios, "Further Results on Some Bi-level Balanced Arrays Using Coincidences", pp. 171-181
  • Reza Ahangar, "Computation and Simulation of Langevin Stochastic Differential Equation", pp. 183-198
  • LeRoy B. Beasley, "Preservers of cover numbers and independence numbers of undirected graphs", pp. 199-214
  • Hossein Shahmohamad, "The History Of The Total Chromatic Number Conjecture", pp. 215-220
  • Sarah Malick and Dinesh G. Sarvate, "Decomposition of λKv into Multigraphs with Four Vertices and Five Edges", pp. 221-237
  • Tian-Xiao He, "Expression and Computation of Generalized Stirling Numbers", pp. 239-268

Back to the JCMCC page.