Alexander Sidorenko
According to our database^{1},
Alexander Sidorenko
authored at least 24 papers
between 1988 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2018
Extremal Problems on the Hypercube and the Codegree Turán Density of Complete rGraphs.
SIAM J. Discrete Math., 2018
An ErdősGallaiType Theorem for Keyrings.
Graphs and Combinatorics, 2018
1999
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
1997
Upper Bounds for Turán Numbers.
J. Comb. Theory, Ser. A, 1997
1996
Randomness friendly graphs.
Random Struct. Algorithms, 1996
1995
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
1994
A partially ordered set of functionals corresponding to graphs.
Discrete Mathematics, 1994
1993
Lyapounov Functions for Jackson Networks.
Math. Oper. Res., 1993
The Ramsey Number of an NEdge 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.
Combinatorica, 1993
Optimal databased complex demodulation for evolutionary spectra.
Proceedings of the IEEE International Conference on Acoustics, 1993
1992
On ramseytuŕan numbers for 3graphs.
Journal of Graph Theory, 1992
Asymptotic solution of the Turán problem for some hypergraphs.
Graphs and Combinatorics, 1992
1991
Inequalities in Probability Theory and TuránType Problems for Graphs with Colored Vertices.
Random Struct. Algorithms, 1991
An upper bound on the ramsey number R(K_{3}, G) depending only on the size of the graph G.
Journal of Graph Theory, 1991
Trianglefree regular graphs.
Discrete Mathematics, 1991
Probabilistic methods for Jackson networks.
Proceedings of the Performance of Distributed Systems and Integrated Communication Networks, 1991
1989
Asymptotic solution for a new class of forbidden rgraphs.
Combinatorica, 1989
1988
An infinite permutation without arithmetic progressions.
Discrete Mathematics, 1988