Artem V. Pyatkin
Orcid: 000000015355411X
According to our database^{1},
Artem V. Pyatkin
authored at least 56 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
Inf. Process. Lett., February, 2024
Discret. Appl. Math., 2024
2023
Discuss. Math. Graph Theory, 2023
Electron. J. Comb., 2023
2022
Ann. Math. Artif. Intell., 2022
2021
Ann. Math. Artif. Intell., 2021
2020
J. Glob. Optim., 2020
Exact algorithms for two integervalued problems of searching for the largest subset and longest subsequence.
Ann. Math. Artif. Intell., 2020
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances.
Proceedings of the Learning and Intelligent Optimization  14th International Conference, 2020
2019
Optim. Lett., 2019
Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop.
Proceedings of the Learning and Intelligent Optimization  13th International Conference, 2019
2018
Discret. Appl. Math., 2018
Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence.
Proceedings of the Learning and Intelligent Optimization  12th International Conference, 2018
2017
Pattern Recognit. Lett., 2017
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum.
Proceedings of the Analysis of Images, Social Networks and Texts, 2017
2016
Discret. Appl. Math., 2016
On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing.
Proceedings of the Computer Science  Theory and Applications, 2016
Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases.
Proceedings of the 10th International Symposium on Communication Systems, 2016
On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.
Proceedings of the Analysis of Images, Social Networks and Texts, 2016
2015
Electron. J. Comb., 2015
2014
J. Graph Theory, 2014
2013
Theory Comput. Syst., 2013
Discret. Math., 2013
2012
Astral graphs (threshold graphs), scalefree graphs and related algorithmic questions.
J. Discrete Algorithms, 2012
J. Discrete Algorithms, 2012
2011
J. Autom. Lang. Comb., 2011
Proceedings of the GraphTheoretic Concepts in Computer Science, 2011
2010
On avoidance of V and ^patterns in permutations.
Ars Comb., 2010
Proceedings of the Combinatorial Algorithms  21st International Workshop, 2010
Proceedings of the Developments in Language Theory, 14th International Conference, 2010
2008
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.
ACM Trans. Algorithms, 2008
J. Autom. Lang. Comb., 2008
Discret. Math., 2008
Algorithmica, 2008
2007
Discuss. Math. Graph Theory, 2007
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007
2006
Electron. Notes Discret. Math., 2006
NPhardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors.
Electron. Notes Discret. Math., 2006
Finding a Minimum Feedback Vertex Set in Time <i>O</i> (1.7548<sup><i>n</i></sup>).
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
2005
Electron. Notes Discret. Math., 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
SIAM J. Optim., 2004
Interval coloring of (3, 4)biregular bipartite graphs having large cubic subgraphs.
J. Graph Theory, 2004
J. Graph Theory, 2004
2003
Discret. Math., 2003
2002
J. Graph Theory, 2002
Discret. Math., 2002
Discret. Appl. Math., 2002
Proceedings of the Algorithms, 2002
2001
J. Graph Theory, 2001
Discret. Math., 2001
1999
Electron. Notes Discret. Math., 1999
1998
Proof of MelnikovVizing conjecture for multigraphs with maximum degree at most 3.
Discret. Math., 1998