↓ Skip to main content
What is this page? Embed badge

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 Broadcast Problem in Hypercube of Trees
  3. Altmetric Badge
    Chapter 2 Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time
  4. Altmetric Badge
    Chapter 3 A Fixed-Parameter Approach for Privacy-Protection with Global Recoding
  5. Altmetric Badge
    Chapter 4 A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy
  6. Altmetric Badge
    Chapter 5 Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints
  7. Altmetric Badge
    Chapter 6 The Complexity of Zero-Visibility Cops and Robber
  8. Altmetric Badge
    Chapter 7 Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem
  9. Altmetric Badge
    Chapter 8 Randomized Parameterized Algorithms for Co-path Set Problem
  10. Altmetric Badge
    Chapter 9 Improved LP-rounding Approximations for the k -Disjoint Restricted Shortest Paths Problem
  11. Altmetric Badge
    Chapter 10 Monotone Grid Drawings of Planar Graphs
  12. Altmetric Badge
    Chapter 11 Spanning Distribution Forests of Graphs
  13. Altmetric Badge
    Chapter 12 A (1.408+ ε )-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
  14. Altmetric Badge
    Chapter 13 Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
  15. Altmetric Badge
    Chapter 14 Minimal Double Dominating Sets in Trees
  16. Altmetric Badge
    Chapter 15 Parallel-Machine Scheduling Problem under the Job Rejection Constraint
  17. Altmetric Badge
    Chapter 16 Approximation Algorithms on Consistent Dynamic Map Labeling
  18. Altmetric Badge
    Chapter 17 The PoA of Scheduling Game with Machine Activation Costs
  19. Altmetric Badge
    Chapter 18 Approximation Algorithms for Bandwidth Consecutive Multicolorings
  20. Altmetric Badge
    Chapter 19 Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees
  21. Altmetric Badge
    Chapter 20 Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost
  22. Altmetric Badge
    Chapter 21 Finding Simple Paths on Given Points in a Polygonal Region
  23. Altmetric Badge
    Chapter 22 Near Optimal Algorithms for Online Maximum Weighted b -Matching
  24. Altmetric Badge
    Chapter 23 Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
  25. Altmetric Badge
    Chapter 24 Zero-Sum Flow Numbers of Triangular Grids
  26. Altmetric Badge
    Chapter 25 A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains
  27. Altmetric Badge
    Chapter 26 Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity
  28. Altmetric Badge
    Chapter 27 On Star-Cover and Path-Cover of a Tree
  29. Altmetric Badge
    Chapter 28 On the Complexity of Constrained Sequences Alignment Problems
  30. Altmetric Badge
    Chapter 29 On the Advice Complexity of One-Dimensional Online Bin Packing
  31. Altmetric Badge
    Chapter 30 Dynamic Matchings in Left Weighted Convex Bipartite Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
wikipedia
1 Wikipedia page
Summary Blogs Wikipedia
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.
Title
Frontiers in Algorithmics
Published by
Springer International Publishing, July 2014
DOI 10.1007/978-3-319-08016-1
ISBNs
978-3-31-908015-4, 978-3-31-908016-1
Editors

Chen, Jianer, Hopcroft, John E., Wang, Jianxin

View on publisher site Google Preview

This page is provided by Altmetric.