Algorithms and Complexity

8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings

Editors:

ISBN: 978-3-642-38232-1 (Print) 978-3-642-38233-8 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-12

    Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost

  3. No Access

    Book Chapter

    Pages 13-24

    Parameterized Complexity and Kernel Bounds for Hard Planning Problems

  4. No Access

    Book Chapter

    Pages 25-36

    Selfish Resource Allocation in Optical Networks

  5. No Access

    Book Chapter

    Pages 37-48

    Average Optimal String Matching in Packed Strings

  6. No Access

    Book Chapter

    Pages 49-60

    Parameterized Complexity of DAG Partitioning

  7. No Access

    Book Chapter

    Pages 61-72

    Four Measures of Nonlinearity

  8. No Access

    Book Chapter

    Pages 73-84

    On the Characterization of Plane Bus Graphs

  9. No Access

    Book Chapter

    Pages 85-96

    Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items

  10. No Access

    Book Chapter

    Pages 97-109

    A Greedy Approximation Algorithm for Minimum-Gap Scheduling

  11. No Access

    Book Chapter

    Pages 110-121

    Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas

  12. No Access

    Book Chapter

    Pages 122-133

    Linear Time Distributed Swap Edge Algorithms

  13. No Access

    Book Chapter

    Pages 134-145

    Decentralized Throughput Scheduling

  14. No Access

    Book Chapter

    Pages 146-157

    New Results on Stabbing Segments with a Polygon

  15. No Access

    Book Chapter

    Pages 158-169

    Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games

  16. No Access

    Book Chapter

    Pages 170-182

    Complexity of Barrier Coverage with Relocatable Sensors in the Plane

  17. No Access

    Book Chapter

    Pages 183-196

    Succinct Permanent Is NEXP-Hard with Many Hard Instances

  18. No Access

    Book Chapter

    Pages 197-208

    Money-Based Coordination of Network Packets

  19. No Access

    Book Chapter

    Pages 209-220

    Truthful Many-to-Many Assignment with Private Weights

  20. No Access

    Book Chapter

    Pages 221-233

    Competitive Online Clique Clustering

  21. No Access

    Book Chapter

    Pages 234-245

    Optimal Network Decontamination with Threshold Immunity

previous Page of 2