×

Lobstein, Antoine-Christophe

Author ID: lobstein.antoine-christophe Recent zbMATH articles by "Lobstein, Antoine-Christophe"
Published as: Lobstein, Antoine; Lobstein, Antoine C.; Lobstein, A. C.; Lobstein, A.; Lobstein, Antoine-Christophe
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

61 Publications have been cited 855 times in 405 Documents Cited by Year
Covering codes. Zbl 0874.94001
Cohen, Gérard; Honkala, Iiro; Litsyn, Simon; Lobstein, Antoine
159
1997
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Zbl 1044.68066
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
77
2003
Identifying and locating-dominating codes on chains and cycles. Zbl 1053.05095
Bertrand, Nathalie; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
61
2004
Extremal cardinalities for identifying and locating-dominating codes in graphs. Zbl 1113.05075
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
39
2007
Further results on the covering radius of codes. Zbl 0618.94014
Cohen, Gerard D.; Lobstein, Antoine C.; Sloane, N. J. A.
38
1986
Identifying codes with small radius in some infinite regular graphs. Zbl 0985.05033
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
34
2002
On identifying codes. Zbl 0990.94036
Cohen, Gérard D.; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
26
2001
Identifying and locating-dominating codes: NP-completeness results for directed graphs. Zbl 1062.94056
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
26
2002
Bounds for codes identifying vertices in the hexagonal grid. Zbl 0961.05036
Cohen, Gérard D.; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
23
2000
On identifying codes in binary Hamming spaces. Zbl 1005.94030
Honkala, Iiro; Lobstein, Antoine
23
2002
The minimum density of an identifying code in the king lattice. Zbl 1037.05018
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
22
2004
On codes identifying vertices in the two-dimensional square lattice with diagonals. Zbl 1312.68157
Cohen, Gérard D.; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
22
2001
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity. Zbl 1180.05055
Charbit, Emmanuel; Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
21
2008
General bounds for identifying codes in some infinite regular graphs. Zbl 0990.05074
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
20
2001
1-identifying codes on trees. Zbl 1081.94039
Bertrand, Nathalie; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
19
2005
New identifying codes in the binary Hamming space. Zbl 1198.94175
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
16
2010
Structural properties of twin-free graphs. Zbl 1113.05085
Charon, Iréne; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
14
2007
New bounds for codes identifying vertices in graphs. Zbl 0917.05058
Cohen, Gérard; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
14
1999
A linear algorithm for minimum 1-identifying codes in oriented trees. Zbl 1103.68130
Charon, Irène; Gravier, Sylvain; Hudry, Olivier; Lobstein, Antoine; Mollard, Michel; Moncel, Julien
14
2006
On the density of identifying codes in the square lattice. Zbl 1027.94036
Honkala, Iiro; Lobstein, Antoine
13
2002
Watching systems in graphs: an extension of identifying codes. Zbl 1287.05142
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
13
2013
Algorithmic complexity and communication problems. (Complexité algorithmique et problèmes de communications. Préface de M. Minoux.) Zbl 0765.68005
Barthélemy, J.-P.; Cohen, G.; Lobstein, A.
12
1992
Covering radius 1985-1994. Zbl 0873.94025
Cohen, G. D.; Litsyn, S. N.; Lobstein, A. C.; Mattson, H. F. jun.
11
1997
Discriminating codes in (bipartite) planar graphs. Zbl 1143.94024
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
10
2008
Complexity results for identifying codes in planar graphs. Zbl 1219.05178
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
10
2010
On the complexity of the identification problem in Hamming spaces. Zbl 1034.68043
Honkala, Iiro; Lobstein, Antoine
8
2002
More results on the complexity of identifying problems in graphs. Zbl 1336.68130
Hudry, Olivier; Lobstein, Antoine
7
2016
On the ensemble of optimal dominating and locating-dominating codes in a graph. Zbl 1329.05234
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
7
2015
Intersection matrices for partitions by binary perfect codes. Zbl 1017.94019
Avgustinovich, Sergey V.; Lobstein, Antoine C.; Solov’eva, Faina I.
7
2001
On generalized concatenated constructions of perfect binary nonlinear codes. Zbl 1004.94033
Zinoviev, V. A.; Lobstein, A. C.
6
2000
On normal and subnormal q-ary codes. Zbl 0695.94017
Lobstein, Antoine C.; Van Wee, Gerhard J. M.
6
1989
On identification in \(\mathbb Z^2\) using translates of given patterns. Zbl 1312.68026
Honkala, Iiro; Lobstein, Antoine
6
2003
Maximum size of a minimum watching system and the graphs achieving the bound. Zbl 1321.05136
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
6
2014
On the number of optimal identifying codes in a twin-free graph. Zbl 1303.05138
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
6
2015
Adaptive identification in graphs. Zbl 1183.94063
Ben-Haim, Yael; Gravier, Sylvain; Lobstein, Antoine; Moncel, Julien
6
2008
Correction to “On normal and subnormal q-ary codes”. Zbl 0714.94017
Lobstein, Antoine C.; van Wee, Gerhard J. M.
5
1990
Minimum sizes of identifying codes in graphs differing by one vertex. Zbl 1335.94099
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
5
2013
Possible cardinalities for locating-dominating codes in graphs. Zbl 1101.05045
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
4
2006
Possible cardinalities for identifying codes in graphs. Zbl 1114.94021
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
4
2005
Adaptive identification in Torii in the King lattice. Zbl 1217.05217
Ben-Haim, Yael; Gravier, Sylvain; Lobstein, Antoine; Moncel, Julien
4
2011
On the ensemble of optimal identifying codes in a twin-free graph. Zbl 1333.05222
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
4
2016
Unique (optimal) solutions: complexity results for identifying and locating-dominating codes. Zbl 1417.68069
Hudry, Olivier; Lobstein, Antoine
3
2019
On the structure of identifiable graphs. Zbl 1200.05188
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
2
2005
Links between discriminating and identifying codes in the binary Hamming space. Zbl 1195.94081
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
2
2007
On Plotkin-Elias type bounds for binary arithmetic codes. Zbl 0949.94520
Kabatianski, G.; Lobstein, A.
2
1994
The hardness of solving subset sum with preprocessing. Zbl 0707.94018
Lobstein, Antoine
2
1990
Minimum sizes of identifying codes in graphs differing by one edge. Zbl 1294.94111
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
2
2014
On a conjecture concerning coverings of hamming space. Zbl 0653.05017
Cohen, G. D.; Lobstein, A. C.; Sloane, N. J. A.
1
1986
Arithmetic codes – Survey, recent and new results. Zbl 0766.94020
Lobstein, Antoine C.; Solé, Patrick
1
1991
Extremal values for identification, domination and maximum cliques in twin-free graphs. Zbl 1265.05451
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2011
On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case. Zbl 1232.05083
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2010
The length function: a revised table. Zbl 0949.94529
Lobstein, A.; Pless, V.
1
1994
Constructions of perfect binary nonlinear codes. Zbl 0986.94040
Zinoviev, V. A.; Lobstein, A. C.
1
1998
On the sizes of graphs and their powers: the undirected case. Zbl 1228.05247
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2011
Erratum to “Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs”. Zbl 1193.05157
Auger, David; Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
1
2009
Recouvrements d’espaces de Hamming binaires. (Coverings of binary Hamming spaces). Zbl 0607.94013
Lobstein, Antoine; Cohen, Gérard; Sloane, Neil J. A.
1
1985
On new perfect binary nonlinear codes. Zbl 0887.94013
Lobstein, A. C.; Zinoviev, V. A.
1
1997
The compared costs of domination location-domination and identification. Zbl 1498.05208
Hudry, Olivier; Lobstein, Antoine
1
2020
Complexity of unique (optimal) solutions in graphs: vertex cover and domination. Zbl 1473.68120
Hudry, Olivier; Lobstein, Antoine
1
2019
Extremal values for the maximum degree in a twin-free graph. Zbl 1289.05116
Charon, Iréne; Hudry, Olivier; Lobstein, Antoine
1
2012
More results on the complexity of domination problems in graphs. Zbl 1407.68191
Hudry, Olivier; Lobstein, Antoine
1
2017
The compared costs of domination location-domination and identification. Zbl 1498.05208
Hudry, Olivier; Lobstein, Antoine
1
2020
Unique (optimal) solutions: complexity results for identifying and locating-dominating codes. Zbl 1417.68069
Hudry, Olivier; Lobstein, Antoine
3
2019
Complexity of unique (optimal) solutions in graphs: vertex cover and domination. Zbl 1473.68120
Hudry, Olivier; Lobstein, Antoine
1
2019
More results on the complexity of domination problems in graphs. Zbl 1407.68191
Hudry, Olivier; Lobstein, Antoine
1
2017
More results on the complexity of identifying problems in graphs. Zbl 1336.68130
Hudry, Olivier; Lobstein, Antoine
7
2016
On the ensemble of optimal identifying codes in a twin-free graph. Zbl 1333.05222
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
4
2016
On the ensemble of optimal dominating and locating-dominating codes in a graph. Zbl 1329.05234
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
7
2015
On the number of optimal identifying codes in a twin-free graph. Zbl 1303.05138
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
6
2015
Maximum size of a minimum watching system and the graphs achieving the bound. Zbl 1321.05136
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
6
2014
Minimum sizes of identifying codes in graphs differing by one edge. Zbl 1294.94111
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
2
2014
Watching systems in graphs: an extension of identifying codes. Zbl 1287.05142
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
13
2013
Minimum sizes of identifying codes in graphs differing by one vertex. Zbl 1335.94099
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
5
2013
Extremal values for the maximum degree in a twin-free graph. Zbl 1289.05116
Charon, Iréne; Hudry, Olivier; Lobstein, Antoine
1
2012
Adaptive identification in Torii in the King lattice. Zbl 1217.05217
Ben-Haim, Yael; Gravier, Sylvain; Lobstein, Antoine; Moncel, Julien
4
2011
Extremal values for identification, domination and maximum cliques in twin-free graphs. Zbl 1265.05451
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2011
On the sizes of graphs and their powers: the undirected case. Zbl 1228.05247
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2011
New identifying codes in the binary Hamming space. Zbl 1198.94175
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
16
2010
Complexity results for identifying codes in planar graphs. Zbl 1219.05178
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
10
2010
On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case. Zbl 1232.05083
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2010
Erratum to “Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs”. Zbl 1193.05157
Auger, David; Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
1
2009
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity. Zbl 1180.05055
Charbit, Emmanuel; Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
21
2008
Discriminating codes in (bipartite) planar graphs. Zbl 1143.94024
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
10
2008
Adaptive identification in graphs. Zbl 1183.94063
Ben-Haim, Yael; Gravier, Sylvain; Lobstein, Antoine; Moncel, Julien
6
2008
Extremal cardinalities for identifying and locating-dominating codes in graphs. Zbl 1113.05075
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
39
2007
Structural properties of twin-free graphs. Zbl 1113.05085
Charon, Iréne; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
14
2007
Links between discriminating and identifying codes in the binary Hamming space. Zbl 1195.94081
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
2
2007
A linear algorithm for minimum 1-identifying codes in oriented trees. Zbl 1103.68130
Charon, Irène; Gravier, Sylvain; Hudry, Olivier; Lobstein, Antoine; Mollard, Michel; Moncel, Julien
14
2006
Possible cardinalities for locating-dominating codes in graphs. Zbl 1101.05045
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
4
2006
1-identifying codes on trees. Zbl 1081.94039
Bertrand, Nathalie; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
19
2005
Possible cardinalities for identifying codes in graphs. Zbl 1114.94021
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
4
2005
On the structure of identifiable graphs. Zbl 1200.05188
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
2
2005
Identifying and locating-dominating codes on chains and cycles. Zbl 1053.05095
Bertrand, Nathalie; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
61
2004
The minimum density of an identifying code in the king lattice. Zbl 1037.05018
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
22
2004
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Zbl 1044.68066
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
77
2003
On identification in \(\mathbb Z^2\) using translates of given patterns. Zbl 1312.68026
Honkala, Iiro; Lobstein, Antoine
6
2003
Identifying codes with small radius in some infinite regular graphs. Zbl 0985.05033
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
34
2002
Identifying and locating-dominating codes: NP-completeness results for directed graphs. Zbl 1062.94056
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
26
2002
On identifying codes in binary Hamming spaces. Zbl 1005.94030
Honkala, Iiro; Lobstein, Antoine
23
2002
On the density of identifying codes in the square lattice. Zbl 1027.94036
Honkala, Iiro; Lobstein, Antoine
13
2002
On the complexity of the identification problem in Hamming spaces. Zbl 1034.68043
Honkala, Iiro; Lobstein, Antoine
8
2002
On identifying codes. Zbl 0990.94036
Cohen, Gérard D.; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
26
2001
On codes identifying vertices in the two-dimensional square lattice with diagonals. Zbl 1312.68157
Cohen, Gérard D.; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
22
2001
General bounds for identifying codes in some infinite regular graphs. Zbl 0990.05074
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
20
2001
Intersection matrices for partitions by binary perfect codes. Zbl 1017.94019
Avgustinovich, Sergey V.; Lobstein, Antoine C.; Solov’eva, Faina I.
7
2001
Bounds for codes identifying vertices in the hexagonal grid. Zbl 0961.05036
Cohen, Gérard D.; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
23
2000
On generalized concatenated constructions of perfect binary nonlinear codes. Zbl 1004.94033
Zinoviev, V. A.; Lobstein, A. C.
6
2000
New bounds for codes identifying vertices in graphs. Zbl 0917.05058
Cohen, Gérard; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
14
1999
Constructions of perfect binary nonlinear codes. Zbl 0986.94040
Zinoviev, V. A.; Lobstein, A. C.
1
1998
Covering codes. Zbl 0874.94001
Cohen, Gérard; Honkala, Iiro; Litsyn, Simon; Lobstein, Antoine
159
1997
Covering radius 1985-1994. Zbl 0873.94025
Cohen, G. D.; Litsyn, S. N.; Lobstein, A. C.; Mattson, H. F. jun.
11
1997
On new perfect binary nonlinear codes. Zbl 0887.94013
Lobstein, A. C.; Zinoviev, V. A.
1
1997
On Plotkin-Elias type bounds for binary arithmetic codes. Zbl 0949.94520
Kabatianski, G.; Lobstein, A.
2
1994
The length function: a revised table. Zbl 0949.94529
Lobstein, A.; Pless, V.
1
1994
Algorithmic complexity and communication problems. (Complexité algorithmique et problèmes de communications. Préface de M. Minoux.) Zbl 0765.68005
Barthélemy, J.-P.; Cohen, G.; Lobstein, A.
12
1992
Arithmetic codes – Survey, recent and new results. Zbl 0766.94020
Lobstein, Antoine C.; Solé, Patrick
1
1991
Correction to “On normal and subnormal q-ary codes”. Zbl 0714.94017
Lobstein, Antoine C.; van Wee, Gerhard J. M.
5
1990
The hardness of solving subset sum with preprocessing. Zbl 0707.94018
Lobstein, Antoine
2
1990
On normal and subnormal q-ary codes. Zbl 0695.94017
Lobstein, Antoine C.; Van Wee, Gerhard J. M.
6
1989
Further results on the covering radius of codes. Zbl 0618.94014
Cohen, Gerard D.; Lobstein, Antoine C.; Sloane, N. J. A.
38
1986
On a conjecture concerning coverings of hamming space. Zbl 0653.05017
Cohen, G. D.; Lobstein, A. C.; Sloane, N. J. A.
1
1986
Recouvrements d’espaces de Hamming binaires. (Coverings of binary Hamming spaces). Zbl 0607.94013
Lobstein, Antoine; Cohen, Gérard; Sloane, Neil J. A.
1
1985
all top 5

