( en | de | ru )

 

Disambiguation of "Pyatkin, Artem V."

Author of the publication

copydeleteadd this publication to your clipboard
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum.

, , , and . AIST, volume 10716 of Lecture Notes in Computer Science, page 142-151. Springer, (2017)

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.

Artem Polyvyanyy

Artemios Artemiou

Oleksandr Artemenko

Artem Luzan

Artem Revenko

 

Other publications of authors with the same name

The incidentor coloring of multigraphs and its applications.. Discret. Appl. Math., 120 (1-3): 209-217 (2002)On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach., , and . DOOR (Supplement), volume 1623 of CEUR Workshop Proceedings, page 526-535. CEUR-WS.org, (2016)Alternation Graphs., , and . WG, volume 6986 of Lecture Notes in Computer Science, page 191-202. Springer, (2011)On the representation number of a crown graph., , and . Discret. Appl. Math., (2018)Incidentor coloring of weighted multigraphs., and . Electron. Notes Discret. Math., (2006)On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum., , , and . AIST, volume 10716 of Lecture Notes in Computer Science, page 142-151. Springer, (2017)New Tools to Study 1-11-Representation of Graphs., , and . Graphs Comb., 40 (5): 97 (October 2024)On 4-chromatic edge-critical regular graphs of high connectivity., , and . Discret. Math., 260 (1-3): 315-319 (2003)Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop., and . LION, volume 11968 of Lecture Notes in Computer Science, page 106-120. Springer, (2019)Radio Labeling with Pre-assigned Frequencies., , , , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 211-222. Springer, (2002)