Algorithms and Computation

23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings

Editors:

ISBN: 978-3-642-35260-7 (Print) 978-3-642-35261-4 (Online)

Table of contents (71 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Talk (I)

    1. No Access

      Book Chapter

      Pages 1-1

      Future Directions in Computer Science Research

  3. Invited Talk (II)

    1. No Access

      Book Chapter

      Pages 2-2

      Combinatorial Geometry and Approximation Algorithms

  4. Invited Talk (III)

    1. No Access

      Book Chapter

      Pages 3-3

      Origami Robots and Star Trek Replicators

  5. Graph Algorithms (I)

    1. No Access

      Book Chapter

      Pages 4-13

      Strong Conflict-Free Coloring for Intervals

    2. No Access

      Book Chapter

      Pages 14-23

      Closing Complexity Gaps for Coloring Problems on H-Free Graphs

    3. No Access

      Book Chapter

      Pages 24-33

      Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors

    4. No Access

      Book Chapter

      Pages 34-43

      Reconfiguration of List L(2,1)-Labelings in a Graph

  6. Online and Streaming Algorithms

    1. No Access

      Book Chapter

      Pages 44-53

      An 8/3 Lower Bound for Online Dynamic Bin Packing

    2. No Access

      Book Chapter

      Pages 54-63

      Computing k-center over Streaming Data for Small k

    3. No Access

      Book Chapter

      Pages 64-74

      Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams

    4. No Access

      Book Chapter

      Pages 75-84

      Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem

  7. Combinatorial Optimization (I)

    1. No Access

      Book Chapter

      Pages 85-94

      A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings

    2. No Access

      Book Chapter

      Pages 95-105

      Fast and Simple Fully-Dynamic Cut Tree Construction

    3. No Access

      Book Chapter

      Pages 106-115

      Green Scheduling, Flows and Matchings

    4. No Access

      Book Chapter

      Pages 116-125

      Popular and Clan-Popular b-Matchings

  8. Computational Complexity (I)

    1. No Access

      Book Chapter

      Pages 126-135

      Kernelization and Parameterized Complexity of Star Editing and Union Editing

    2. No Access

      Book Chapter

      Pages 136-145

      On the Advice Complexity of Buffer Management

    3. No Access

      Book Chapter

      Pages 146-155

      On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree

    4. No Access

      Book Chapter

      Pages 156-165

      Speeding Up Shortest Path Algorithms

  9. Computational Geometry (I)

    1. No Access

      Book Chapter

      Pages 166-176

      How Many Potatoes Are in a Mesh?

previous Page of 4