Martin Charles Golumbic

Martin Charles Golumbic
Born	1948
Alma mater	Pennsylvania State University (BSc, MSc), Columbia University (PhD)
Occupation(s)	Mathematician, computer scientist
Employer(s)	University of Haifa (professor emeritus), Bar-Ilan University, IBM Research Israel, Bell Laboratories, Courant Institute of Mathematical Sciences
Known for	Contributions to perfect graphs, graph sandwich problems, tolerance graphs, compiler optimization, spatiotemporal reasoning; founder of Annals of Mathematics and Artificial Intelligence
Notable work	Algorithmic Graph Theory and Perfect Graphs; Tolerance Graphs; Fighting Terror Online; The Zeroth Book of Graph Theory
Awards	Fellow of the European Association for Artificial Intelligence (2005); Member of Academia Europaea (2013); Lifetime Achievement and Service Award from the Israeli Association for Artificial Intelligence (2019)

Martin Charles Golumbic (born 1948) is a distinguished mathematician and computer scientist noted for his contributions to the study of perfect graphs, graph sandwich problems, tolerance graphs, compiler optimization, and spatiotemporal reasoning. He holds the title of professor emeritus at the University of Haifa and is the founder of the journal Annals of Mathematics and Artificial Intelligence.

Education and career

Golumbic obtained both his bachelor's and master's degrees in mathematics from Pennsylvania State University in 1970. He earned his doctorate at Columbia University in 1975, presenting a dissertation titled Comparability Graphs and a New Matroid under the guidance of Samuel Eilenberg.

His academic career began as an assistant professor at the Courant Institute of Mathematical Sciences at New York University from 1975 until 1980, after which he joined Bell Laboratories. Between 1983 and 1992, he was part of the research team at IBM Research in Israel. Subsequently, from 1992 to 2000, he served as a professor at Bar-Ilan University. In 2000, he transitioned to the University of Haifa, where he established the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science.

In 1989, Golumbic initiated the Bar-Ilan Symposium in Foundations of Artificial Intelligence, which has become one of Israel’s premier AI conferences. The following year, in 1990, he took on the role of founding editor-in-chief for Springer’s journal Annals of Mathematics and Artificial Intelligence.

Recognition

In 2005, Golumbic was honored as a fellow by the European Association for Artificial Intelligence, and in 2013, he was inducted into the Academia Europaea. His lifetime contributions were further acknowledged in 2019 when he received the Lifetime Achievement and Service Award from the Israeli Association for Artificial Intelligence during the Bar-Ilan Symposium.

Books

• Algorithmic Graph Theory and Perfect Graphs (Academic Press, 1980; second edition published by Elsevier, 2004)
• Tolerance Graphs (co-authored with Ann Trenk, Cambridge University Press, 2004)
• Fighting Terror Online: The Convergence of Security, Technology, and the Law (Springer, 2008)
• The Zeroth Book of Graph Theory: An Annotated Translation of Les Réseaux (ou Graphes)-André Sainte-Laguë (1926) (Springer, 2021)

Other publications

• 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), pp. 258–263.
• Golumbic, Martin Charles & Shamir, Ron (November 1993). "Complexity and algorithms for reasoning about time." Journal of the ACM, 40(5), pp. 1108–1133.
• 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), pp.139–152.
• Golumbic, Martin Charles, Kaplan, Haim & Shamir, Ron (1995). "Graph sandwich problems." Journal of Algorithms, 19(3), pp.449–473.
• Golumbic, Martin Charles & Rotics, Udi (2000). "On the clique-width of some perfect graph classes." International Journal of Foundations of Computer Science, 11(3), pp.423–443.

External links

• Official homepage