Sergei L. Bezrukov

发表

A Local-Global Principle for Macaulay Posets

Oriol Serra, Sergei L. Bezrukov, Xavier Portas, 1999, Order.

New infinite family of regular edge-isoperimetric graphs

Sergei L. Bezrukov, Pavle Bulatovic, Nikola Kuzmanovski, 2018, Theor. Comput. Sci..

On Partitioning Grids into Equal Parts

Branislav Rovan, Sergei L. Bezrukov, 1997, Comput. Artif. Intell..

Edge-isoperimetric problems for cartesian powers of regular graphs

Robert Elsässer, Sergei L. Bezrukov, 2003, Theor. Comput. Sci..

On k-Partitioning the n-Cube

Sergei L. Bezrukov, S. Bezrukov, 1996, WG.

On an equivalence in discrete extremal problems

Sergei L. Bezrukov, 1999, Discret. Math..

On Data Recovery in Distributed Databases

Uwe Leck, Sergei L. Bezrukov, Victor P. Piotrowski, 2013, Information Theory, Combinatorics, and Search Theory.

Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm

Roberto Battiti, Sergei L. Bezrukov, R. Battiti, 2022 .

On Edge Numberings of the n-Cube Graph

Karl Weber, Sergei L. Bezrukov, Norbert Grünwald, 1993, Discret. Appl. Math..

A Kruskal-Katona Type Theorem for the Linear Lattice

Aart Blokhuis, Sergei L. Bezrukov, 1999, Eur. J. Comb..

A local-global principle for vertex-isoperimetric problems

Oriol Serra, Sergei L. Bezrukov, 2002, Discret. Math..

Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs

Robert Elsässer, Sergei L. Bezrukov, 2001, WG.

On Oriented Embedding of the Binary tree into the Hypercube

Sergei L. Bezrukov, 1994, Comb. Probab. Comput..

On k-partitioning of Hamming Graphs

Robert Elsässer, Ulf-Peter Schroeder, Sergei L. Bezrukov, 1999, Discret. Appl. Math..

New Spectral Lower Bounds on the Bisection Width of Graphs

Robert Elsässer, Burkhard Monien, Jean-Pierre Tillich, 2000, WG.

Permutation routing in optical MIN with minimum number of stages

Nabanita Das, Bhargab B. Bhattacharya, Sergei L. Bezrukov, 2003, J. Syst. Archit..

Embedding of Hypercubes into Grids

L. H. Harper, Markus Röttger, Ulf-Peter Schroeder, 1998, MFCS.

On biclique coverings

Petr Kovár, Dalibor Froncek, Sergei L. Bezrukov, 2008, Discret. Math..

Properties of Graded Posets Preserved by Some Operations

Konrad Engel, Sergei L. Bezrukov, 2013, The Mathematics of Paul Erdős II.

Optimal Cuts for Powers of the Petersen Graph

Sajal K. Das, Robert Elsässer, Sergei L. Bezrukov, 1999, WG.

A Simple Proof of the Karakhanyan--Riordan Theorem on the Even Discrete Torus

Uwe Leck, Sergei L. Bezrukov, 2009, SIAM J. Discret. Math..

A new approach to Macaulay posets

Sergei L. Bezrukov, Victor P. Piotrowski, Thomas J. Pfaff, 2004, J. Comb. Theory, Ser. A.

On Bounds for the k-Partitioning of Graphs

Robert Elsässer, Ulf-Peter Schroeder, Sergei L. Bezrukov, 1999, COCOON.

On Central Spanning Trees of a Graph

Sergei L. Bezrukov, Werner Poguntke, Firoz Kaderali, 1995, Combinatorics and Computer Science.

The Spider Poset Is Macaulay

Robert Elsässer, Sergei L. Bezrukov, 2000, J. Comb. Theory, Ser. A.

Embedding complete trees into the hypercube

Sergei L. Bezrukov, 2001, Discret. Appl. Math..

Embedding ladders and caterpillars into the hypercube

Gerd Wechsung, Burkhard Monien, Walter Unger, 1998, Discret. Appl. Math..

On Posets whose Products are Macaulay

Sergei L. Bezrukov, 1998, J. Comb. Theory, Ser. A.

The congestion of n-cube layout on a rectangular grid

L. H. Harper, Markus Röttger, Ulf-Peter Schroeder, 2000, Discret. Math..

The Cyclic Wirelength of Trees

Ulf-Peter Schroeder, Sergei L. Bezrukov, 1998, Discret. Appl. Math..

New spectral lower bounds on the bisection width of graphs

Robert Elsässer, Burkhard Monien, Jean-Pierre Tillich, 2000, Theor. Comput. Sci..

Permutation admissibility in shuffle-exchange networks with arbitrary number of stages

Nabanita Das, Bhargab B. Bhattacharya, Sergei L. Bezrukov, 1998, Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238).

On the bandwidth of 3-dimensional Hamming graphs

L. H. Harper, Ákos Seress, Sergei L. Bezrukov, 2008, Theor. Comput. Sci..

The vertex isoperimetric problem for the powers of the diamond graph

Oriol Serra, Sergei L. Bezrukov, Miquel Rius, 2008, Discret. Math..

Some New Results on Macaulay Posets

Uwe Leck, Sergei L. Bezrukov, 2000 .

Edge isoperimetric theorems for integer point arrays

Rudolf Ahlswede, Sergei L. Bezrukov, 1995 .

ON THE CONSTRUCTION OF SOLUTIONS OF A DISCRETE ISOPERIMETRIC PROBLEM IN HAMMING SPACE

Sergei L. Bezrukov, 1989 .

Minimization of Surrounding of Subsets in Hamming Space

Sergei L. Bezrukov, 2002 .

Macaulay Posets

Sergei L. Bezrukov, S. Bezrukov, .