According to our database1, Alexander Sidorenko authored at least 24 papers between 1988 and 2018.
Legend:Book In proceedings Article PhD thesis Other
Extremal Problems on the Hypercube and the Codegree Turán Density of Complete r-Graphs.
SIAM J. Discrete Math., 2018
An Erdős-Gallai-Type Theorem for Keyrings.
Graphs and Combinatorics, 2018
Hypercube subgraphs with local detours.
Journal of Graph Theory, 1999
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs.
J. Comb. Theory, Ser. A, 1999
Geometrical Techniques for Estimating Numbers of Linear Extensions.
Eur. J. Comb., 1999
Upper Bounds for Turán Numbers.
J. Comb. Theory, Ser. A, 1997
Randomness friendly graphs.
Random Struct. Algorithms, 1996
Minimum bias multiple taper spectral estimation.
IEEE Trans. Signal Processing, 1995
On the Jumping Constant Conjecture for Multigraphs.
J. Comb. Theory, Ser. A, 1995
What we know and what we do not know about Turán numbers.
Graphs and Combinatorics, 1995
A partially ordered set of functionals corresponding to graphs.
Discrete Mathematics, 1994
Lyapounov Functions for Jackson Networks.
Math. Oper. Res., 1993
The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1.
J. Comb. Theory, Ser. B, 1993
A correlation inequality for bipartite graphs.
Graphs and Combinatorics, 1993
Boundedness of optimal matrices in extremal multigraph and digraph problems.
Optimal databased complex demodulation for evolutionary spectra.
Proceedings of the IEEE International Conference on Acoustics, 1993
On ramsey-tuŕan numbers for 3-graphs.
Journal of Graph Theory, 1992
Asymptotic solution of the Turán problem for some hypergraphs.
Graphs and Combinatorics, 1992
Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices.
Random Struct. Algorithms, 1991
An upper bound on the ramsey number R(K3, G) depending only on the size of the graph G.
Journal of Graph Theory, 1991
Triangle-free regular graphs.
Discrete Mathematics, 1991
Probabilistic methods for Jackson networks.
Proceedings of the Performance of Distributed Systems and Integrated Communication Networks, 1991
Asymptotic solution for a new class of forbidden r-graphs.
An infinite permutation without arithmetic progressions.
Discrete Mathematics, 1988