Cited by 516 Authors

30 Hudry, Olivier
29 Laihonen, Tero K.
28 Honkala, Iiro S.
28 Lobstein, Antoine-Christophe
25 Foucaud, Florent
20 Parreau, Aline
18 Charon, Irène
14 Junnila, Ville
13 Gravier, Sylvain
10 Davydov, Alexander A.
10 Marcugini, Stefano
10 Pambianco, Fernanda
9 Auger, David
9 Östergård, Patric R. J.
8 Bartoli, Daniele
8 Lehtilä, Tuomo
8 Mollard, Michel
8 Wagler, Annegret Katrin
7 Argiroffo, Gabriela R.
7 Cohen, Gérard Denis
7 Monte Carmelo, Emerson L.
7 Naserasr, Reza
7 Seo, Suk Jai
6 Bianchi, Silvia M.
6 Mesnager, Sihem
6 Moncel, Julien
6 Solov’eva, Faina Ivanovna
6 Valicov, Petru
5 Giulietti, Massimo
5 Havet, Frédéric
5 Lucarini, Yanina P.
5 Ranto, Sanna Maarit
5 Wang, Qichun
5 Zinov’ev, Viktor Aleksandrovich
4 Balbuena, Camino
4 Dey, Sanjana
4 Exoo, Geoffrey
4 Haas, Wolfgang
4 Litsyn, Simon N.
4 Pelto, Mikko
4 Slater, Peter James
4 Sloane, Neil James Alexander
4 Solé, Patrick
4 Zinov’ev, Dmitriĭ Viktorovich
3 Bellitto, Thomas
3 Byrne, Eimear
3 Dantas, Rennan
3 Dorbec, Paul
3 Fazil, Muhammad
3 Ghorbani, Modjtaba
3 Habsieger, Laurent
3 Helleseth, Tor
3 Hernando, Carmen
3 Javaid, Imran
3 Jayagopal, R.
3 Jean, Devin C.
3 Kéri, Gerzson
3 Klasing, Ralf
3 Kovše, Matjaž
3 Krotov, Denis S.
3 Maddah, Sheyda
3 Maimani, Hamidreza
3 Mertzios, George B.
3 Mora, Mercè
3 Patkós, Balázs
3 Pelayo, Ignacio M.
3 Qi, Yanfeng
3 Rajan, R. Sundara
3 Rajasingh, Indra
3 Roozbayani, Maryam
3 Sampaio, Rudini Menezes
3 Tang, Chunming
3 Yu, Gexin
3 Zhou, Zhengchun
2 Avgustinovich, Sergeĭ Vladimirovich
2 Barbero, Florian
2 Bazgan, Cristina
2 Beivide, Ramón
2 Bezzateev, Sergei Valentinovich
2 Bhandari, Mahesh Chandra
2 Borello, Martino
2 Bousquet, Nicolas
2 Camarero, Cristóbal
2 Castoldi, André Guerino
2 Chen, Lusheng
2 Dalfó, Cristina
2 Dehmer, Matthias
2 Dev, Subhadeep Ranjan
2 Dhanalakshmi, R.
2 Faina, Giorgio
2 Fan, Cuiling
2 Feng, Min
2 Fernau, Henning
2 Gadouleau, Maximilien
2 Hämäläinen, Heikki O.
2 Hayat, Sakander
2 Heden, Olof
2 Isenmann, Lucas
2 Kaikkonen, Markku K.
2 Karpovsky, Mark G.
...and 416 more Authors
all top 5

