Mathematical Foundations of Computer Science 2013

38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings

Editors:

ISBN: 978-3-642-40312-5 (Print) 978-3-642-40313-2 (Online)

Table of contents (74 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-7

    Alternation Trading Proofs and Their Limitations

  3. No Access

    Book Chapter

    Pages 8-21

    Bin Packing Games with Selfish Items

  4. No Access

    Book Chapter

    Pages 22-41

    A Constructive Proof of the Topological Kruskal Theorem

  5. No Access

    Book Chapter

    Pages 42-42

    Logical and Structural Approaches to the Graph Isomorphism Problem

  6. No Access

    Book Chapter

    Pages 43-44

    Prior-Free Auctions of Digital Goods

  7. No Access

    Book Chapter

    Pages 45-49

    Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development

  8. No Access

    Book Chapter

    Pages 50-61

    Clustering on k-Edge-Colored Graphs

  9. No Access

    Book Chapter

    Pages 62-73

    How to Pack Your Items When You Have to Buy Your Knapsack

  10. No Access

    Book Chapter

    Pages 74-85

    Computing Behavioral Distances, Compositionally

  11. No Access

    Book Chapter

    Pages 86-97

    Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?

  12. No Access

    Book Chapter

    Pages 98-110

    Rewriting Guarded Negation Queries

  13. No Access

    Book Chapter

    Pages 111-122

    Parity Games and Propositional Proofs

  14. No Access

    Book Chapter

    Pages 123-134

    Logic and Branching Automata

  15. No Access

    Book Chapter

    Pages 135-145

    A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items

  16. No Access

    Book Chapter

    Pages 146-158

    Determinacy and Rewriting of Top-Down and MSO Tree Transformations

  17. No Access

    Book Chapter

    Pages 159-170

    On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing

  18. No Access

    Book Chapter

    Pages 171-182

    Validity of Tree Pattern Queries with Respect to Schema Information

  19. No Access

    Book Chapter

    Pages 183-194

    Auctions for Partial Heterogeneous Preferences

  20. No Access

    Book Chapter

    Pages 195-206

    New Polynomial Cases of the Weighted Efficient Domination Problem

  21. No Access

    Book Chapter

    Pages 207-218

    Bringing Order to Special Cases of Klee’s Measure Problem

previous Page of 4