Martin Charles Golumbic

From Wikipedia, the free encyclopedia
Martin Golumbic.jpg

Martin Charles Golumbic (born 1948)[1] is a mathematician and computer scientist known for his research on perfect graphs, graph sandwich problems, compiler optimization, and spatial-temporal reasoning. He is a professor emeritus of computer science at the University of Haifa,[2] and was the founder of the journal Annals of Mathematics and Artificial Intelligence.

Education and career[edit]

Golumbic majored in mathematics at Pennsylvania State University, graduating in 1970 with bachelor's and master's degrees.[3] He completed his Ph.D. at Columbia University in 1975, with the dissertation Comparability Graphs and a New Matroid supervised by Samuel Eilenberg.[4]

He became an assistant professor in the Courant Institute of Mathematical Sciences of New York University from 1975 until 1980, when he moved to Bell Laboratories. From 1983 to 1992 he worked for IBM Research in Israel, and from 1992 to 2000 he was a professor of mathematics and computer science at Bar-Ilan University. He moved to the University of Haifa in 2000, where he founded the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science.[3][2]

In 1989, Golumbic founded the Bar-Ilan Symposium in Foundations of Artificial Intelligence, a leading artificial intelligence conference in Israel.[5] In 1990 Golumbic became the founding editor-in-chief of the journal Annals of Mathematics and Artificial Intelligence, published by Springer.[6]


Golumbic is a fellow of the European Association for Artificial Intelligence (2005).[7] He was elected to the Academia Europaea in 2013.

At the 2019 Bar-Ilan Symposium in Foundations of Artificial Intelligence, Golumbic was given the Lifetime Achievement and Service Award of the Israeli Association for Artificial Intelligence.[5]

Selected publications[edit]

Golumbic is the author of books including:

  • Algorithmic Graph Theory and Perfect Graphs (Academic Press, 1980; 2nd ed., Elsevier, 2004)[8]
  • Tolerance Graphs (with Ann Trenk, Cambridge University Press, 2004)[9]
  • Fighting Terror Online: The Convergence of Security, Technology, and the Law (Springer, 2008)[10]

Other highly-cited publications of Golumbic include:

  • Bernstein, D.; Golumbic, M.; Mansour, Y.; Pinter, R.; Goldin, D.; Krawczyk, H.; Nahshon, I. (July 1989). "Spill code minimization techniques for optimizing compilers". ACM SIGPLAN Notices. 24 (7): 258–263. doi:10.1145/74818.74841.
  • Golumbic, Martin Charles; Shamir, Ron (November 1993). "Complexity and algorithms for reasoning about time". Journal of the ACM. 40 (5): 1108–1133. doi:10.1145/174147.169675. MR 1368960. S2CID 15708027.
  • Goldberg, Paul W.; Golumbic, Martin C.; Kaplan, Haim; Shamir, Ron (January 1995). "Four strikes against physical mapping of DNA". Journal of Computational Biology. 2 (1): 139–152. doi:10.1089/cmb.1995.2.139. PMID 7497116.
  • Golumbic, Martin Charles; Kaplan, Haim; Shamir, Ron (1995). "Graph sandwich problems". Journal of Algorithms. 19 (3): 449–473. doi:10.1006/jagm.1995.1047. MR 1355650.
  • Golumbic, Martin Charles; Rotics, Udi (2000). "On the clique-width of some perfect graph classes". International Journal of Foundations of Computer Science. 11 (3): 423–443. doi:10.1142/S0129054100000260. MR 1792124.


  1. ^ Birth year from German National Library catalog entry, retrieved 2021-01-01
  2. ^ a b "A Brief Biography". University of Haifa. Retrieved 2021-01-01.
  3. ^ a b "Martin Charles Golumbic". Academia Europaea. Retrieved 2021-01-01.; see also the linked brief biography.
  4. ^ Martin Charles Golumbic at the Mathematics Genealogy Project
  5. ^ a b "15th Bar Ilan Symposium on Foundations of Artificial Intelligence (BISFAI)". Bar-Ilan University. June 2019. Retrieved 2021-01-01.
  6. ^ Martin Charles Golumbic (1990). "Editorial welcome". Annals of Mathematics and Artificial Intelligence. 1 (1–4): I–III. doi:10.1007/BF01531065. S2CID 46040281.
  7. ^ "Fellows". European Association for Artificial Intelligence. Retrieved 2021-01-01.
  8. ^ Reviews of Algorithmic Graph Theory and Perfect Graphs: P.Brucker, Zbl 0541.05054; Witold Lipski (1981), MR0562306; Rolf H. Möhring (1986), Order, doi:10.1007/BF00390110; Haiko Müller, Zbl 1050.05002; Leslie E. Trotter Jr. (1983), Networks, doi:10.1002/net.3230130214; Dominique de Werra (2005), MR2063679
  9. ^ Reviews of Tolerance Graphs: Garth T. Isaak (2005), MR2051713; Ralph Gordon Stanton, Zbl 1091.05001
  10. ^ Review of Fighting Terror Online: Joshua Sinai (2014), Perspectives on Terrorism, JSTOR 26297270

External links[edit]