Graph Theory, Computational Intelligence and Thought

Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday

  • Marina Lipshteyn
  • Vadim E. Levit
  • Ross M. McConnell

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5420)

Table of contents

  1. Front Matter
  2. Oana Andrei, Hélène Kirchner
    Pages 15-26
  3. Fanica Gavril
    Pages 27-35
  4. Mark Korenblit, Vadim E. Levit
    Pages 36-40
  5. Michal Penn, Maria Polukarov, Moshe Tennenholtz
    Pages 41-53
  6. Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán
    Pages 54-65
  7. Fanica Gavril, Alon Itai
    Pages 66-76
  8. Domingos M. Cardoso, Vadim V. Lozin
    Pages 77-86
  9. Georg Gottlob, Gianluigi Greco, Bruno Marnette
    Pages 87-99
  10. Andreas Brandstädt, Raffaele Mosca
    Pages 116-126
  11. Irith Ben-Arroyo Hartman
    Pages 134-143
  12. L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
    Pages 148-157
  13. Benson L. Joeris, Scott Lundberg, Ross M. McConnell
    Pages 158-171
  14. Andreas Brandstädt, Martin C. Golumbic, Van Bang Le, Marina Lipshteyn
    Pages 172-182
  15. Gregory Gutin, Eun Jung Kim
    Pages 200-208

About this book

Introduction

Martin Charles Golumbic has been making seminal contributions to algorithmic graph theory and artificial intelligence throughout his career. He is universally admired as a long-standing pillar of the discipline of computer science. He has contributed to the development of fundamental research in artificial intelligence in the area of complexity and spatial-temporal reasoning as well as in the area of compiler optimization. Golumbic's 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) and trivially perfect graphs.

Golumbic 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 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.

This Festschrift volume, published in honor of Martin Charles Golumbic on the occasion of his 60th birthday, contains 20 papers, written by graduate students, research collaborators, and computer science colleagues, who gathered at a conference on subjects related to Martin Golumbic's manifold contributions in the field of algorithmic graph theory and artificial intelligence, held in Jerusalem, Tiberias and Haifa, Israel in September 2008.

Keywords

Computational Intelligence Graph Graph theory algorithms artificial intelligence bicolorable graph bipartite graphs chordal graphs cocomparability graphs cognition connected graphs constraints edge dominating set heuristics optimization

Editors and affiliations

  • Marina Lipshteyn
    • 1
  • Vadim E. Levit
    • 2
  • Ross M. McConnell
    • 3
  1. 1.The Caesarea Rothschild Institute, Mount CarmelUniversity of HaifaHaifaIsrael
  2. 2.Department of Computer Science and MathematicsAriel University Center of SamariaArielIsrael
  3. 3.Department of Computer ScienceColorado State UniversityFort CollinsUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-02029-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-02028-5
  • Online ISBN 978-3-642-02029-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book