Advertisement

Graph-Theoretic Concepts in Computer Science

41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers

  • Ernst W. Mayr
Conference proceedings WG 2015

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9224)

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Invited Talks

  3. Computational Complexity

    1. Front Matter
      Pages 47-47
    2. Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
      Pages 49-63
    3. Bernhard Bliem, Stefan Woltran
      Pages 64-77
    4. Andreas Brandstädt, Elaine M. Eschen, Erik Friese
      Pages 78-89
    5. Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomáš Valla
      Pages 90-102
    6. Christophe Crespelle, Anthony Perez, Ioan Todinca
      Pages 103-115
    7. Serge Gaspers, Simon Mackenzie
      Pages 116-121
    8. Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
      Pages 138-153
    9. Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse
      Pages 154-168
  4. Design and Analysis

    1. Front Matter
      Pages 187-187
    2. Feodor F. Dragan, Arne Leitert
      Pages 189-202
  5. Computational Geometry

    1. Front Matter
      Pages 235-235
    2. M. J. Alam, S. G. Kobourov, S. Pupyrev, J. Toeniskoetter
      Pages 237-251
    3. William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
      Pages 252-265
    4. János Pach, Dömötör Pálvölgyi
      Pages 281-296
  6. Structural Graph Theory

    1. Front Matter
      Pages 297-297
    2. Rémy Belmonte, Yota Otachi, Pascal Schweitzer
      Pages 299-311
    3. Fernanda Couto, Luerbio Faria, Sylvain Gravier, Sulamita Klein, Vinicius F. dos Santos
      Pages 312-324
    4. Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos Stavropoulos
      Pages 325-338
    5. Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
      Pages 351-359
    6. Mateus de Oliveira Oliveira
      Pages 360-372
  7. Graph Drawing

    1. Front Matter
      Pages 389-389
    2. Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
      Pages 391-405
    3. Seok-Hee Hong, Hiroshi Nagamochi
      Pages 406-421
  8. Fixed Parameter Tractability

    1. Front Matter
      Pages 423-423
    2. Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
      Pages 440-455
    3. Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
      Pages 456-471
    4. Eun Jung Kim, Martin Milanič, Oliver Schaudt
      Pages 487-498
  9. Back Matter
    Pages 513-514

About these proceedings

Introduction

This book constitutes revised selected papers from the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015.
The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. They were organized in topical sections named: invited talks; computational complexity; design and analysis; computational geometry; structural graph theory; graph drawing; and fixed parameter tractability. 

Keywords

computational complexity exact algorithms geometric hypergraph parameterized complexity secure sets approximation algorithms chordal graphs complexity analysis extremal problems graph algorithms graph classes graph drawings graph theory grid graph kernelization NP-completeness polynomial kernel polynomial-time algorithm recognition algorithm subgraph isomorphism

Editors and affiliations

  • Ernst W. Mayr
    • 1
  1. 1.TU München Institut für InformatikGarchingGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-53174-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2016
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-53173-0
  • Online ISBN 978-3-662-53174-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site