Book Volume 6460 2011

Combinatorial Algorithms

21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers


ISBN: 978-3-642-19221-0 (Print) 978-3-642-19222-7 (Online)

Table of contents (39 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-9

    Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes

  3. Chapter

    Pages 10-19

    On the Maximal Sum of Exponents of Runsin a String

  4. Chapter

    Pages 20-33

    Path-Based Supports for Hypergraphs

  5. Chapter

    Pages 34-37

    On Improved Exact Algorithms for L(2,1)-Labeling of Graphs

  6. Chapter

    Pages 38-42

    Thread Graphs, Linear Rank-Width and Their Algorithmic Applications

  7. Chapter

    Pages 43-55

    Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three

  8. Chapter

    Pages 56-67

    Shortest Paths between Shortest Paths and Independent Sets

  9. Chapter

    Pages 68-81

    Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism

  10. Chapter

    Pages 82-89

    Dichotomy for Coloring of Dart Graphs

  11. Chapter

    Pages 90-102

    Worst Case Efficient Single and Multiple String Matching in the RAM Model

  12. Chapter

    Pages 103-106

    The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2

  13. Chapter

    Pages 107-120

    Upper and Lower I/O Bounds for Pebbling r-Pyramids

  14. Chapter

    Pages 121-124

    Single Parameter FPT-Algorithms for Non-trivial Games

  15. Chapter

    Pages 125-135

    The Complexity Status of Problems Related to Sparsest Cuts

  16. Chapter

    Pages 136-139

    On Approximation Complexity of Metric Dimension Problem

  17. Chapter

    Pages 140-153

    Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates

  18. Chapter

    Pages 154-166

    Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures

  19. Chapter

    Pages 167-180

    Computing Role Assignments of Proper Interval Graphs in Polynomial Time

  20. Chapter

    Pages 181-191

    Efficient Connectivity Testing of Hypercubic Networks with Faults

  21. Chapter

    Pages 192-200

    Reductions of Matrices Associated with Nowhere-Zero Flows

previous Page of 2