Dr. Martin Charles Golumbic

A mathematician and computer scientist, he is best known for his work in algorithmic graph theory and in artificial intelligence. Born in Erie, Pennsylvania, U.S.A., he received his Ph.D. in 1975 at Columbia University where his advisor was the eminent mathematician Samuel Eilenberg. He was a professor at the Courant Institute of Mathematical Sciences of New York University until 1980, and then a researcher at Bell Laboratories until moving permanently to Israel in 1982, where he previously held positions at IBM Research and Bar-Ilan University. He has held visiting positions at Universit? de Paris, the Weizmann Institute of Science, the ?cole Polytechnique F?d?rale de Lausanne, the Universidade Federal do Rio de Janeiro, Columbia University and Rutgers University. His work in graph theory led to the study of new perfect graph families such as tolerance graphs, which generalize the classical graph notions of interval graph and comparability graph. He is credited with introducing the systematic study of algorithmic aspects in intersection graph theory, and initiated research on new structured families of graphs including the edge intersection graphs of paths in trees (EPT), tolerance graphs, chordal probe graphs and trivially perfect graphs. He, along with Kaplan and Shamir introduced the study of graph sandwich problems; which is a problem of finding a graph that belongs to a particular family of graphs and is "sandwiched" between two other graphs, one of which must be a subgraph and the other of which must be a supergraph of the desired graph. In the area of compiler optimization, he holds a joint patent with Vladimir Rainish, Instruction Scheduler for a Computer, (UK9-90-035/IS); an invention based on their technique called SHACOOF (ScHeduling Across COntrOl Flow) which in Hebrew means "transparent". In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the amount of memory occupied. The growth of portable computers has created a market for minimizing the power consumed by a program. Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources. He has contributed to the development of fundamental research in artificial intelligence in the area of complexity and spatial-temporal reasoning. He is currently the Founder and Director of the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science at the University of Haifa. He was elected a Fellow of the Institute of Combinatorics and its Applications (1995), Fellow of the European Coordinating Committee for Artificial Intelligence ECCAI (2005) and member of the Academia Europaea, honoris causa (2013). Golumbic also served as chairman of the Israeli Association of Artificial Intelligence (1998?2004), and founded and chaired numerous international symposia in discrete mathematics and in the foundations of artificial intelligence. He is the author or co-author of several books including: "Perfect Elimination and Chordal Bipartite Graphs". Journal of Graph Theory 2, with Clinton F. Goss (Summer 1978), 155?163. doi:10.1002/jgt.3190020209; ?Algorithmic Graph Theory and Perfect Graphs?, First edition, Academic Press, New York, 1980, Second edition, Annals of Discrete Mathematics 57, Elsevier, 2004; ?Tolerance Graphs? (with Ann N. Trenk), Cambridge University Press, 2004; ?Fighting Terror Online: The Convergence of Security, Technology, and the Law?, Springer-Verlag, New York, 2008; and ?Reasoning About Time?, (book chapter in Mathematical Aspects of Artificial Intelligence, with F. Hoffman, ed., American Math. Society, Proc. Symposia in Applied Math., vol. 55, 1998, pp. 19?53. In addition, he is the founding Editor-In-Chief of the journal, Annals of Mathematics and Artificial Intelligence. Among his honors and awards are: in 1966 he received the Rensselaer Medal for Excellence in Mathematics; in 1991 he was named Foundation Fellow at the Institute of Combinatorics and its Applications; in 2005 he was named Fellow on the European Coordinating Committee for Artificial Intelligence, ECCAI; and he was named Member of Academia Europaea in 2013