| 2008 |
|---|
| 29 | EE | Sergei L. Bezrukov,
Miquel Rius,
Oriol Serra:
The vertex isoperimetric problem for the powers of the diamond graph.
Discrete Mathematics 308(11): 2067-2074 (2008) |
| 28 | EE | Sergei L. Bezrukov,
Dalibor Froncek,
Steven J. Rosenberg,
Petr Kovár:
On biclique coverings.
Discrete Mathematics 308(2-3): 319-323 (2008) |
| 27 | EE | J. Balogh,
Sergei L. Bezrukov,
L. H. Harper,
Ákos Seress:
On the bandwidth of 3-dimensional Hamming graphs.
Theor. Comput. Sci. 407(1-3): 488-495 (2008) |
| 2007 |
|---|
| 26 | EE | Sergei L. Bezrukov,
Roberto Battiti:
On partitioning of hypergraphs.
Discrete Mathematics 307(14): 1737-1753 (2007) |
| 2004 |
|---|
| 25 | EE | Sergei L. Bezrukov,
Victor P. Piotrowski,
Thomas J. Pfaff:
A new approach to Macaulay posets.
J. Comb. Theory, Ser. A 105(2): 161-184 (2004) |
| 24 | EE | Sergei L. Bezrukov,
Robert Elsässer,
Burkhard Monien,
Robert Preis,
Jean-Pierre Tillich:
New spectral lower bounds on the bisection width of graphs.
Theor. Comput. Sci. 320(2-3): 155-174 (2004) |
| 2003 |
|---|
| 23 | EE | Nabanita Das,
Bhargab B. Bhattacharya,
Sergei L. Bezrukov:
Permutation routing in optical MIN with minimum number of stages.
Journal of Systems Architecture 48(11-12): 311-323 (2003) |
| 22 | EE | Sergei L. Bezrukov,
Robert Elsässer:
Edge-isoperimetric problems for cartesian powers of regular graphs.
Theor. Comput. Sci. 307(3): 473-492 (2003) |
| 2002 |
|---|
| 21 | EE | Sergei L. Bezrukov,
Oriol Serra:
A local-global principle for vertex-isoperimetric problems.
Discrete Mathematics 257(2-3): 285-309 (2002) |
| 2001 |
|---|
| 20 | EE | Sergei L. Bezrukov,
Robert Elsässer:
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs.
WG 2001: 9-20 |
| 19 | | Sergei L. Bezrukov:
Embedding complete trees into the hypercube.
Discrete Applied Mathematics 110(2-3): 101-119 (2001) |
| 2000 |
|---|
| 18 | EE | Sergei L. Bezrukov,
Robert Elsässer,
Burkhard Monien,
Robert Preis,
Jean-Pierre Tillich:
New Spectral Lower Bounds on the Bisection Width of Graphs.
WG 2000: 23-34 |
| 17 | EE | Sergei L. Bezrukov,
Joe D. Chavez,
L. H. Harper,
Markus Röttger,
Ulf-Peter Schroeder:
The congestion of n-cube layout on a rectangular grid.
Discrete Mathematics 213(1-3): 13-19 (2000) |
| 16 | EE | Sergei L. Bezrukov,
Robert Elsässer:
The Spider Poset Is Macaulay.
J. Comb. Theory, Ser. A 90(1): 1-26 (2000) |
| 1999 |
|---|
| 15 | EE | Sergei L. Bezrukov,
Robert Elsässer,
Ulf-Peter Schroeder:
On Bounds for the k-Partitioning of Graphs.
COCOON 1999: 154-163 |
| 14 | EE | Sergei L. Bezrukov,
Sajal K. Das,
Robert Elsässer:
Optimal Cuts for Powers of the Petersen Graph.
WG 1999: 228-239 |
| 13 | EE | Sergei L. Bezrukov,
Robert Elsässer,
Ulf-Peter Schroeder:
On k-partitioning of Hamming Graphs.
Discrete Applied Mathematics 95(1-3): 127-140 (1999) |
| 12 | EE | Sergei L. Bezrukov:
On an equivalence in discrete extremal problems.
Discrete Mathematics 203(1-3): 9-22 (1999) |
| 11 | EE | Sergei L. Bezrukov,
Aart Blokhuis:
A Kruskal-Katona Type Theorem for the Linear Lattice.
Eur. J. Comb. 20(2): 123-130 (1999) |
| 1998 |
|---|
| 10 | EE | Sergei L. Bezrukov,
Joe D. Chavez,
L. H. Harper,
Markus Röttger,
Ulf-Peter Schroeder:
Embedding of Hypercubes into Grids.
MFCS 1998: 693-701 |
| 9 | EE | Sergei L. Bezrukov,
Burkhard Monien,
Walter Unger,
Gerd Wechsung:
Embedding ladders and caterpillars into the hypercube.
Discrete Applied Mathematics 83(1-3): 21-29 (1998) |
| 8 | EE | Sergei L. Bezrukov,
Ulf-Peter Schroeder:
The Cyclic Wirelength of Trees.
Discrete Applied Mathematics 87(1-3): 275-277 (1998) |
| 7 | EE | Sergei L. Bezrukov:
On Posets whose Products are Macaulay.
J. Comb. Theory, Ser. A 84(2): 157-170 (1998) |
| 1997 |
|---|
| 6 | | Fabrizio d'Amore,
Luca Becchetti,
Sergei L. Bezrukov,
Alberto Marchetti-Spaccamela,
M. Ottaviani,
Robert Preis,
Markus Röttger,
Ulf-Peter Schroeder:
On the Embedding of Refinements of 2-dimensional Grids.
Euro-Par 1997: 950-957 |
| 5 | | Sergei L. Bezrukov,
Branislav Rovan:
On Partitioning Grids into Equal Parts.
Computers and Artificial Intelligence 16(2): (1997) |
| 1996 |
|---|
| 4 | | Sergei L. Bezrukov:
On k-Partitioning the n-Cube.
WG 1996: 44-55 |
| 1995 |
|---|
| 3 | | Sergei L. Bezrukov,
Firoz Kaderali,
W. Poguntke:
On Central Spanning Trees of a Graph.
Combinatorics and Computer Science 1995: 53-57 |
| 1994 |
|---|
| 2 | | Sergei L. Bezrukov:
On Oriented Embedding of the Binary tree into the Hypercube.
Combinatorics, Probability & Computing 3: 27-38 (1994) |
| 1993 |
|---|
| 1 | EE | Sergei L. Bezrukov,
Norbert Grünwald,
Karl Weber:
On Edge Numberings of the n-Cube Graph.
Discrete Applied Mathematics 46(2): 99-116 (1993) |
