Martin Charles Golumbic (born 1948 in Erie) is a mathematician and computer scientist known for his research on perfect graphs, graph sandwich problems, tolerance graphs, compiler optimization, and spatial-temporal reasoning. He is a professor emeritus of computer science at the University of Haifa and the founder of the journal Annals of Mathematics and Artificial Intelligence. Golumbic has also been affiliated with Bell Laboratories and IBM Research. He was educated at Pennsylvania State University and Columbia University, where he was advised by Samuel Eilenberg. His honors include being named a Fellow of the European Association for Artificial Intelligence in 2005, election to the Academia Europaea in 2013, and receiving the Lifetime Achievement and Service Award of the Israeli Association for Artificial Intelligence in 2019.

Golumbic studied mathematics at Pennsylvania State University, graduating in 1970 with bachelor's and master's degrees. He completed his Ph.D. at Columbia University in 1975 with the dissertation Comparability Graphs and a New Matroid, supervised by Samuel Eilenberg. He was an assistant professor at 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. In 2000, he moved to the University of Haifa, where he founded the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science.

In 1989, Golumbic founded the Bar-Ilan Symposium on the Foundations of Artificial Intelligence, a leading artificial intelligence conference in Israel. In 1990, he became the founding editor-in-chief of the journal Annals of Mathematics and Artificial Intelligence, published by Springer. He is known for his book Algorithmic Graph Theory and Perfect Graphs and also published an annotated edition of André Sainte-Laguë's book titled The zeroth book of graph theory.

Golumbic was elected a fellow of the European Association for Artificial Intelligence in 2005 and became a member of the Academia Europaea in 2013. At the 2019 Bar-Ilan Symposium on the Foundations of Artificial Intelligence, he received the Lifetime Achievement and Service Award from the Israeli Association for Artificial Intelligence.

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

In July 1989, D. Bernstein, M. Golumbic, Y. Mansour, R. Pinter, D. Goldin, H. Krawczyk, and I. Nahshon published "Spill code minimization techniques for optimizing compilers" in ACM SIGPLAN Notices. Martin Charles Golumbic and Ron Shamir co-authored "Complexity and algorithms for reasoning about time," which appeared in the Journal of the ACM in November 1993. In January 1995, Paul W. Goldberg, Martin C. Golumbic, Haim Kaplan, and Ron Shamir published "Four strikes against physical mapping of DNA" in the Journal of Computational Biology. That same year, Golumbic, Kaplan, and Shamir also published "Graph sandwich problems" in the Journal of Algorithms. In 2000, Martin Charles Golumbic and Udi Rotics published "On the clique-width of some perfect graph classes" in the International Journal of Foundations of Computer Science.