×
Compute Distance To:
Author ID: poljak.svatopluk Recent zbMATH articles by "Poljak, Svatopluk"
Published as: Poljak, Svatopluk; Poljak, S.; Poljak, Svatoplukk
External Links: MGP
Documents Indexed: 95 Publications since 1974
Biographic References: 2 Publications
Co-Authors: 32 Co-Authors with 80 Joint Publications
1,810 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

84 Publications have been cited 1,125 times in 806 Documents Cited by Year
A note on stable sets and colorings of graphs. Zbl 0284.05105
Poljak, Svatopluk
90
1974
Checking robust nonsingularity is NP-hard. Zbl 0780.93027
Poljak, Svatopluk; Rohn, Jiří
83
1993
A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming. Zbl 0843.90088
Poljak, S.; Rendl, F.; Wolkowicz, H.
68
1995
Laplacian eigenvalues and the maximum cut problem. Zbl 0797.90107
Delorme, C.; Poljak, S.
63
1993
On the complexity of the subgraph problem. Zbl 0571.05050
Nešetřil, Jaroslav; Poljak, Svatopluk
55
1985
Maximum cuts and large bipartite subgraphs. Zbl 0834.05001
Poljak, Svatopluk; Tuza, Zsolt
47
1995
On periodical behaviour in societies with symmetric influences. Zbl 0561.90008
Poljak, Svatopluk; Sůra, Miroslav
44
1983
On a positive semidefinite relaxation of the cut polytope. Zbl 0835.90078
Laurent, Monique; Poljak, Svatopluk
42
1995
Eigenvalues in combinatorial optimization. Zbl 0806.90104
Mohar, Bojan; Poljak, Svatopluk
37
1993
On the arc-chromatic number of a digraph. Zbl 0472.05024
Poljak, Svatopluk; Rödl, Vojtěch
27
1981
Eigenvalues and the max-cut problem. Zbl 0724.05046
Mohar, Bojan; Poljak, Svatopluk
27
1990
Combinatorial properties and the complexity of a max-cut approximation. Zbl 0780.05040
Delorme, Charles; Poljak, Svatopluk
23
1993
Bipartite subgraphs of triangle-free graphs. Zbl 0806.68086
Poljak, Svatopluk; Tuza, Zsolt
23
1994
On the facial structure of the set of correlation matrices. Zbl 0855.15011
Laurent, Monique; Poljak, Svatopluk
23
1996
Nonpolyhedral relaxations of graph-bisection problems. Zbl 0838.90130
Poljak, Svatopluk; Rendl, Franz
23
1995
Convex relaxations of \((0,1)\)-quadratic programming. Zbl 0845.90089
Poljak, Svatopluk; Wolkowicz, Henry
22
1995
On qualitatively independent partitions and related problems. Zbl 0515.05009
Poljak, Svatopluk; Pultr, Aleš; Rödl, Vojtěch
21
1983
On the maximum number of qualitative independent partitions. Zbl 0675.05005
Poljak, Svatopluk; Tuza, Zsolt
19
1989
Solving the max-cut problem using eigenvalues. Zbl 0838.90131
Poljak, Svatopluk; Rendl, Franz
17
1995
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. Zbl 0585.05032
Poljak, Svatopluk; Turzík, Daniel
16
1986
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Zbl 0786.05057
Delorme, C.; Poljak, S.
16
1993
Efficient subgraphs packing. Zbl 0794.05105
Loebl, Martin; Poljak, Svatopluk
16
1993
Coloring digraphs by iterated antichains. Zbl 0758.05053
Poljak, Svatopluk
15
1991
Orthogonal partitions and covering of graphs. Zbl 0456.05051
Poljak, Svatopluk; Rödl, Vojtěch
15
1980
Constructive quasi-Ramsey numbers and tournament ranking. Zbl 0933.68099
Czygrinow, A.; Poljak, Svatopluk; Rödl, Vojtěch
15
1999
On the ultimate independence ratio of a graph. Zbl 0829.05026
Hahn, Geňa; Hell, Pavol; Poljak, Svatopluk
14
1995
Connection between semidefinite relaxations of the max-cut and stable set problems. Zbl 0888.90128
Laurent, Monique; Poljak, Svatopluk; Rendl, Franz
13
1997
A spectral approach to bandwidth and separator problems in graphs. Zbl 0832.05093
Helmberg, Christoph; Rendl, Franz; Mohar, Bojan; Poljak, Svatopluk
13
1995
Maximum rank of powers of a matrix of a given pattern. Zbl 0695.05043
Poljak, Svatopluk
12
1989
A polynomial algorithm for constructing a large bipartite subgraphs, with an application to a satisfiability problem. Zbl 0471.68041
Poljak, Svatopluk; Turzik, Daniel
12
1982
Polyhedral and eigenvalue approximations of the max-cut problem. Zbl 0792.05102
Poljak, S.
10
1992
On matroids induced by packing subgraphs. Zbl 0655.05054
Loebl, Martin; Poljak, Svatopluk
10
1988
Maximum bipartite subgraphs of Kneser graphs. Zbl 0674.05064
Poljak, Svatopluk; Tuza, Zsolt
10
1987
The expected relative error of the polyhedral approximation of the max- cut problem. Zbl 0823.90129
Poljak, Svatopluk; Tuza, Zsolt
9
1994
On an application of convexity to discrete systems. Zbl 0588.93048
Poljak, Svatopluk; Turzík, Daniel
8
1986
On pre-periods of discrete influence systems. Zbl 0611.93046
Poljak, Svatopluk; Turzík, Daniel
8
1986
Subgraph packing – a survey. Zbl 0768.05078
Loebl, M.; Poljak, S.
8
1990
Gap inequalities for the cut polytope. Zbl 0849.52010
Laurent, Monique; Poljak, Svatopluk
8
1996
The cut cone. III: On the role of triangle facets. Zbl 0777.90047
Deza, Michel; Laurent, Monique; Poljak, Svatopluk
7
1992
Node and edge relaxations of the max-cut problem. Zbl 0807.90099
Poljak, S.; Rendl, F.
7
1994
Complexity of representation of graphs by set systems. Zbl 0473.68064
Poljak, Svatopluk; Rödl, Vojtěch; Turzík, Daniel
7
1981
Tournament ranking with expected profit in polynomial time. Zbl 0667.05030
Poljak, Svatopluk; Rödl, Vojtěch; Spencer, Joel
7
1988
Minimum spectral radius of a weighted graph. Zbl 0773.05092
Poljak, Svatopluk
6
1992
A spectral approach to bandwidth and separator problems in graphs. Zbl 0920.05061
Helmberg, Christoph; Mohar, Bojan; Poljak, Svatopluk; Rendl, Franz
5
1993
One-third-integrality in the max-cut problem. Zbl 0855.90133
Laurent, Monique; Poljak, Svatopluk
5
1995
A note on sticky matroids. Zbl 0491.05020
Poljak, Svatopluk; Turzik, Daniel
5
1982
Extensions of k-subsets to k+1-subsets - existence versus constructibility. Zbl 0495.68059
Poljak, S.; Turzik, D.; Pudlak, P.
5
1982
Extendability, dimensions, and diagrams of cyclic orders. Zbl 0747.06002
Alles, Peter; Nešetřil, Jaroslav; Poljak, Svatopluk
4
1991
Max-cut in circulant graphs. Zbl 0769.05059
Poljak, Svatopluk; Turzík, Daniel
4
1992
\(k\)-connectivity and decomposition of graphs into forests. Zbl 0818.05043
Nishizeki, Takao; Poljak, Svatopluk
4
1994
Amalgamation of matroids and its applications. Zbl 0473.05021
Nešetřil, Jaroslav; Poljak, Svatopluk; Turzík, Daniel
4
1981
Representing graphs by means of strong and weak products. Zbl 0476.05074
Poljak, S.; Pultr, A.
4
1981
Integer linear programs and local search for max-cut. Zbl 0830.68066
Poljak, Svatopluk
4
1995
Weak three-linking in Eulerian digraphs. Zbl 0721.05026
Ibaraki, T.; Poljak, S.
4
1991
Note on a graph-theoretic criterion for structural output controllability. Zbl 0723.93006
Murota, Kazuo; Poljak, Svatopluk
4
1990
A hierarchy of totally unimodular matrices. Zbl 0726.05052
Loebl, Martin; Poljak, Svatopluk
4
1989
On amalgamation of graphs and essential sets of generators. Zbl 0376.05053
Poljak, Svatopluk; Turzik, Daniel
3
1978
On the gap between the structural controllability of time-varying and time-invariant systems. Zbl 0773.93010
Poljak, Svatopluk
3
1992
On a facet of the balanced subgraph polytope. Zbl 0643.05059
Poljak, Svatopluk; Turzík, Daniel
3
1987
An algorithm for graceful labelling of a class of symmetrical trees. Zbl 0504.05029
Poljak, Svatopluk; Sura, Miroslav
3
1982
On a product dimension of bipartite graphs. Zbl 0531.05038
Poljak, S.; Rödl, D.; Pultr, A.
3
1983
A remark on max-cut problem with an application to digital-analogue convertors. Zbl 0585.90085
Nešetřil, Jaroslav; Poljak, Svatopluk
3
1986
Amalgamation of matroids along hypergraphs. Zbl 0567.05015
Poljak, S.; Turzík, D.
3
1984
On systems, periods and semipositive mappings. Zbl 0576.05059
Poljak, Svatopluk; Turzik, Daniel
3
1984
On the dimension of trees. Zbl 0476.05075
Poljak, S.; Pultr, A.
3
1981
The cut cone. III: On the role of triangle facets. Zbl 0794.90046
Deza, Michel; Laurent, Monique; Poljak, Svatopluk
2
1993
On the generic dimension of controllable subspaces. Zbl 0703.93019
Poljak, Svatopluk
2
1990
Social influence models with ranking alternatives and local election rules. Zbl 0586.90005
Poljak, Svatoplukk; Turzík, Daniel
2
1985
Compatible 2-factors. Zbl 0778.05064
Kratochvíl, Jan; Poljak, Svatopluk
2
1992
On existence theorems. Zbl 0803.05046
Poljak, Svatopluk
2
1993
On set systems determined by intersections. Zbl 0474.05060
Poljak, Svatopluk; Rödl, Vojtěch
2
1981
Long induced paths and cycles in Kneser graphs. Zbl 0688.05043
Alles, Peter; Poljak, Svatopluk
2
1989
Special amalgams and Ramsey matroids. Zbl 0643.05025
Nešetřil, Jaroslav; Poljak, Svatopluk; Turzík, Daniel
1
1985
Amalgamation over uniform matroids. Zbl 0553.05029
Poljak, Svatopluk; Turzík, Daniel
1
1984
Bipartite packing. Zbl 0701.05045
Loebl, M.; Poljak, S.
1
1988
Graphs with the Balas-Uhry property. Zbl 0735.05064
Kano, M.; Poljak, S.
1
1990
A decomposition of strongly unimodular matrices into incidence matrices of digraphs. Zbl 0776.05071
Crama, Y.; Loebl, M.; Poljak, S.
1
1992
Good family packing. Zbl 0771.05080
Loebl, M.; Poljak, S.
1
1992
Some equivalent formulations of the intersection problem of finitely generated classes of graphs. Zbl 0427.05049
Poljak, Svatopluk; Turzik, Daniel
1
1979
A note on dimension of P//\(3^ n\). Zbl 0476.05076
Poljak, Svatopluk; Turzik, Daniel
1
1981
On the dimension of Kneser graphs. Zbl 0476.05077
Poljak, Svatopluk; Pultr, Aleš; Rödl, Vojtěch
1
1981
Extensions of cyclically monotone mappings. Zbl 0647.90071
Pelant, Jan; Poljak, Svatopluk
1
1985
On common edges in optimal solutions to traveling salesman and other optimization problems. Zbl 0648.90082
Chrobak, M.; Poljak, S.
1
1988
Transformations on graphs and convexity. Zbl 0668.05053
Poljak, Svatopluk
1
1987
Constructive quasi-Ramsey numbers and tournament ranking. Zbl 0933.68099
Czygrinow, A.; Poljak, Svatopluk; Rödl, Vojtěch
15
1999
Connection between semidefinite relaxations of the max-cut and stable set problems. Zbl 0888.90128
Laurent, Monique; Poljak, Svatopluk; Rendl, Franz
13
1997
On the facial structure of the set of correlation matrices. Zbl 0855.15011
Laurent, Monique; Poljak, Svatopluk
23
1996
Gap inequalities for the cut polytope. Zbl 0849.52010
Laurent, Monique; Poljak, Svatopluk
8
1996
A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming. Zbl 0843.90088
Poljak, S.; Rendl, F.; Wolkowicz, H.
68
1995
Maximum cuts and large bipartite subgraphs. Zbl 0834.05001
Poljak, Svatopluk; Tuza, Zsolt
47
1995
On a positive semidefinite relaxation of the cut polytope. Zbl 0835.90078
Laurent, Monique; Poljak, Svatopluk
42
1995
Nonpolyhedral relaxations of graph-bisection problems. Zbl 0838.90130
Poljak, Svatopluk; Rendl, Franz
23
1995
Convex relaxations of \((0,1)\)-quadratic programming. Zbl 0845.90089
Poljak, Svatopluk; Wolkowicz, Henry
22
1995
Solving the max-cut problem using eigenvalues. Zbl 0838.90131
Poljak, Svatopluk; Rendl, Franz
17
1995
On the ultimate independence ratio of a graph. Zbl 0829.05026
Hahn, Geňa; Hell, Pavol; Poljak, Svatopluk
14
1995
A spectral approach to bandwidth and separator problems in graphs. Zbl 0832.05093
Helmberg, Christoph; Rendl, Franz; Mohar, Bojan; Poljak, Svatopluk
13
1995
One-third-integrality in the max-cut problem. Zbl 0855.90133
Laurent, Monique; Poljak, Svatopluk
5
1995
Integer linear programs and local search for max-cut. Zbl 0830.68066
Poljak, Svatopluk
4
1995
Bipartite subgraphs of triangle-free graphs. Zbl 0806.68086
Poljak, Svatopluk; Tuza, Zsolt
23
1994
The expected relative error of the polyhedral approximation of the max- cut problem. Zbl 0823.90129
Poljak, Svatopluk; Tuza, Zsolt
9
1994
Node and edge relaxations of the max-cut problem. Zbl 0807.90099
Poljak, S.; Rendl, F.
7
1994
\(k\)-connectivity and decomposition of graphs into forests. Zbl 0818.05043
Nishizeki, Takao; Poljak, Svatopluk
4
1994
Checking robust nonsingularity is NP-hard. Zbl 0780.93027
Poljak, Svatopluk; Rohn, Jiří
83
1993
Laplacian eigenvalues and the maximum cut problem. Zbl 0797.90107
Delorme, C.; Poljak, S.
63
1993
Eigenvalues in combinatorial optimization. Zbl 0806.90104
Mohar, Bojan; Poljak, Svatopluk
37
1993
Combinatorial properties and the complexity of a max-cut approximation. Zbl 0780.05040
Delorme, Charles; Poljak, Svatopluk
23
1993
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Zbl 0786.05057
Delorme, C.; Poljak, S.
16
1993
Efficient subgraphs packing. Zbl 0794.05105
Loebl, Martin; Poljak, Svatopluk
16
1993
A spectral approach to bandwidth and separator problems in graphs. Zbl 0920.05061
Helmberg, Christoph; Mohar, Bojan; Poljak, Svatopluk; Rendl, Franz
5
1993
The cut cone. III: On the role of triangle facets. Zbl 0794.90046
Deza, Michel; Laurent, Monique; Poljak, Svatopluk
2
1993
On existence theorems. Zbl 0803.05046
Poljak, Svatopluk
2
1993
Polyhedral and eigenvalue approximations of the max-cut problem. Zbl 0792.05102
Poljak, S.
10
1992
The cut cone. III: On the role of triangle facets. Zbl 0777.90047
Deza, Michel; Laurent, Monique; Poljak, Svatopluk
7
1992
Minimum spectral radius of a weighted graph. Zbl 0773.05092
Poljak, Svatopluk
6
1992
Max-cut in circulant graphs. Zbl 0769.05059
Poljak, Svatopluk; Turzík, Daniel
4
1992
On the gap between the structural controllability of time-varying and time-invariant systems. Zbl 0773.93010
Poljak, Svatopluk
3
1992
Compatible 2-factors. Zbl 0778.05064
Kratochvíl, Jan; Poljak, Svatopluk
2
1992
A decomposition of strongly unimodular matrices into incidence matrices of digraphs. Zbl 0776.05071
Crama, Y.; Loebl, M.; Poljak, S.
1
1992
Good family packing. Zbl 0771.05080
Loebl, M.; Poljak, S.
1
1992
Coloring digraphs by iterated antichains. Zbl 0758.05053
Poljak, Svatopluk
15
1991
Extendability, dimensions, and diagrams of cyclic orders. Zbl 0747.06002
Alles, Peter; Nešetřil, Jaroslav; Poljak, Svatopluk
4
1991
Weak three-linking in Eulerian digraphs. Zbl 0721.05026
Ibaraki, T.; Poljak, S.
4
1991
Eigenvalues and the max-cut problem. Zbl 0724.05046
Mohar, Bojan; Poljak, Svatopluk
27
1990
Subgraph packing – a survey. Zbl 0768.05078
Loebl, M.; Poljak, S.
8
1990
Note on a graph-theoretic criterion for structural output controllability. Zbl 0723.93006
Murota, Kazuo; Poljak, Svatopluk
4
1990
On the generic dimension of controllable subspaces. Zbl 0703.93019
Poljak, Svatopluk
2
1990
Graphs with the Balas-Uhry property. Zbl 0735.05064
Kano, M.; Poljak, S.
1
1990
On the maximum number of qualitative independent partitions. Zbl 0675.05005
Poljak, Svatopluk; Tuza, Zsolt
19
1989
Maximum rank of powers of a matrix of a given pattern. Zbl 0695.05043
Poljak, Svatopluk
12
1989
A hierarchy of totally unimodular matrices. Zbl 0726.05052
Loebl, Martin; Poljak, Svatopluk
4
1989
Long induced paths and cycles in Kneser graphs. Zbl 0688.05043
Alles, Peter; Poljak, Svatopluk
2
1989
On matroids induced by packing subgraphs. Zbl 0655.05054
Loebl, Martin; Poljak, Svatopluk
10
1988
Tournament ranking with expected profit in polynomial time. Zbl 0667.05030
Poljak, Svatopluk; Rödl, Vojtěch; Spencer, Joel
7
1988
Bipartite packing. Zbl 0701.05045
Loebl, M.; Poljak, S.
1
1988
On common edges in optimal solutions to traveling salesman and other optimization problems. Zbl 0648.90082
Chrobak, M.; Poljak, S.
1
1988
Maximum bipartite subgraphs of Kneser graphs. Zbl 0674.05064
Poljak, Svatopluk; Tuza, Zsolt
10
1987
On a facet of the balanced subgraph polytope. Zbl 0643.05059
Poljak, Svatopluk; Turzík, Daniel
3
1987
Transformations on graphs and convexity. Zbl 0668.05053
Poljak, Svatopluk
1
1987
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. Zbl 0585.05032
Poljak, Svatopluk; Turzík, Daniel
16
1986
On an application of convexity to discrete systems. Zbl 0588.93048
Poljak, Svatopluk; Turzík, Daniel
8
1986
On pre-periods of discrete influence systems. Zbl 0611.93046
Poljak, Svatopluk; Turzík, Daniel
8
1986
A remark on max-cut problem with an application to digital-analogue convertors. Zbl 0585.90085
Nešetřil, Jaroslav; Poljak, Svatopluk
3
1986
On the complexity of the subgraph problem. Zbl 0571.05050
Nešetřil, Jaroslav; Poljak, Svatopluk
55
1985
Social influence models with ranking alternatives and local election rules. Zbl 0586.90005
Poljak, Svatoplukk; Turzík, Daniel
2
1985
Special amalgams and Ramsey matroids. Zbl 0643.05025
Nešetřil, Jaroslav; Poljak, Svatopluk; Turzík, Daniel
1
1985
Extensions of cyclically monotone mappings. Zbl 0647.90071
Pelant, Jan; Poljak, Svatopluk
1
1985
Amalgamation of matroids along hypergraphs. Zbl 0567.05015
Poljak, S.; Turzík, D.
3
1984
On systems, periods and semipositive mappings. Zbl 0576.05059
Poljak, Svatopluk; Turzik, Daniel
3
1984
Amalgamation over uniform matroids. Zbl 0553.05029
Poljak, Svatopluk; Turzík, Daniel
1
1984
On periodical behaviour in societies with symmetric influences. Zbl 0561.90008
Poljak, Svatopluk; Sůra, Miroslav
44
1983
On qualitatively independent partitions and related problems. Zbl 0515.05009
Poljak, Svatopluk; Pultr, Aleš; Rödl, Vojtěch
21
1983
On a product dimension of bipartite graphs. Zbl 0531.05038
Poljak, S.; Rödl, D.; Pultr, A.
3
1983
A polynomial algorithm for constructing a large bipartite subgraphs, with an application to a satisfiability problem. Zbl 0471.68041
Poljak, Svatopluk; Turzik, Daniel
12
1982
A note on sticky matroids. Zbl 0491.05020
Poljak, Svatopluk; Turzik, Daniel
5
1982
Extensions of k-subsets to k+1-subsets - existence versus constructibility. Zbl 0495.68059
Poljak, S.; Turzik, D.; Pudlak, P.
5
1982
An algorithm for graceful labelling of a class of symmetrical trees. Zbl 0504.05029
Poljak, Svatopluk; Sura, Miroslav
3
1982
On the arc-chromatic number of a digraph. Zbl 0472.05024
Poljak, Svatopluk; Rödl, Vojtěch
27
1981
Complexity of representation of graphs by set systems. Zbl 0473.68064
Poljak, Svatopluk; Rödl, Vojtěch; Turzík, Daniel
7
1981
Amalgamation of matroids and its applications. Zbl 0473.05021
Nešetřil, Jaroslav; Poljak, Svatopluk; Turzík, Daniel
4
1981
Representing graphs by means of strong and weak products. Zbl 0476.05074
Poljak, S.; Pultr, A.
4
1981
On the dimension of trees. Zbl 0476.05075
Poljak, S.; Pultr, A.
3
1981
On set systems determined by intersections. Zbl 0474.05060
Poljak, Svatopluk; Rödl, Vojtěch
2
1981
A note on dimension of P//\(3^ n\). Zbl 0476.05076
Poljak, Svatopluk; Turzik, Daniel
1
1981
On the dimension of Kneser graphs. Zbl 0476.05077
Poljak, Svatopluk; Pultr, Aleš; Rödl, Vojtěch
1
1981
Orthogonal partitions and covering of graphs. Zbl 0456.05051
Poljak, Svatopluk; Rödl, Vojtěch
15
1980
Some equivalent formulations of the intersection problem of finitely generated classes of graphs. Zbl 0427.05049
Poljak, Svatopluk; Turzik, Daniel
1
1979
On amalgamation of graphs and essential sets of generators. Zbl 0376.05053
Poljak, Svatopluk; Turzik, Daniel
3
1978
A note on stable sets and colorings of graphs. Zbl 0284.05105
Poljak, Svatopluk
90
1974
all top 5

