↓ Skip to main content

Algorithms and Complexity

Overview of attention for book
Cover of 'Algorithms and Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Towards a Distributed Search Engine
  3. Altmetric Badge
    Chapter 2 Mechanisms for the Marriage and the Assignment Game
  4. Altmetric Badge
    Chapter 3 Resilient Algorithms and Data Structures
  5. Altmetric Badge
    Chapter 4 An Exact Algorithm for Connected Red-Blue Dominating Set
  6. Altmetric Badge
    Chapter 5 Maximizing PageRank with New Backlinks
  7. Altmetric Badge
    Chapter 6 Enumerating Rooted Graphs with Reflectional Block Structures
  8. Altmetric Badge
    Chapter 7 Improved Approximations for TSP with Simple Precedence Constraints
  9. Altmetric Badge
    Chapter 8 Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
  10. Altmetric Badge
    Chapter 9 Parameterized Complexity of Even/Odd Subgraph Problems
  11. Altmetric Badge
    Chapter 10 Popular Matchings in the Marriage and Roommates Problems
  12. Altmetric Badge
    Chapter 11 Bounding the Number of Tolerable Faults in Majority-Based Systems
  13. Altmetric Badge
    Chapter 12 A Parameterized Algorithm for Chordal Sandwich
  14. Altmetric Badge
    Chapter 13 Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown
  15. Altmetric Badge
    Chapter 14 Graph Unique-Maximum and Conflict-Free Colorings
  16. Altmetric Badge
    Chapter 15 Strategic Coloring of a Graph
  17. Altmetric Badge
    Chapter 16 Multicut Algorithms via Tree Decompositions
  18. Altmetric Badge
    Chapter 17 The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
  19. Altmetric Badge
    Chapter 18 Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
  20. Altmetric Badge
    Chapter 19 A Planar Linear Arboricity Conjecture
  21. Altmetric Badge
    Chapter 20 On the Number of Higher Order Delaunay Triangulations
  22. Altmetric Badge
    Chapter 21 How Simple Robots Benefit from Looking Back
  23. Altmetric Badge
    Chapter 22 On Strategy Improvement Algorithms for Simple Stochastic Games
  24. Altmetric Badge
    Chapter 23 Online Cooperative Cost Sharing
  25. Altmetric Badge
    Chapter 24 On the Power of Nodes of Degree Four in the Local Max-Cut Problem
  26. Altmetric Badge
    Chapter 25 Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
  27. Altmetric Badge
    Chapter 26 Irredundant Set Faster Than O (2 n )
  28. Altmetric Badge
    Chapter 27 Algorithms and Complexity
  29. Altmetric Badge
    Chapter 28 A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
  30. Altmetric Badge
    Chapter 29 Finding the Maximum Suffix with Fewer Comparisons
  31. Altmetric Badge
    Chapter 30 An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
  32. Altmetric Badge
    Chapter 31 Capacitated Confluent Flows: Complexity and Algorithms
  33. Altmetric Badge
    Chapter 32 Preprocessing Speed-Up Techniques Is Hard
  34. Altmetric Badge
    Chapter 33 Communication Requirements for Stable Marriages
Attention for Chapter 20: On the Number of Higher Order Delaunay Triangulations
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

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
On the Number of Higher Order Delaunay Triangulations
Chapter number 20
Book title
Algorithms and Complexity
Published by
Springer, Berlin, Heidelberg, May 2010
DOI 10.1007/978-3-642-13073-1_20
Book ISBNs
978-3-64-213072-4, 978-3-64-213073-1
Authors

Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira, Mitsche, Dieter, Saumell, Maria, Silveira, Rodrigo I.

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 %
Researcher 1 100%
Readers by discipline Count As %
Computer Science 1 100%