Sergei L. Bezrukov

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Pull-push method: A new approach to edge-isoperimetric problems.
Discret. Math., December, 2023

2018
New infinite family of regular edge-isoperimetric graphs.
Theor. Comput. Sci., 2018

2013
On Data Recovery in Distributed Databases.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Properties of Graded Posets Preserved by Some Operations.
Proceedings of the Mathematics of Paul Erdős II, 2013

2009
A Simple Proof of the Karakhanyan--Riordan Theorem on the Even Discrete Torus.
SIAM J. Discret. Math., 2009

2008
On the bandwidth of 3-dimensional Hamming graphs.
Theor. Comput. Sci., 2008

The vertex isoperimetric problem for the powers of the diamond graph.
Discret. Math., 2008

On biclique coverings.
Discret. Math., 2008

2007
On partitioning of hypergraphs.
Discret. Math., 2007

2004
New spectral lower bounds on the bisection width of graphs.
Theor. Comput. Sci., 2004

A new approach to Macaulay posets.
J. Comb. Theory A, 2004

2003
Edge-isoperimetric problems for cartesian powers of regular graphs.
Theor. Comput. Sci., 2003

Permutation routing in optical MIN with minimum number of stages.
J. Syst. Archit., 2003

2002
A local-global principle for vertex-isoperimetric problems.
Discret. Math., 2002

2001
Embedding complete trees into the hypercube.
Discret. Appl. Math., 2001

2000
The Spider Poset Is Macaulay.
J. Comb. Theory A, 2000

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

1999
A Local-Global Principle for Macaulay Posets.
Order, 1999

A Kruskal-Katona Type Theorem for the Linear Lattice.
Eur. J. Comb., 1999

On an equivalence in discrete extremal problems.
Discret. Math., 1999

On k-partitioning of Hamming Graphs.
Discret. Appl. Math., 1999

Optimal Cuts for Powers of the Petersen Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

On Bounds for the k-Partitioning of Graphs.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
On Posets whose Products are Macaulay.
J. Comb. Theory A, 1998

The Cyclic Wirelength of Trees.
Discret. Appl. Math., 1998

Embedding ladders and caterpillars into the hypercube.
Discret. Appl. Math., 1998

Embedding of Hypercubes into Grids.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Permutation admissibility in shuffle-exchange networks with arbitrary number of stages.
Proceedings of the 5th International Conference On High Performance Computing, 1998

1997
On Partitioning Grids into Equal Parts.
Comput. Artif. Intell., 1997

On the Embedding of Refinements of 2-dimensional Grids.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
On k-Partitioning the n-Cube.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995
On Central Spanning Trees of a Graph.
Proceedings of the Combinatorics and Computer Science, 1995

1994
On Oriented Embedding of the Binary tree into the Hypercube.
Comb. Probab. Comput., 1994

1993
On Edge Numberings of the <i>n</i>-Cube Graph.
Discret. Appl. Math., 1993


  Loading...