↓ Skip to main content

Frontiers in Algorithmics

Overview of attention for book
Cover of 'Frontiers in Algorithmics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On the Complexity of Minimizing the Total Calibration Cost
  3. Altmetric Badge
    Chapter 2 On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model
  4. Altmetric Badge
    Chapter 3 The Complexity of Finding (Approximate Sized) Distance- d Dominating Set in Tournaments
  5. Altmetric Badge
    Chapter 4 On Computational Aspects of Greedy Partitioning of Graphs
  6. Altmetric Badge
    Chapter 5 Maximum Edge Bicliques in Tree Convex Bipartite Graphs
  7. Altmetric Badge
    Chapter 6 Complete Submodularity Characterization in the Comparative Independent Cascade Model
  8. Altmetric Badge
    Chapter 7 A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate
  9. Altmetric Badge
    Chapter 8 Designing and Implementing Algorithms for the Closest String Problem
  10. Altmetric Badge
    Chapter 9 The Broken-Triangle Property with Adjoint Values
  11. Altmetric Badge
    Chapter 10 Online Knapsack Problem Under Concave Functions
  12. Altmetric Badge
    Chapter 11 Fluctuated Fitting Under the $$\ell _1$$ -metric
  13. Altmetric Badge
    Chapter 12 Optimal Partitioning Which Maximizes the Weighted Sum of Products
  14. Altmetric Badge
    Chapter 13 Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
  15. Altmetric Badge
    Chapter 14 Online Strategies for Evacuating from a Convex Region in the Plane
  16. Altmetric Badge
    Chapter 15 A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism
  17. Altmetric Badge
    Chapter 16 A 42 k Kernel for the Complementary Maximal Strip Recovery Problem
  18. Altmetric Badge
    Chapter 17 On-line Scheduling with a Monotonous Subsequence Constraint
  19. Altmetric Badge
    Chapter 18 A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling
  20. Altmetric Badge
    Chapter 19 FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
  21. Altmetric Badge
    Chapter 20 A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
  22. Altmetric Badge
    Chapter 21 Geodetic Contraction Games on Trees
  23. Altmetric Badge
    Chapter 22 On Approximation Algorithms for Two-Stage Scheduling Problems
  24. Altmetric Badge
    Chapter 23 A New Lower Bound for Positive Zero Forcing
  25. Altmetric Badge
    Chapter 24 Phase Transition for Maximum Not-All-Equal Satisfiability
Attention for Chapter 13: Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
Altmetric Badge

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
Chapter number 13
Book title
Frontiers in Algorithmics
Published by
Springer, Cham, June 2017
DOI 10.1007/978-3-319-59605-1_13
Book ISBNs
978-3-31-959604-4, 978-3-31-959605-1
Authors

Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan, Abu-Khzam, Faisal N., Li, Shouwei, Markarian, Christine, Meyer auf der Heide, Friedhelm, Podlipyan, Pavel

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 100%
Readers by discipline Count As %
Computer Science 1 100%