Book Volume 8635 2014

Mathematical Foundations of Computer Science 2014

39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II

ISBN: 978-3-662-44464-1 (Print) 978-3-662-44465-8 (Online)

Table of contents (53 chapters)

Page of 3 next
  1. Algorithms, Complexity and Games

    1. No Access

      Chapter and Conference Paper

      Pages 481-492

      On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic

    2. No Access

      Chapter and Conference Paper

      Pages 493-504

      Computational Complexity of Covering Three-Vertex Multigraphs

    3. No Access

      Chapter and Conference Paper

      Pages 505-516

      Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs

    4. No Access

      Chapter and Conference Paper

      Pages 517-528

      On Coloring Resilient Graphs

    5. No Access

      Chapter and Conference Paper

      Pages 529-540

      Document Retrieval with One Wildcard

    6. No Access

      Chapter and Conference Paper

      Pages 541-552

      An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games

    7. No Access

      Chapter and Conference Paper

      Pages 553-564

      Traveling Salesman Problems in Temporal Graphs

    8. No Access

      Chapter and Conference Paper

      Pages 565-576

      Inferring Strings from Lyndon Factorization

    9. No Access

      Chapter and Conference Paper

      Pages 577-588

      Betweenness Centrality – Incremental and Faster

    10. No Access

      Chapter and Conference Paper

      Pages 589-600

      Deterministic Parameterized Algorithms for the Graph Motif Problem

    11. No Access

      Chapter and Conference Paper

      Pages 601-612

      The Two Queries Assumption and Arthur-Merlin Classes

    12. No Access

      Chapter and Conference Paper

      Pages 613-624

      Flexible Bandwidth Assignment with Application to Optical Networks

    13. No Access

      Chapter and Conference Paper

      Pages 625-636

      Approximation Algorithms for Bounded Color Matchings via Convex Decompositions

  2. Back Matter

    Pages -

Page of 3 next