Sergei L. Bezrukov

According to our database, Sergei L. Bezrukov authored at least 34 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Pull-push method: A new approach to edge-isoperimetric problems.

Sergei L. Bezrukov, Nikola Kuzmanovski, Jounglag Lim

Discret. Math., December, 2023

2018

New infinite family of regular edge-isoperimetric graphs.

Sergei L. Bezrukov, Pavle Bulatovic, Nikola Kuzmanovski

Theor. Comput. Sci., 2018

2013

On Data Recovery in Distributed Databases.

Sergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Properties of Graded Posets Preserved by Some Operations.

Sergei L. Bezrukov, Konrad Engel

Proceedings of the Mathematics of Paul Erdős II, 2013

2009

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

Sergei L. Bezrukov, Uwe Leck

SIAM J. Discret. Math., 2009

2008

On the bandwidth of 3-dimensional Hamming graphs.

József Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress

Theor. Comput. Sci., 2008

The vertex isoperimetric problem for the powers of the diamond graph.

Sergei L. Bezrukov, Miquel Rius, Oriol Serra

Discret. Math., 2008

On biclique coverings.

Sergei L. Bezrukov, Dalibor Froncek, Steven J. Rosenberg, Petr Kovár

Discret. Math., 2008

2007

On partitioning of hypergraphs.

Sergei L. Bezrukov, Roberto Battiti

Discret. Math., 2007

2004

New spectral lower bounds on the bisection width of graphs.

Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich

Theor. Comput. Sci., 2004

A new approach to Macaulay posets.

Sergei L. Bezrukov, Victor P. Piotrowski, Thomas J. Pfaff

J. Comb. Theory A, 2004

2003

Edge-isoperimetric problems for cartesian powers of regular graphs.

Sergei L. Bezrukov, Robert Elsässer

Theor. Comput. Sci., 2003

Permutation routing in optical MIN with minimum number of stages.

Nabanita Das, Bhargab B. Bhattacharya, Sergei L. Bezrukov

J. Syst. Archit., 2003

2002

A local-global principle for vertex-isoperimetric problems.

Sergei L. Bezrukov, Oriol Serra

Discret. Math., 2002

2001

Embedding complete trees into the hypercube.

Sergei L. Bezrukov

Discret. Appl. Math., 2001

2000

The Spider Poset Is Macaulay.

Sergei L. Bezrukov, Robert Elsässer

J. Comb. Theory A, 2000

The congestion of <i>n</i>-cube layout on a rectangular grid.

Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder

Discret. Math., 2000

1999

A Local-Global Principle for Macaulay Posets.

Sergei L. Bezrukov, Xavier Portas, Oriol Serra

Order, 1999

A Kruskal-Katona Type Theorem for the Linear Lattice.

Sergei L. Bezrukov, Aart Blokhuis

Eur. J. Comb., 1999

On an equivalence in discrete extremal problems.

Sergei L. Bezrukov

Discret. Math., 1999

On k-partitioning of Hamming Graphs.

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

Discret. Appl. Math., 1999

Optimal Cuts for Powers of the Petersen Graph.

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

On Bounds for the k-Partitioning of Graphs.

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

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

On Posets whose Products are Macaulay.

Sergei L. Bezrukov

J. Comb. Theory A, 1998

The Cyclic Wirelength of Trees.

Sergei L. Bezrukov, Ulf-Peter Schroeder

Discret. Appl. Math., 1998

Embedding ladders and caterpillars into the hypercube.

Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung

Discret. Appl. Math., 1998

Embedding of Hypercubes into Grids.

Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

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

Nabanita Das, Bhargab B. Bhattacharya, Rekha Menon, Sergei L. Bezrukov

Proceedings of the 5th International Conference On High Performance Computing, 1998

1997

On Partitioning Grids into Equal Parts.

Sergei L. Bezrukov, Branislav Rovan

Comput. Artif. Intell., 1997

On the Embedding of Refinements of 2-dimensional Grids.

Fabrizio d'Amore, Luca Becchetti, Sergei L. Bezrukov, Alberto Marchetti-Spaccamela, M. Ottaviani, Robert Preis, Markus Röttger, Ulf-Peter Schroeder

Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996

On k-Partitioning the n-Cube.

Sergei L. Bezrukov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

On Central Spanning Trees of a Graph.

Sergei L. Bezrukov, Firoz Kaderali, Werner Poguntke

Proceedings of the Combinatorics and Computer Science, 1995

1994

On Oriented Embedding of the Binary tree into the Hypercube.

Sergei L. Bezrukov

Comb. Probab. Comput., 1994

1993

On Edge Numberings of the <i>n</i>-Cube Graph.

Sergei L. Bezrukov, Norbert Grünwald, Karl Weber

Discret. Appl. Math., 1993