Sergei L. Bezrukov

36 papers B 5Misc 2Journal 25Unranked 3
YearRankTypeTitle / Venue / Authors
2023 J jnl
Pull-push method: A new approach to edge-isoperimetric problems.
Discret. Math.
Sergei L. Bezrukov, Nikola Kuzmanovski, Jounglag Lim
2018 J jnl
New infinite family of regular edge-isoperimetric graphs.
Theor. Comput. Sci.
Sergei L. Bezrukov, Pavle Bulatovic, Nikola Kuzmanovski
2013 — conf
On Data Recovery in Distributed Databases.
Information Theory, Combinatorics, and Search Theory
Sergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski
2013 — ch.
Properties of Graded Posets Preserved by Some Operations.
The Mathematics of Paul Erdős II
Sergei L. Bezrukov, Konrad Engel
2009 J jnl
A Simple Proof of the Karakhanyan--Riordan Theorem on the Even Discrete Torus.
SIAM J. Discret. Math.
Sergei L. Bezrukov, Uwe Leck
2008 J jnl
On biclique coverings.
Discret. Math.
Sergei L. Bezrukov, Dalibor Froncek, Steven J. Rosenberg, Petr Kovár
2008 J jnl
On the bandwidth of 3-dimensional Hamming graphs.
Theor. Comput. Sci.
József Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress
2008 J jnl
The vertex isoperimetric problem for the powers of the diamond graph.
Discret. Math.
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
2007 J jnl
On partitioning of hypergraphs.
Discret. Math.
Sergei L. Bezrukov, Roberto Battiti
2004 J jnl
A new approach to Macaulay posets.
J. Comb. Theory A
Sergei L. Bezrukov, Victor P. Piotrowski, Thomas J. Pfaff
2004 J jnl
New spectral lower bounds on the bisection width of graphs.
Theor. Comput. Sci.
Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
2003 J jnl
Edge-isoperimetric problems for cartesian powers of regular graphs.
Theor. Comput. Sci.
Sergei L. Bezrukov, Robert Elsässer
2003 J jnl
Permutation routing in optical MIN with minimum number of stages.
J. Syst. Archit.
Nabanita Das, Bhargab B. Bhattacharya, Sergei L. Bezrukov
2002 J jnl
A local-global principle for vertex-isoperimetric problems.
Discret. Math.
Sergei L. Bezrukov, Oriol Serra
2001 B conf
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs.
WG
Sergei L. Bezrukov, Robert Elsässer
2001 J jnl
Embedding complete trees into the hypercube.
Discret. Appl. Math.
Sergei L. Bezrukov
2000 B conf
New Spectral Lower Bounds on the Bisection Width of Graphs.
WG
Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
2000 J jnl
The Spider Poset Is Macaulay.
J. Comb. Theory A
Sergei L. Bezrukov, Robert Elsässer
2000 J jnl
The congestion of
Discret. Math.
Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder
1999 J jnl
A Kruskal-Katona Type Theorem for the Linear Lattice.
Eur. J. Comb.
Sergei L. Bezrukov, Aart Blokhuis
1999 J jnl
A Local-Global Principle for Macaulay Posets.
Order
Sergei L. Bezrukov, Xavier Portas, Oriol Serra
1999 Misc conf
On Bounds for the k-Partitioning of Graphs.
COCOON
Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder
1999 J jnl
On an equivalence in discrete extremal problems.
Discret. Math.
Sergei L. Bezrukov
1999 J jnl
On k-partitioning of Hamming Graphs.
Discret. Appl. Math.
Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder
1999 B conf
Optimal Cuts for Powers of the Petersen Graph.
WG
Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer
1998 J jnl
Embedding ladders and caterpillars into the hypercube.
Discret. Appl. Math.
Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung
1998 B conf
Embedding of Hypercubes into Grids.
MFCS
Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder
1998 J jnl
On Posets whose Products are Macaulay.
J. Comb. Theory A
Sergei L. Bezrukov
1998 Misc conf
Permutation admissibility in shuffle-exchange networks with arbitrary number of stages.
HiPC
Nabanita Das, Bhargab B. Bhattacharya, Rekha Menon, Sergei L. Bezrukov
1998 J jnl
The Cyclic Wirelength of Trees.
Discret. Appl. Math.
Sergei L. Bezrukov, Ulf-Peter Schroeder
1997 J jnl
On Partitioning Grids into Equal Parts.
Comput. Artif. Intell.
Sergei L. Bezrukov, Branislav Rovan
1997 — conf
On the Embedding of Refinements of 2-dimensional Grids.
Euro-Par
Fabrizio d'Amore, Luca Becchetti, Sergei L. Bezrukov, Alberto Marchetti-Spaccamela, M. Ottaviani, Robert Preis, Markus Röttger, Ulf-Peter Schroeder
1996 B conf
On k-Partitioning the n-Cube.
WG
Sergei L. Bezrukov
1995 — conf
On Central Spanning Trees of a Graph.
Combinatorics and Computer Science
Sergei L. Bezrukov, Firoz Kaderali, Werner Poguntke
1994 J jnl
On Oriented Embedding of the Binary tree into the Hypercube.
Comb. Probab. Comput.
Sergei L. Bezrukov
1993 J jnl
On Edge Numberings of the
Discret. Appl. Math.
Sergei L. Bezrukov, Norbert Grünwald, Karl Weber