Cited by 1,175 Authors

31 Poljak, Svatopluk
18 Letchford, Adam N.
14 Laurent, Monique
14 Rohn, Jiri
13 Rendl, Franz
11 Mosca, Raffaele
10 Hladík, Milan
10 Milanič, Martin
10 Paulusma, Daniël
10 Rodl, Vojtech
9 Turzík, Daniel
8 Alon, Noga M.
8 Karthick, T.
8 Sotirov, Renata
8 Tardif, Claude
8 Tuza, Zsolt
8 Zhu, Xuding
7 Brandstädt, Andreas
7 Deza, Michel Marie
7 Körner, János
7 Lozin, Vadim Vladislavovich
7 Sudakov, Benny
6 Hell, Pavol
6 Johnson, Matthew
6 Lingas, Andrzej
6 Nešetřil, Jaroslav
6 Rump, Siegfried Michael
6 Wolkowicz, Henry
6 Yuster, Raphael
5 Bollobás, Béla
5 Galli, Laura
5 Helmberg, Christoph
5 Kowaluk, Mirosław
5 Malick, Jérôme
5 Saurabh, Saket
5 Trotignon, Nicolas
5 Van der Woude, Jacob Willem
5 Vušković, Kristina
4 Anjos, Miguel F.
4 Atamtürk, Alper
4 Chen, Jian-er
4 Commault, Christian
4 Fellows, Michael Ralph
4 Gadouleau, Maximilien
4 Gargano, Luisa
4 Giandomenico, Monia
4 Goles Chacc, Eric
4 Kaparis, Konstantinos
4 Kloks, Ton
4 Kojima, Masakazu
4 Li, Duan
4 Mnich, Matthias
4 Rautenbach, Dieter
4 Richard, Adrien
4 Rinaldi, Giovanni
4 Roupin, Frédéric
4 Szwarcfiter, Jayme Luiz
4 Tempo, Roberto
4 Vaccaro, Ugo
4 Van Dam, Edwin Robert
4 Yu, Xingxing
4 Zeng, Qinghou
4 Zhukovskiĭ, Maksim Evgen’evich
3 Alles, Peter
3 Apkarian, Pierre
3 Ben-Ameur, Walid
3 Blondel, Vincent D.
3 Boukhobza, Taha
3 Brettell, Nick
3 Buchheim, Christoph
3 Cioabă, Sebastian M.
3 Codenotti, Bruno
3 Cvetkovic, Dragos M.
3 de Klerk, Etienne
3 Delorme, Charles
3 Dourado, Mitre C.
3 Draque Penso, Lucia
3 Gerber, Michael U.
3 Gutin, Gregory Z.
3 Hou, Jianfeng
3 Hudry, Olivier
3 Iarrobino, Anthony A.
3 Kelmans, Alexander K.
3 Khatami, Leila
3 Li, Shuchao
3 Lin, Jing
3 Lisser, Abdel
3 Loebl, Martin
3 Lonc, Zbigniew
3 Maffioli, Francesco
3 Mitchell, John E.
3 Mohar, Bojan
3 Moran, Gadi
3 N. Zehmakan, Ahad
3 Nagamochi, Hiroshi
3 Neto, José
3 Noll, Dominikus
3 Novák, Vítězslav
3 Orponen, Pekka
3 Paesani, Giacomo
...and 1,075 more Authors
all top 5

