Marc J. Lipman

Eddie Cheng, Marc J. Lipman, László Lipták: Matching preclusion and conditional matching preclusion for regular interconnection networks. Discrete Applied Mathematics 160(13-14): 1936-1954 (2012)

Eddie Cheng, László Lipták, Marc J. Lipman, Matthew Toeniskoetter: Conditional matching preclusion for the alternating group graphs and split-stars. Int. J. Comput. Math. 88(6): 1120-1136 (2011)

Eddie Cheng, Marc J. Lipman, László Lipták, David Sherman: Conditional matching preclusion for the arrangement graphs. Theor. Comput. Sci. 412(45): 6279-6289 (2011)

Eddie Cheng, Linda M. Lesniak, Marc J. Lipman, László Lipták: Conditional matching preclusion sets. Inf. Sci. 179(8): 1092-1101 (2009)

Eddie Cheng, Marc J. Lipman, László Lipták: Strong structural properties of unidirectional star graphs. Discrete Applied Mathematics 156(15): 2939-2949 (2008)

Eddie Cheng, Linda M. Lesniak, Marc J. Lipman, László Lipták: Matching preclusion for Alternating Group Graphs and their Generalizations. Int. J. Found. Comput. Sci. 19(6): 1413-1437 (2008)

Eddie Cheng, Marc J. Lipman, László Lipták, David Stiebel: Hamiltonian connectivity of 2-tree-generated networks. Mathematical and Computer Modelling 48(5-6): 787-804 (2008)

Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman: Time-stamped Graphs and Their Associated Influence Digraphs. Discrete Applied Mathematics 128(2-3): 317-335 (2003)

Eddie Cheng, Marc J. Lipman: Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness. Discrete Applied Mathematics 118(3): 163-179 (2002)

Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman: Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract). Electronic Notes in Discrete Mathematics 11: 128-139 (2002)

Eddie Cheng, Marc J. Lipman: Basic Structures of Some Interconnection Networks. Electronic Notes in Discrete Mathematics 11: 140-156 (2002)

Eddie Cheng, Marc J. Lipman: Unidirectional (n, k)-Star Graphs. Journal of Interconnection Networks 3(1-2): 19-34 (2002)

Eddie Cheng, Marc J. Lipman: Increasing the connectivity of the star graphs. Networks 40(3): 165-169 (2002)

Eddie Cheng, Serge G. Kruk, Marc J. Lipman: Flow Formulations for the Student Scheduling Problem. PATAT 2002: 299-309

Eddie Cheng, Marc J. Lipman, Hyungju Park: Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars. Ars Comb. 59 (2001)

Eddie Cheng, Marc J. Lipman: On the Day-Tripathi orientation of the star graphs: Connectivity. Inf. Process. Lett. 73(1-2): 5-10 (2000)

Eddie Cheng, Marc J. Lipman: Orienting split-stars and alternating group graphs. Networks 35(2): 139-144 (2000)

Lowell W. Beineke, Wayne Goddard, Marc J. Lipman: Graphs with Maximum Edge-Integrity. Ars Comb. 46 (1997)

Marc J. Lipman, Julia Abrahams: Minimum average cost testing for partially ordered components. IEEE Transactions on Information Theory 41(1): 287-291 (1995)

Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert: Edge-integrity: a survey. Discrete Mathematics 124(1-3): 3-12 (1994)

Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert: On the honesty of graph complements. Discrete Mathematics 122(1-3): 1-6 (1993)

Julia Abrahams, Marc J. Lipman: Relative uniformity of sources and the comparison of optimal code costs. IEEE Transactions on Information Theory 39(5): 1695-1697 (1993)

Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert: A Survey of Integrity. Discrete Applied Mathematics 37/38: 13-28 (1992)

Julia Abrahams, Marc J. Lipman: Zero-redundancy coding for unequal code symbol costs. IEEE Transactions on Information Theory 38(5): 1583-1586 (1992)

Robert L. Sedlmeyer, Marc J. Lipman: Property computation in Grapple (abstract only). ACM Conference on Computer Science 1987: 366

Marc J. Lipman, Robert L. Sedlmeyer: Knowledge and reasoning in graph theory research (abstract only). ACM Conference on Computer Science 1987: 415

Marc J. Lipman, Robert L. Sedlmeyer: Developments in an expert system for graph theory investigation. ACM Conference on Computer Science 1986: 327-330

Marc J. Lipman: Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups. Discrete Mathematics 54(1): 15-21 (1985)

Robert L. Sedlmeyer, Marc J. Lipman: Computer-aided investigation in graph theory (abstract only). ACM Conference on Computer Science 1985: 418

Richard D. Ringeisen, Marc J. Lipman: Cohesion and stability in graphs. Discrete Mathematics 46(2): 191-198 (1983)