×

zbMATH — the first resource for mathematics

Pyatkin, Artem V.

Compute Distance To:
Author ID: pyatkin.artem-v Recent zbMATH articles by "Pyatkin, Artem V."
Published as: Pyatkin, A. V.; Pyatkin, Artem; Pyatkin, Artem V.
Documents Indexed: 90 Publications since 1995

Publications by Year

Citations contained in zbMATH

61 Publications have been cited 324 times in 202 Documents Cited by Year
Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. Zbl 1445.05101
Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem V.; Stepanov, Alexey A.
36
2008
On the minimum feedback vertex set problem: Exact and enumeration algorithms. Zbl 1170.68029
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.; Razgon, Igor
36
2008
Interval coloring of \((3,4)\)-biregular bipartite graphs having large cubic subgraphs. Zbl 1055.05064
Pyatkin, A. V.
20
2004
On the complexity of a search for a subset of “similar” vectors. Zbl 1217.90142
Kel’manov, A. V.; Pyatkin, A. V.
16
2008
Complexity of certain problems of searching for subsets of vectors and cluster analysis. Zbl 1224.68120
Kel’manov, A. V.; Pyatkin, A. V.
15
2009
On representable graphs. Zbl 1171.05372
Kitaev, Sergey; Pyatkin, Artem
13
2008
The problem of finding a subset of vectors with maximal total weight. Zbl 1249.90211
Baburin, A. E.; Gimadi, Eh. Kh.; Glebov, N. I.; Pyatkin, A. V.
13
2007
On complexity of some problems of cluster analysis of vector sequences. Zbl 1324.68047
Kel’manov, A. V.; Pyatkin, A. V.
11
2013
Finding a minimum feedback vertex set in time \(\mathcal{O} (1.7548^n)\). Zbl 1154.05327
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.
10
2006
Bounding the number of minimal dominating sets: A measure and conquer approach. Zbl 1175.05100
Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem V.; Stepanov, Alexey A.
9
2005
Semi-transitive orientations and word-representable graphs. Zbl 1329.05217
Halldórsson, Magnús M.; Kitaev, Sergey; Pyatkin, Artem
8
2016
On toughness and Hamiltonicity of \(2K_{2}\)-free graphs. Zbl 1292.05162
Broersma, Hajo; Patel, Viresh; Pyatkin, Artem
8
2014
Graphs capturing alternations in words. Zbl 1250.68219
Halldórsson, Magnús M.; Kitaev, Sergey; Pyatkin, Artem
8
2010
Alternation graphs. Zbl 1341.05243
Halldórsson, Magnús M.; Kitaev, Sergey; Pyatkin, Artem
7
2011
On the complexity of some quadratic Euclidean 2-clustering problems. Zbl 1362.68092
Kel’manov, A. V.; Pyatkin, Artem V.
6
2016
NP-hardness of some quadratic Euclidean 2-clustering problems. Zbl 1335.68096
Kel’manov, A. V.; Pyatkin, A. V.
6
2015
NP-completeness of some problems of a vectors subset choice. Zbl 1249.68080
Kel’manov, A. V.; Pyatkin, A. V.
6
2010
On polynomial solvability of some problems of choosing a vector subset in a Euclidean space of fixed dimension. Zbl 1249.90342
Gimadi, Eh. Kh.; Pyatkin, A. V.; Rykov, I. A.
6
2008
New formula for the sum number for the complete bipartite graphs. Zbl 0993.05130
Pyatkin, A. V.
6
2001
NP-hardness of the Euclidean Max-Cut problem. Zbl 1307.90212
Ageev, A. A.; Kel’manov, A. V.; Pyatkin, A. V.
5
2014
Regular integral sum graphs. Zbl 1039.05053
Melnikov, L. S.; Pyatkin, A. V.
5
2002
Some optimization problems of scheduling the transmission of messages in a local communication network. Zbl 0860.90054
Pyatkin, A. V.
5
1995
2-approximation algorithm for finding a clique with minimum weight of vertices and edges. Zbl 1302.90175
Eremin, I. I.; Gimadi, E. K.; Kel’manov, A. V.; Pyatkin, A. V.; Khachai, M. Yu.
4
2014
Polynomial algorithms for solving the vector sum problem. Zbl 1249.90212
Baburin, A. E.; Pyatkin, A. V.
4
2006
Completing partial schedules for open shop with unit processing times and routing. Zbl 06605920
van Bevern, René; Pyatkin, Artem V.
3
2016
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph. Zbl 1319.05125
Gimadi, E. Kh.; Kel’manov, A. V.; Pyatkin, A. V.; Khachai, M. Yu.
3
2015
Triangle-free \(2P_3\)-free graphs are 4-colorable. Zbl 1259.05066
Pyatkin, Artem V.
3
2013
On \((1,1)\)-coloring of incidentors of multigraphs of degree 4. Zbl 1078.05033
Pyatkin, A. V.
3
2004
Upper and lower estimates of the incidentor \((k,l)\)-chromatic number. Zbl 1045.05043
Pyatkin, A. V.
3
2004
On the \((k,l)\)-coloring of incidentors. Zbl 0956.05037
Vizing, V. G.; Mel’nikov, L. S.; Pyatkin, A. V.
3
2000
On the complexity of some Euclidean optimal summing problems. Zbl 1348.90653
Eremeev, A. V.; Kel’manov, A. V.; Pyatkin, Artem V.
2
2016
Complexity of the weighted max-cut in Euclidean space. Zbl 1324.05188
Ageev, A. A.; Kel’manov, A. V.; Pyatkin, A. V.
2
2014
Colorings with few colors: counting, enumeration and combinatorial bounds. Zbl 1269.05034
Couturier, Jean-Francois; Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Pyatkin, Artem
2
2013
On the complexity of certain problems of choosing subset of vectors. Zbl 1274.90251
Kel’manov, A. V.; Pyatkin, A. V.
2
2012
The complexity status of problems related to sparsest cuts. Zbl 1326.68145
Bonsma, Paul; Broersma, Hajo; Patel, Viresh; Pyatkin, Artem
2
2011
On avoidance of V- and \(\Lambda \)-patterns in permutations. Zbl 1249.05004
Kitaev, Sergey; Pyatkin, Artem
2
2010
On complexity of the problem of choosing a vector subset with maximal sum length. Zbl 1249.68083
Pyatkin, A. V.
2
2009
A 2-approximation algorithm for the metric 2-peripatetic salesman problem. Zbl 1249.90296
Ageev, A. A.; Pyatkin, A. V.
2
2009
A 2-approximation algorithm for the metric 2-peripatetic salesman problem. Zbl 1130.90386
Ageev, Alexander A.; Pyatkin, Artem V.
2
2008
On the coloring of incidentors in an oriented weighted multigraph. Zbl 1249.05254
Vizing, V. G.; Pyatkin, A. V.
2
2006
Radio labeling with preassigned frequencies. Zbl 1071.05033
Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor V.; Pyatkin, Artem V.; Woeginger, Gerhard J.
2
2004
Some upper bounds for the incidentor \((k,l)\)-chromatic number. Zbl 1046.05033
Pyatkin, A. V.
2
2003
NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes. Zbl 1452.68084
Kel’manov, A. V.; Pyatkin, A. V.; Khandeev, V. I.
1
2019
Maximum diversity problem with squared Euclidean distance. Zbl 1446.90160
Eremeev, Anton V.; Kel’manov, Alexander V.; Kovalyov, Mikhail Y.; Pyatkin, Artem V.
1
2019
The maximum number of induced open triangles in graphs of a given order. Zbl 1432.90134
Pyatkin, Artem; Lykhovyd, Eugene; Butenko, Sergiy
1
2019
On \(k\)-\(11\)-representable graphs. Zbl 1411.05188
Cheon, Gi-Sang; Kim, Jinha; Kim, Minki; Kitaev, Sergey; Pyatkin, Artem
1
2019
Word-representable graphs: a survey. Zbl 1413.05264
Kitaev, S. V.; Pyatkin, A. V.
1
2018
On the representation number of a crown graph. Zbl 1387.05169
Glen, Marc; Kitaev, Sergey; Pyatkin, Artem
1
2018
Representing graphs via pattern avoiding words. Zbl 1319.05092
Jones, Miles; Kitaev, Sergey; Pyatkin, Artem; Remmel, Jeffrey
1
2015
The open shop problem with routing at a two-node network and allowed preemption. Zbl 1324.90020
Pyatkin, A. V.; Chernykh, I. D.
1
2012
On square-free permutations. Zbl 1345.68243
Avgustinovich, Sergey; Kitaev, Sergey; Pyatkin, Artem; Valyuzhenich, Alexander
1
2011
On a variant of the problem of choosing a vector subset. Zbl 1249.90343
Kel’manov, A. V.; Pyatkin, A. V.
1
2008
Subdivided trees are integral sum graphs. Zbl 1144.05058
Pyatkin, A. V.
1
2008
On list incidentor coloring of a multigraph of degree 3. Zbl 1249.05134
Pyatkin, A. V.
1
2007
Incidentor coloring of weighted multigraphs. Zbl 1293.05153
Vizing, Vadym G.; Pyatkin, Artem V.
1
2006
On maximum number of minimal dominating sets in graphs. Zbl 1200.05158
Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem V.; Stepanov, Alexey A.
1
2005
On 4-chromatic edge-critical regular graphs of high connectivity. Zbl 1008.05063
Dobrynin, Andrey A.; Melnikov, Leonid S.; Pyatkin, Artem V.
1
2003
Radio labeling with pre-assigned frequencies. Zbl 1020.05062
Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor V.; Pyatkin, Artem V.; Woeginger, Gerhard J.
1
2002
Bilevel assignment problem. Zbl 1025.90013
Larin, R. M.; Pyatkin, A. V.
1
2001
The incidentor coloring of multigraphs and its application in data networks. Zbl 1072.05530
Pyatkin, A. V.
1
1999
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\). Zbl 0958.05057
Pyatkin, A. V.
1
1998
NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes. Zbl 1452.68084
Kel’manov, A. V.; Pyatkin, A. V.; Khandeev, V. I.
1
2019
Maximum diversity problem with squared Euclidean distance. Zbl 1446.90160
Eremeev, Anton V.; Kel’manov, Alexander V.; Kovalyov, Mikhail Y.; Pyatkin, Artem V.
1
2019
The maximum number of induced open triangles in graphs of a given order. Zbl 1432.90134
Pyatkin, Artem; Lykhovyd, Eugene; Butenko, Sergiy
1
2019
On \(k\)-\(11\)-representable graphs. Zbl 1411.05188
Cheon, Gi-Sang; Kim, Jinha; Kim, Minki; Kitaev, Sergey; Pyatkin, Artem
1
2019
Word-representable graphs: a survey. Zbl 1413.05264
Kitaev, S. V.; Pyatkin, A. V.
1
2018
On the representation number of a crown graph. Zbl 1387.05169
Glen, Marc; Kitaev, Sergey; Pyatkin, Artem
1
2018
Semi-transitive orientations and word-representable graphs. Zbl 1329.05217
Halldórsson, Magnús M.; Kitaev, Sergey; Pyatkin, Artem
8
2016
On the complexity of some quadratic Euclidean 2-clustering problems. Zbl 1362.68092
Kel’manov, A. V.; Pyatkin, Artem V.
6
2016
Completing partial schedules for open shop with unit processing times and routing. Zbl 06605920
van Bevern, René; Pyatkin, Artem V.
3
2016
On the complexity of some Euclidean optimal summing problems. Zbl 1348.90653
Eremeev, A. V.; Kel’manov, A. V.; Pyatkin, Artem V.
2
2016
NP-hardness of some quadratic Euclidean 2-clustering problems. Zbl 1335.68096
Kel’manov, A. V.; Pyatkin, A. V.
6
2015
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph. Zbl 1319.05125
Gimadi, E. Kh.; Kel’manov, A. V.; Pyatkin, A. V.; Khachai, M. Yu.
3
2015
Representing graphs via pattern avoiding words. Zbl 1319.05092
Jones, Miles; Kitaev, Sergey; Pyatkin, Artem; Remmel, Jeffrey
1
2015
On toughness and Hamiltonicity of \(2K_{2}\)-free graphs. Zbl 1292.05162
Broersma, Hajo; Patel, Viresh; Pyatkin, Artem
8
2014
NP-hardness of the Euclidean Max-Cut problem. Zbl 1307.90212
Ageev, A. A.; Kel’manov, A. V.; Pyatkin, A. V.
5
2014
2-approximation algorithm for finding a clique with minimum weight of vertices and edges. Zbl 1302.90175
Eremin, I. I.; Gimadi, E. K.; Kel’manov, A. V.; Pyatkin, A. V.; Khachai, M. Yu.
4
2014
Complexity of the weighted max-cut in Euclidean space. Zbl 1324.05188
Ageev, A. A.; Kel’manov, A. V.; Pyatkin, A. V.
2
2014
On complexity of some problems of cluster analysis of vector sequences. Zbl 1324.68047
Kel’manov, A. V.; Pyatkin, A. V.
11
2013
Triangle-free \(2P_3\)-free graphs are 4-colorable. Zbl 1259.05066
Pyatkin, Artem V.
3
2013
Colorings with few colors: counting, enumeration and combinatorial bounds. Zbl 1269.05034
Couturier, Jean-Francois; Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Pyatkin, Artem
2
2013
On the complexity of certain problems of choosing subset of vectors. Zbl 1274.90251
Kel’manov, A. V.; Pyatkin, A. V.
2
2012
The open shop problem with routing at a two-node network and allowed preemption. Zbl 1324.90020
Pyatkin, A. V.; Chernykh, I. D.
1
2012
Alternation graphs. Zbl 1341.05243
Halldórsson, Magnús M.; Kitaev, Sergey; Pyatkin, Artem
7
2011
The complexity status of problems related to sparsest cuts. Zbl 1326.68145
Bonsma, Paul; Broersma, Hajo; Patel, Viresh; Pyatkin, Artem
2
2011
On square-free permutations. Zbl 1345.68243
Avgustinovich, Sergey; Kitaev, Sergey; Pyatkin, Artem; Valyuzhenich, Alexander
1
2011
Graphs capturing alternations in words. Zbl 1250.68219
Halldórsson, Magnús M.; Kitaev, Sergey; Pyatkin, Artem
8
2010
NP-completeness of some problems of a vectors subset choice. Zbl 1249.68080
Kel’manov, A. V.; Pyatkin, A. V.
6
2010
On avoidance of V- and \(\Lambda \)-patterns in permutations. Zbl 1249.05004
Kitaev, Sergey; Pyatkin, Artem
2
2010
Complexity of certain problems of searching for subsets of vectors and cluster analysis. Zbl 1224.68120
Kel’manov, A. V.; Pyatkin, A. V.
15
2009
On complexity of the problem of choosing a vector subset with maximal sum length. Zbl 1249.68083
Pyatkin, A. V.
2
2009
A 2-approximation algorithm for the metric 2-peripatetic salesman problem. Zbl 1249.90296
Ageev, A. A.; Pyatkin, A. V.
2
2009
Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. Zbl 1445.05101
Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem V.; Stepanov, Alexey A.
36
2008
On the minimum feedback vertex set problem: Exact and enumeration algorithms. Zbl 1170.68029
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.; Razgon, Igor
36
2008
On the complexity of a search for a subset of “similar” vectors. Zbl 1217.90142
Kel’manov, A. V.; Pyatkin, A. V.
16
2008
On representable graphs. Zbl 1171.05372
Kitaev, Sergey; Pyatkin, Artem
13
2008
On polynomial solvability of some problems of choosing a vector subset in a Euclidean space of fixed dimension. Zbl 1249.90342
Gimadi, Eh. Kh.; Pyatkin, A. V.; Rykov, I. A.
6
2008
A 2-approximation algorithm for the metric 2-peripatetic salesman problem. Zbl 1130.90386
Ageev, Alexander A.; Pyatkin, Artem V.
2
2008
On a variant of the problem of choosing a vector subset. Zbl 1249.90343
Kel’manov, A. V.; Pyatkin, A. V.
1
2008
Subdivided trees are integral sum graphs. Zbl 1144.05058
Pyatkin, A. V.
1
2008
The problem of finding a subset of vectors with maximal total weight. Zbl 1249.90211
Baburin, A. E.; Gimadi, Eh. Kh.; Glebov, N. I.; Pyatkin, A. V.
13
2007
On list incidentor coloring of a multigraph of degree 3. Zbl 1249.05134
Pyatkin, A. V.
1
2007
Finding a minimum feedback vertex set in time \(\mathcal{O} (1.7548^n)\). Zbl 1154.05327
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.
10
2006
Polynomial algorithms for solving the vector sum problem. Zbl 1249.90212
Baburin, A. E.; Pyatkin, A. V.
4
2006
On the coloring of incidentors in an oriented weighted multigraph. Zbl 1249.05254
Vizing, V. G.; Pyatkin, A. V.
2
2006
Incidentor coloring of weighted multigraphs. Zbl 1293.05153
Vizing, Vadym G.; Pyatkin, Artem V.
1
2006
Bounding the number of minimal dominating sets: A measure and conquer approach. Zbl 1175.05100
Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem V.; Stepanov, Alexey A.
9
2005
On maximum number of minimal dominating sets in graphs. Zbl 1200.05158
Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem V.; Stepanov, Alexey A.
1
2005
Interval coloring of \((3,4)\)-biregular bipartite graphs having large cubic subgraphs. Zbl 1055.05064
Pyatkin, A. V.
20
2004
On \((1,1)\)-coloring of incidentors of multigraphs of degree 4. Zbl 1078.05033
Pyatkin, A. V.
3
2004
Upper and lower estimates of the incidentor \((k,l)\)-chromatic number. Zbl 1045.05043
Pyatkin, A. V.
3
2004
Radio labeling with preassigned frequencies. Zbl 1071.05033
Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor V.; Pyatkin, Artem V.; Woeginger, Gerhard J.
2
2004
Some upper bounds for the incidentor \((k,l)\)-chromatic number. Zbl 1046.05033
Pyatkin, A. V.
2
2003
On 4-chromatic edge-critical regular graphs of high connectivity. Zbl 1008.05063
Dobrynin, Andrey A.; Melnikov, Leonid S.; Pyatkin, Artem V.
1
2003
Regular integral sum graphs. Zbl 1039.05053
Melnikov, L. S.; Pyatkin, A. V.
5
2002
Radio labeling with pre-assigned frequencies. Zbl 1020.05062
Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor V.; Pyatkin, Artem V.; Woeginger, Gerhard J.
1
2002
New formula for the sum number for the complete bipartite graphs. Zbl 0993.05130
Pyatkin, A. V.
6
2001
Bilevel assignment problem. Zbl 1025.90013
Larin, R. M.; Pyatkin, A. V.
1
2001
On the \((k,l)\)-coloring of incidentors. Zbl 0956.05037
Vizing, V. G.; Mel’nikov, L. S.; Pyatkin, A. V.
3
2000
The incidentor coloring of multigraphs and its application in data networks. Zbl 1072.05530
Pyatkin, A. V.
1
1999
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\). Zbl 0958.05057
Pyatkin, A. V.
1
1998
Some optimization problems of scheduling the transmission of messages in a local communication network. Zbl 0860.90054
Pyatkin, A. V.
5
1995
all top 5