Cited in 149 Serials

77 Discrete Mathematics
72 Discrete Applied Mathematics
46 Linear Algebra and its Applications
39 Mathematical Programming. Series A. Series B
36 Theoretical Computer Science
20 Journal of Global Optimization
19 Algorithmica
17 Journal of Combinatorial Theory. Series B
15 Graphs and Combinatorics
14 Information Processing Letters
14 Operations Research Letters
12 Journal of Combinatorial Theory. Series A
11 SIAM Journal on Optimization
10 Linear and Multilinear Algebra
10 Automatica
10 European Journal of Combinatorics
10 SIAM Journal on Discrete Mathematics
10 Optimization Letters
9 Journal of Computer and System Sciences
9 Systems & Control Letters
9 The Electronic Journal of Combinatorics
8 Czechoslovak Mathematical Journal
8 Journal of Computational and Applied Mathematics
8 Combinatorica
8 Annals of Operations Research
8 Optimization Methods & Software
8 Journal of Combinatorial Optimization
8 Discrete Optimization
7 Applied Mathematics and Computation
7 Journal of Graph Theory
7 Computers & Operations Research
7 European Journal of Operational Research
6 Combinatorics, Probability and Computing
5 MCSS. Mathematics of Control, Signals, and Systems
5 Random Structures & Algorithms
5 Theory of Computing Systems
4 International Journal of Systems Science
4 BIT
4 SIAM Journal on Computing
4 Cybernetics and Systems Analysis
4 Computational Optimization and Applications
4 Journal of Combinatorial Designs
4 Reliable Computing
4 Journal of Discrete Algorithms
3 Journal of Multivariate Analysis
3 Journal of Optimization Theory and Applications
3 Mathematics of Operations Research
3 Mathematica Slovaca
3 Networks
3 Journal of Symbolic Computation
3 Discrete & Computational Geometry
3 Information and Computation
3 International Journal of Robust and Nonlinear Control
3 Journal of Algebraic Combinatorics
3 Journal of Mathematical Sciences (New York)
3 European Journal of Control
3 RAIRO. Operations Research
3 4OR
3 Mathematical Programming Computation
3 SIAM Journal on Mathematics of Data Science
2 Bulletin of the Australian Mathematical Society
2 Journal of Statistical Physics
2 Computing
2 Journal of Soviet Mathematics
2 Mathematical Social Sciences
2 SIAM Journal on Algebraic and Discrete Methods
2 Order
2 Optimization
2 Asia-Pacific Journal of Operational Research
2 Applied Mathematics Letters
2 Japan Journal of Industrial and Applied Mathematics
2 Computational Geometry
2 Numerical Algorithms
2 Distributed Computing
2 Annals of Combinatorics
2 Electronic Journal of Graph Theory and Applications
1 Communications in Algebra
1 Computers & Mathematics with Applications
1 Israel Journal of Mathematics
1 Mathematical Notes
1 Periodica Mathematica Hungarica
1 Chaos, Solitons and Fractals
1 Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques
1 Advances in Mathematics
1 Algebra Universalis
1 The Annals of Probability
1 The Annals of Statistics
1 Commentationes Mathematicae Universitatis Carolinae
1 International Journal of Game Theory
1 Journal of Philosophical Logic
1 Journal of Statistical Planning and Inference
1 Operations Research
1 Opsearch
1 Programming and Computer Software
1 Quarterly of Applied Mathematics
1 Statistica Neerlandica
1 Transactions of the American Mathematical Society
1 Acta Mathematica Hungarica
1 Annals of Pure and Applied Logic
1 Applied Numerical Mathematics
...and 49 more Serials
all top 5

