Book Volume 7551 2012

Graph-Theoretic Concepts in Computer Science

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

ISBN: 978-3-642-34610-1 (Print) 978-3-642-34611-8 (Online)

Table of contents (33 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talks (Abstracts)

    1. No Access

      Chapter

      Pages 1-1

      Account on Intervals

    2. No Access

      Chapter

      Pages 2-2

      Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance

    3. No Access

      Chapter

      Pages 3-3

      Alternating Reachability and Integer Sum of Closed Alternating Trails

  3. Poster Session

    1. No Access

      Chapter

      Pages 4-6

      Student Poster Session

  4. Papers

    1. No Access

      Chapter

      Pages 7-21

      Triangulation and Clique Separator Decomposition of Claw-Free Graphs

    2. No Access

      Chapter

      Pages 22-33

      Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs

    3. No Access

      Chapter

      Pages 34-45

      Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs

    4. No Access

      Chapter

      Pages 46-56

      Optimization Problems in Dotted Interval Graphs

    5. No Access

      Chapter

      Pages 57-68

      The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)

    6. No Access

      Chapter

      Pages 69-80

      Solutions for the Stable Roommates Problem with Payments

    7. No Access

      Chapter

      Pages 81-90

      Which Multi-peg Tower of Hanoi Problems Are Exponential?

    8. No Access

      Chapter

      Pages 91-102

      h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area

    9. No Access

      Chapter

      Pages 103-113

      The Duals of Upward Planar Graphs on Cylinders

    10. No Access

      Chapter

      Pages 114-125

      The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases

    11. No Access

      Chapter

      Pages 126-137

      Determining the L(2,1)-Span in Polynomial Space

    12. No Access

      Chapter

      Pages 138-147

      On the Minimum Degree Up to Local Complementation: Bounds and Complexity

    13. No Access

      Chapter

      Pages 148-159

      On the Stable Degree of Graphs

    14. No Access

      Chapter

      Pages 160-171

      A 9k Kernel for Nonseparating Independent Set in Planar Graphs

    15. No Access

      Chapter

      Pages 172-183

      Parameterized Algorithms for Even Cycle Transversal

    16. No Access

      Chapter

      Pages 184-193

      Bisections above Tight Lower Bounds

previous Page of 2