Cited by 284 Authors

30 Kel’manov, Aleksandr Vasil’evich
26 Pyatkin, Artem V.
21 Kratsch, Dieter
14 Golovach, Petr A.
13 Kitaev, Sergey
12 Liedloff, Mathieu
11 Fomin, Fedor V.
11 Khandeev, V. I.
9 Heggernes, Pinar
8 Gaspers, Serge
8 Khamidullin, Sergeĭ Asgadullovich
8 Saurabh, Saket
7 Casselgren, Carl Johan
7 Shenmaier, V. V.
5 Couturier, Jean-Francois
5 Fernau, Henning
5 Koivisto, Mikko
5 Petrosyan, Petros A.
5 Sayadi, Mohamed Yosri
5 Villanger, Yngve
4 Gimadi, Edward Khairutdinovich
4 Hertz, Alain
4 Kaski, Petteri
4 Liu, Tian
4 Lokshtanov, Daniel
4 Xu, Ke
3 Altinakar, Sivan
3 Asratian, Armen S.
3 Björklund, Andreas
3 Bodlaender, Hans L.
3 Borowiecka-Olszewska, Marta
3 Caporossi, Gilles
3 Chen, Jian-er
3 Drgas-Burchardt, Ewa
3 Grandoni, Fabrizio
3 Husfeldt, Thore
3 Kawarabayashi, Ken-ichi
3 Khandeev, Vladimir
3 Motkova, A. V.
3 Paulusma, Daniël
3 Raman, Venkatesh
3 Thilikos, Dimitrios M.
3 Toft, Bjarne
3 Tripathi, Amitabha
3 van Rooij, Johan M. M.
3 Xiao, Mingyu
2 Ageev, Aleksandr Aleksandrovich
2 Bazgan, Cristina
2 Branković, Ljiljana
2 Broersma, Hajo J.
2 Casel, Katrin
2 Chen, Herman Z. Q.
2 Dou, Wenqing
2 Dusart, Jérémie
2 Eremeev, Anton Valentinovich
2 Glebov, Alekseĭ Nikolaevich
2 Golumbic, Martin Charles
2 Halldórsson, Magnús Mar
2 Jansen, Klaus
2 Jiang, Wei
2 Kakimura, Naonori
2 Kanté, Mamadou Moustapha
2 Khachatrian, Hrant H.
2 Khachay, Mikhail Yur’evich
2 Kim, Jinha
2 Kim, Minki
2 Klein, Kim-Manuel
2 Kobayashi, Yusuke
2 Koutsonas, Athanassios
2 Kratochvíl, Jan
2 Lampis, Michael
2 Li, Huan
2 Liu, Yang
2 Lu, Min
2 Lu, Zhao
2 Mathew, Rogers
2 Mikhaĭlova, Lyudmila Viktorovna
2 Mnich, Matthias
2 Monnot, Jérôme
2 Nagamochi, Hiroshi
2 Panasenko, Anna
2 Paschos, Vangelis Th.
2 Pilipczuk, Michał
2 Rajendraprasad, Deepak
2 Romanchenko, S. M.
2 Saei, Reza
2 Saito, Akira
2 Shan, Songling
2 Sun, Brian Yi
2 Tiwari, Apurv
2 Tsidulko, Oxana Yu.
2 van Bevern, René A.
2 van Dijk, Thomas C.
2 van ’t Hof, Pim
2 Vizing, Vadym Georgiĭovych
2 Zhang, Zhongzhi
2 Ziedan, Emile
1 Abu-Khzam, Faisal N.
1 Adamson, Duncan
1 Akgün, Özgür
...and 184 more Authors
all top 5

