fedor v fomin

Grid   List

  1. Ebook
    Sofort lieferbar
    Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their ...
    53,49 €
    Alle Preise inkl. MwSt
  2. Ebook
    Sofort lieferbar
    Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of p...
    50,49 €
    Alle Preise inkl. MwSt
  3. Ebook
    Sofort lieferbar
    Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of p...
    60,49 €
    Alle Preise inkl. MwSt
  4. Ebook
    Sofort lieferbar
    This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers man...
    53,49 €
    Alle Preise inkl. MwSt
  5. Ebook
    Sofort lieferbar
    The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions. The papers cover a wide range of topics such as algorithms and data structure...
    96,29 €
    Alle Preise inkl. MwSt
  6. Ebook
    Sofort lieferbar
    The Workshop on Parameterized and Exact Computation (IWPEC) is an - ternational workshop series that covers research in all aspects of parameterized and exact algorithms and complexity, and especia...
    53,49 €
    Alle Preise inkl. MwSt
  7. Ebook
    Sofort lieferbar
    This book constitutes the thoroughly refereed post-proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006, held in Bergen, Norway in June 2006. The ...
    53,49 €
    Alle Preise inkl. MwSt
  8. Ebook
    Sofort lieferbar
    Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festsc...
    53,49 €
    Alle Preise inkl. MwSt
  9. Ebook
    Sofort lieferbar
    This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in...
    53,49 €
    Alle Preise inkl. MwSt
  10. Ebook
    Sofort lieferbar
    This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in...
    53,49 €
    Alle Preise inkl. MwSt
  11. Ebook
    Sofort lieferbar
    This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located wit...
    53,49 €
    Alle Preise inkl. MwSt
  12. Ebook
    Sofort lieferbar
    Chapter 'Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds' is available open access under a Creative Commons Attribution 4.0 International L...
    69,54 €
    Alle Preise inkl. MwSt
  1. 1
  2. 2
  3. 3
<%--for search--%>