( en | de | ru )

 

Disambiguation of "Lipman, Marc J."

Author of the publication

copydeleteadd this publication to your clipboard
Computer-aided investigation in graph theory (abstract only).

, and . ACM Conference on Computer Science, page 418. ACM, (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hans Lipman

Barbara Susanne Lipman-Wulf

Stefanie Marczoch

Langzeitverlauf von 200 Patienten mit kraniofazialen und zervikalen Dystonien bis zu 12 Jahre nach der ersten Botulinumtoxin-Behandlung. TU München, (2009)

Norbert J J Bock

Heinrich J J Mieschendahl

 

Other publications of authors with the same name

Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness., and . Discret. Appl. Math., 118 (3): 163-179 (2002)Graphs with Maximum Edge-Integrity., , and . Ars Comb., (1997)Orienting split-stars and alternating group graphs., and . Networks, 35 (2): 139-144 (2000)Computer-aided investigation in graph theory (abstract only)., and . ACM Conference on Computer Science, page 418. ACM, (1985)Flow Formulations for the Student Scheduling Problem., , and . PATAT, volume 2740 of Lecture Notes in Computer Science, page 299-309. Springer, (2002)Developments in an expert system for graph theory investigation., and . ACM Conference on Computer Science, page 327-330. ACM, (1986)Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups.. Discret. Math., 54 (1): 15-21 (1985)Property computation in Grapple (abstract only)., and . ACM Conference on Computer Science, page 366. ACM, (1987)Knowledge and reasoning in graph theory research (abstract only)., and . ACM Conference on Computer Science, page 415. ACM, (1987)Matching preclusion for Alternating Group Graphs and their Generalizations., , , and . Int. J. Found. Comput. Sci., 19 (6): 1413-1437 (2008)