Cited in 43 Serials

21 Discrete Applied Mathematics
16 Theoretical Computer Science
16 Algorithmica
15 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
14 Discrete Mathematics
12 Computational Mathematics and Mathematical Physics
7 Journal of Graph Theory
6 Information Processing Letters
6 Doklady Mathematics
5 Graphs and Combinatorics
5 Journal of Combinatorial Optimization
5 Proceedings of the Steklov Institute of Mathematics
3 Journal of Computer and System Sciences
3 Computers & Operations Research
3 The Electronic Journal of Combinatorics
3 Discussiones Mathematicae. Graph Theory
3 Theory of Computing Systems
3 Journal of Discrete Algorithms
2 European Journal of Combinatorics
2 Applied Mathematics Letters
2 SIAM Journal on Discrete Mathematics
2 Automation and Remote Control
2 Journal of Graph Algorithms and Applications
1 Czechoslovak Mathematical Journal
1 Journal of Combinatorial Theory. Series B
1 SIAM Journal on Computing
1 Annals of Pure and Applied Logic
1 Order
1 Information and Computation
1 Siberian Advances in Mathematics
1 Journal of Global Optimization
1 Cybernetics and Systems Analysis
1 Annals of Mathematics and Artificial Intelligence
1 Journal of Scheduling
1 Journal of Integer Sequences
1 Optimization and Engineering
1 Integers
1 Journal of Applied Mathematics and Computing
1 Discrete Optimization
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 European Journal of Pure and Applied Mathematics
1 Discrete Mathematics, Algorithms and Applications
1 Prikladnaya Diskretnaya Matematika

Citations by Year