The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sergei L. Bezrukov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  27. On biclique coverings. [Citation Graph (, )][DBLP]


  28. The vertex isoperimetric problem for the powers of the diamond graph. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002