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

WALCOM: Algorithms and Computation

Overview of attention for book
WALCOM: Algorithms and Computation
Springer Berlin Heidelberg

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Separator Theorem for String Graphs and Its Applications
  3. Altmetric Badge
    Chapter 2 Foundations of Exact Rounding
  4. Altmetric Badge
    Chapter 3 Approximating Shortest Paths in Graphs
  5. Altmetric Badge
    Chapter 4 Line Transversals and Pinning Numbers
  6. Altmetric Badge
    Chapter 5 Algorithms for Computing Diffuse Reflection Paths in Polygons
  7. Altmetric Badge
    Chapter 6 Shortest Gently Descending Paths
  8. Altmetric Badge
    Chapter 7 All Farthest Neighbors in the Presence of Highways and Obstacles
  9. Altmetric Badge
    Chapter 8 Improved Algorithm for a Widest 1-Corner Corridor
  10. Altmetric Badge
    Chapter 9 Maximum Neighbour Voronoi Games
  11. Altmetric Badge
    Chapter 10 On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
  12. Altmetric Badge
    Chapter 11 Colinear Coloring on Graphs
  13. Altmetric Badge
    Chapter 12 Recursive Generation of 5-Regular Planar Graphs
  14. Altmetric Badge
    Chapter 13 Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
  15. Altmetric Badge
    Chapter 14 Generating All Triangulations of Plane Graphs (Extended Abstract)
  16. Altmetric Badge
    Chapter 15 Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
  17. Altmetric Badge
    Chapter 16 Random Generation and Enumeration of Proper Interval Graphs
  18. Altmetric Badge
    Chapter 17 A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
  19. Altmetric Badge
    Chapter 18 Minmax Tree Cover in the Euclidean Space
  20. Altmetric Badge
    Chapter 19 Network Design with Weighted Degree Constraints
  21. Altmetric Badge
    Chapter 20 Minimum Cuts of Simple Graphs in Almost Always Linear Time
  22. Altmetric Badge
    Chapter 21 The Generalized Stable Allocation Problem
  23. Altmetric Badge
    Chapter 22 Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
  24. Altmetric Badge
    Chapter 23 Core and Conditional Core Path of Specified Length in Special Classes of Graphs
  25. Altmetric Badge
    Chapter 24 The Planar k-Means Problem is NP-Hard
  26. Altmetric Badge
    Chapter 25 On the Computational Complexity of Monotone Constraint Satisfaction Problems
  27. Altmetric Badge
    Chapter 26 Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
  28. Altmetric Badge
    Chapter 27 Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O ( n log n ) Area (Extended Abstract)
  29. Altmetric Badge
    Chapter 28 Matched Drawability of Graph Pairs and of Graph Triples
  30. Altmetric Badge
    Chapter 29 WALCOM: Algorithms and Computation
  31. Altmetric Badge
    Chapter 30 Spherical-Rectangular Drawings
  32. Altmetric Badge
    Chapter 31 The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
  33. Altmetric Badge
    Chapter 32 The Minimal Manhattan Network Problem in Three Dimensions
  34. Altmetric Badge
    Chapter 33 Shape Matching by Random Sampling
  35. Altmetric Badge
    Chapter 34 Object Caching for Queries and Updates
Attention for Chapter 24: The Planar k-Means Problem is NP-Hard
Altmetric Badge

Mentioned by

twitter
1 X user
patent
4 patents
wikipedia
5 Wikipedia pages

Readers on

mendeley
47 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
The Planar k-Means Problem is NP-Hard
Chapter number 24
Book title
WALCOM: Algorithms and Computation
Published in
WALCOM Algorithms and Computation, January 2009
DOI 10.1007/978-3-642-00202-1_24
Book ISBNs
978-3-64-200201-4, 978-3-64-200202-1
Authors

Meena Mahajan, Prajakta Nimbhorkar, Kasturi Varadarajan, Mahajan, Meena, Nimbhorkar, Prajakta, Varadarajan, Kasturi

View on publisher site

Login to access the Attention Digest and the Sentiment Analysis related to this output.

Timeline Attention over time Attention Score history
Login to access the full charts related to this output.
Activity
Login to access the full charts related to this output.
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley demographics

Mendeley demographics

The data shown below were compiled from readership statistics for 47 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Login to view Mendeley reader trends over time.

Geographical breakdown

Country Count As %
United States 1 2%
United Kingdom 1 2%
China 1 2%
Switzerland 1 2%
Unknown 43 91%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 13 28%
Student > Master 8 17%
Researcher 5 11%
Student > Doctoral Student 3 6%
Student > Bachelor 3 6%
Other 8 17%
Unknown 7 15%
Readers by discipline Count As %
Computer Science 20 43%
Mathematics 5 11%
Engineering 5 11%
Psychology 2 4%
Business, Management and Accounting 1 2%
Other 5 11%
Unknown 9 19%