Combinatorial Optimization and Applications

4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I

Editors:

ISBN: 978-3-642-17457-5 (Print) 978-3-642-17458-2 (Online)

Table of contents (33 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-10

    Termination of Multipartite Graph Series Arising from Complex Network Modelling

  3. No Access

    Book Chapter

    Pages 11-20

    Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids

  4. No Access

    Book Chapter

    Pages 21-30

    Evacuation of Rectilinear Polygons

  5. No Access

    Book Chapter

    Pages 31-40

    A Fast Algorithm for Powerful Alliances in Trees

  6. No Access

    Book Chapter

    Pages 41-50

    NP-Completeness of Spreading Colored Points

  7. No Access

    Book Chapter

    Pages 51-64

    Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach

  8. No Access

    Book Chapter

    Pages 65-76

    Feasibility-Based Bounds Tightening via Fixed Points

  9. No Access

    Book Chapter

    Pages 77-84

    A Characterisation of Stable Sets in Games with Transitive Preference

  10. No Access

    Book Chapter

    Pages 85-103

    Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering

  11. No Access

    Book Chapter

    Pages 104-113

    An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations

  12. No Access

    Book Chapter

    Pages 114-127

    Bases of Primitive Nonpowerful Sign Patterns

  13. No Access

    Book Chapter

    Pages 128-141

    Extended Dynamic Subgraph Statistics Using h -Index Parameterized Data Structures

  14. No Access

    Book Chapter

    Pages 142-156

    Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets

  15. No Access

    Book Chapter

    Pages 157-169

    Finding Strong Bridges and Strong Articulation Points in Linear Time

  16. No Access

    Book Chapter

    Pages 170-183

    Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks

  17. No Access

    Book Chapter

    Pages 184-196

    An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs

  18. No Access

    Book Chapter

    Pages 197-211

    On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs

  19. No Access

    Book Chapter

    Pages 212-221

    Cyclic Vertex Connectivity of Star Graphs

  20. No Access

    Book Chapter

    Pages 222-236

    The Number of Shortest Paths in the ( n , k )-Star Graphs

  21. No Access

    Book Chapter

    Pages 237-251

    Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems

previous Page of 2