Author of the publication

The Planar k-Means Problem is NP-Hard.

, , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 274-285. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Block Sorting: A Characterization and some Heuristics., , and . Nord. J. Comput., 14 (1-2): 126-150 (2007)Hexagonal Cellular Automata., and . A Perspective in Theoretical Computer Science, volume 16 of World Scientific Series in Computer Science, World Scientific, (1989)Systolic Pyramid Automata, Cellular Automata and Array Languages., and . Array Grammars, Patterns and Recognizers, volume 18 of World Scientific Series in Computer Science, World Scientific, (1989)Logspace Verifiers, NC, and NP., , and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 52-61. Springer, (1995)Towards Constructing Optimal Strip Move Sequences., , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 33-42. Springer, (2004)Determinant: Old Algorithms, New Insights (Extended Abstract)., and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 276-287. Springer, (1998)Arithmetizing Classes Around NCNC1 and LL., , and . Theory Comput. Syst., 46 (3): 499-522 (2010)On the Complexity of Rank and Rigidity., and . Electron. Colloquium Comput. Complex., (2006)Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae., and . Electron. Colloquium Comput. Complex., (2008)Shortest path length with bounded-alternation (min, +) formulas., , and . Electron. Colloquium Comput. Complex., (2018)