Cited in 39 Fields

417 Combinatorics (05-XX)
248 Operations research, mathematical programming (90-XX)
213 Computer science (68-XX)
60 Linear and multilinear algebra; matrix theory (15-XX)
55 Numerical analysis (65-XX)
40 Systems theory; control (93-XX)
27 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
25 Convex and discrete geometry (52-XX)
20 Information and communication theory, circuits (94-XX)
16 Mathematical logic and foundations (03-XX)
13 Order, lattices, ordered algebraic structures (06-XX)
12 Probability theory and stochastic processes (60-XX)
11 Biology and other natural sciences (92-XX)
10 Algebraic geometry (14-XX)
10 Statistics (62-XX)
4 General algebraic systems (08-XX)
4 Group theory and generalizations (20-XX)
4 Dynamical systems and ergodic theory (37-XX)
4 Calculus of variations and optimal control; optimization (49-XX)
4 Statistical mechanics, structure of matter (82-XX)
3 General and overarching topics; collections (00-XX)
3 Category theory; homological algebra (18-XX)
2 Number theory (11-XX)
2 Real functions (26-XX)
2 Ordinary differential equations (34-XX)
2 Difference and functional equations (39-XX)
2 Operator theory (47-XX)
2 Geometry (51-XX)
2 Quantum theory (81-XX)
1 Commutative algebra (13-XX)
1 Associative rings and algebras (16-XX)
1 Special functions (33-XX)
1 Approximations and expansions (41-XX)
1 Functional analysis (46-XX)
1 Algebraic topology (55-XX)
1 Manifolds and cell complexes (57-XX)
1 Global analysis, analysis on manifolds (58-XX)
1 Mechanics of particles and systems (70-XX)
1 Mechanics of deformable solids (74-XX)

Citations by Year