Cited in 86 Serials

50 Discrete Applied Mathematics
37 Discrete Mathematics
25 Designs, Codes and Cryptography
21 European Journal of Combinatorics
16 Journal of Combinatorial Theory. Series A
16 Theoretical Computer Science
13 Advances in Mathematics of Communications
13 Cryptography and Communications
10 Problems of Information Transmission
9 Information Processing Letters
8 Graphs and Combinatorics
7 Applied Mathematics and Computation
7 SIAM Journal on Discrete Mathematics
7 Discrete Mathematics, Algorithms and Applications
6 The Electronic Journal of Combinatorics
6 Discussiones Mathematicae. Graph Theory
5 Applicable Algebra in Engineering, Communication and Computing
5 Finite Fields and their Applications
4 Algorithmica
4 Journal of Combinatorial Designs
3 Advances in Applied Mathematics
3 Information and Computation
3 International Transactions in Operational Research
3 Journal of Discrete Mathematical Sciences & Cryptography
3 Prikladnaya Diskretnaya Matematika
2 Indian Journal of Pure & Applied Mathematics
2 Journal of Combinatorial Theory. Series B
2 Journal of Number Theory
2 Networks
2 Mathematical Social Sciences
2 SIAM Journal on Algebraic and Discrete Methods
2 Annals of Operations Research
2 The Australasian Journal of Combinatorics
2 Journal of Algebraic Combinatorics
2 Complexity
2 Quantum Information Processing
2 Journal of Discrete Algorithms
2 Sibirskie Èlektronnye Matematicheskie Izvestiya
2 Ars Mathematica Contemporanea
2 Electronic Journal of Graph Theory and Applications
1 Linear and Multilinear Algebra
1 Periodica Mathematica Hungarica
1 Ukrainian Mathematical Journal
1 Mathematics of Computation
1 Annali di Matematica Pura ed Applicata. Serie Quarta
1 Information Sciences
1 Journal of Algebra
1 Journal of Computer and System Sciences
1 Journal of Geometry
1 Journal of Graph Theory
1 Kybernetika
1 SIAM Journal on Computing
1 Bulletin of the Korean Mathematical Society
1 Journal of Symbolic Computation
1 Discrete & Computational Geometry
1 Forum Mathematicum
1 European Journal of Operational Research
1 Computational Statistics and Data Analysis
1 Computational Complexity
1 Journal de Théorie des Nombres de Bordeaux
1 Combinatorics, Probability and Computing
1 Computational and Applied Mathematics
1 Theory of Computing Systems
1 Nonlinear Dynamics
1 Journal of Combinatorial Optimization
1 Discrete Dynamics in Nature and Society
1 RAIRO. Operations Research
1 Integers
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Journal of Applied Mathematics and Computing
1 4OR
1 Hacettepe Journal of Mathematics and Statistics
1 Discrete Optimization
1 European Series in Applied and Industrial Mathematics (ESAIM): Mathematical Modelling and Numerical Analysis
1 Contributions to Discrete Mathematics
1 Journal of the Korean Statistical Society
1 Journal of Mathematical Inequalities
1 Foundations and Trends in Communications and Information Theory
1 RAIRO. Theoretical Informatics and Applications
1 Symmetry
1 Transactions on Combinatorics
1 Journal of Mathematics
1 ISRN Combinatorics
1 International Journal of Applied and Computational Mathematics
1 SIAM Journal on Applied Algebra and Geometry
1 Journal of the Iranian Mathematical Society

Citations by Year