2008 |
25 | EE | Eddie Cheng,
Marc J. Lipman,
László Lipták:
Strong structural properties of unidirectional star graphs.
Discrete Applied Mathematics 156(15): 2939-2949 (2008) |
24 | EE | Eddie Cheng,
Linda 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) |
2003 |
23 | EE | 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) |
2002 |
22 | EE | Eddie Cheng,
Serge Kruk,
Marc J. Lipman:
Flow Formulations for the Student Scheduling Problem.
PATAT 2002: 299-309 |
21 | | 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) |
20 | EE | 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) |
19 | EE | Eddie Cheng,
Marc J. Lipman:
Basic Structures of Some Interconnection Networks.
Electronic Notes in Discrete Mathematics 11: 140-156 (2002) |
18 | EE | Eddie Cheng,
Marc J. Lipman:
Unidirectional (n, k)-Star Graphs.
Journal of Interconnection Networks 3(1-2): 19-34 (2002) |
17 | EE | Eddie Cheng,
Marc J. Lipman:
Increasing the connectivity of the star graphs.
Networks 40(3): 165-169 (2002) |
2001 |
16 | | Eddie Cheng,
Marc J. Lipman,
Hyungju Park:
Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars.
Ars Comb. 59: (2001) |
2000 |
15 | EE | Eddie Cheng,
Marc J. Lipman:
On the Day-Tripathi orientation of the star graphs: Connectivity.
Inf. Process. Lett. 73(1-2): 5-10 (2000) |
14 | EE | Eddie Cheng,
Marc J. Lipman:
Orienting split-stars and alternating group graphs.
Networks 35(2): 139-144 (2000) |
1997 |
13 | | Lowell W. Beineke,
Wayne Goddard,
Marc J. Lipman:
Graphs with Maximum Edge-Integrity.
Ars Comb. 46: (1997) |
1995 |
12 | | Marc J. Lipman,
Julia Abrahams:
Minimum average cost testing for partially ordered components.
IEEE Transactions on Information Theory 41(1): 287-291 (1995) |
1994 |
11 | EE | Kunwarjit S. Bagga,
Lowell W. Beineke,
Marc J. Lipman,
Raymond E. Pippert:
Edge-integrity: a survey.
Discrete Mathematics 124(1-3): 3-12 (1994) |
1993 |
10 | EE | 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) |
9 | | Julia Abrahams,
Marc J. Lipman:
Relative uniformity of sources and the comparison of optimal code costs.
IEEE Transactions on Information Theory 39(5): 1695- (1993) |
1992 |
8 | EE | 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) |
7 | | Julia Abrahams,
Marc J. Lipman:
Zero-redundancy coding for unequal code symbol costs.
IEEE Transactions on Information Theory 38(5): 1583- (1992) |
1987 |
6 | EE | Robert L. Sedlmeyer,
Marc J. Lipman:
Property computation in Grapple (abstract only).
ACM Conference on Computer Science 1987: 366 |
5 | EE | Marc J. Lipman,
Robert L. Sedlmeyer:
Knowledge and reasoning in graph theory research (abstract only).
ACM Conference on Computer Science 1987: 415 |
1986 |
4 | EE | Marc J. Lipman,
Robert L. Sedlmeyer:
Developments in an expert system for graph theory investigation.
ACM Conference on Computer Science 1986: 327-330 |
1985 |
3 | EE | Robert L. Sedlmeyer,
Marc J. Lipman:
Computer-aided investigation in graph theory (abstract only).
ACM Conference on Computer Science 1985: 418 |
2 | EE | Marc J. Lipman:
Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups.
Discrete Mathematics 54(1): 15-21 (1985) |
1983 |
1 | EE | Richard D. Ringeisen,
Marc J. Lipman:
Cohesion and stability in graphs.
Discrete Mathematics 46(2): 191-198 (1983) |