( en | de | ru )

 

Disambiguation of "Kel'manov, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
On a Problem of Summing Elements Chosen from the Family of Finite Numerical Sequences.

, , and . AIST, volume 11179 of Lecture Notes in Computer Science, page 305-317. Springer, (2018)

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.

Alexander

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)
 

Other publications of authors with the same name

An Approximation Scheme for a Weighted Two-Cluster Partition Problem., , and . AIST, volume 10716 of Lecture Notes in Computer Science, page 323-333. Springer, (2017)A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem., and . DOOR, volume 9869 of Lecture Notes in Computer Science, page 182-192. Springer, (2016)Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case., and . AIST, volume 11832 of Lecture Notes in Computer Science, page 377-387. Springer, (2019)Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence., , , and . Ann. Math. Artif. Intell., 88 (1-3): 157-168 (2020)Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case., and . NUMTA (2), volume 11974 of Lecture Notes in Computer Science, page 394-399. Springer, (2019)2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence., , and . NUMTA (2), volume 11974 of Lecture Notes in Computer Science, page 386-393. Springer, (2019)Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence., , and . LION, volume 11968 of Lecture Notes in Computer Science, page 135-145. Springer, (2019)The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension., and . MOTOR (2), volume 1090 of Communications in Computer and Information Science, page 207-216. Springer, (2019)On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line., and . LION, volume 11968 of Lecture Notes in Computer Science, page 46-52. Springer, (2019)Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence., , , and . LION, volume 11353 of Lecture Notes in Computer Science, page 326-336. Springer, (2018)