Graph-Theoretic Concepts in Computer Science

38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers

  • Martin Charles Golumbic
  • Michal Stern
  • Avivit Levy
  • Gila Morgenstern
Conference proceedings WG 2012

DOI: 10.1007/978-3-642-34611-8

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

Table of contents

  1. Front Matter
  2. Invited Talks (Abstracts)

  3. Poster Session

    1. Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
      Pages 4-6
  4. Papers

    1. Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels
      Pages 22-33
    2. Danny Hermelin, Julián Mestre, Dror Rawitz
      Pages 46-56
    3. Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
      Pages 57-68
    4. Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
      Pages 69-80
    5. Daniel Berend, Amir Sapir
      Pages 81-90
    6. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
      Pages 91-102
    7. Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer
      Pages 103-113
    8. Leah Epstein, Asaf Levin, Gerhard J. Woeginger
      Pages 114-125
    9. Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Paweł Rzążewski
      Pages 126-137
    10. Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
      Pages 138-147
    11. Haiko Müller
      Pages 148-159
    12. Łukasz Kowalik, Marcin Mucha
      Pages 160-171
    13. Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
      Pages 172-183

About these proceedings

Introduction

This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition

Keywords

algorithms maximum clique problem multiple interval graphs parameterized complexity planar graphs

Editors and affiliations

  • Martin Charles Golumbic
    • 1
  • Michal Stern
    • 2
  • Avivit Levy
    • 3
  • Gila Morgenstern
    • 4
  1. 1.Department of Computer ScienceCaesarea Rothschild Institute (CRI)HaifaIsrael
  2. 2.The Academic College of Tel AvivUnit of Statistics and Probability StudiesYaffoIsrael
  3. 3.Shenkar College and Caesarea Rothschild Institute (CRI)University of HaifaHaifaIsrael
  4. 4.Caesarea Rothschild Institute (CRI)HaifaIsrael

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-34610-1
  • Online ISBN 978-3-642-34611-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349