default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergei L. Bezrukov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j25]Sergei L. Bezrukov, Nikola Kuzmanovski
, Jounglag Lim:
Pull-push method: A new approach to edge-isoperimetric problems. Discret. Math. 346(12): 113632 (2023)
2010 – 2019
- 2018
- [j24]Sergei L. Bezrukov, Pavle Bulatovic, Nikola Kuzmanovski:
New infinite family of regular edge-isoperimetric graphs. Theor. Comput. Sci. 721: 42-53 (2018) - 2013
- [c10]Sergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski:
On Data Recovery in Distributed Databases. Information Theory, Combinatorics, and Search Theory 2013: 419-431 - [p1]Sergei L. Bezrukov, Konrad Engel:
Properties of Graded Posets Preserved by Some Operations. The Mathematics of Paul Erdős II 2013: 39-46
2000 – 2009
- 2009
- [j23]Sergei L. Bezrukov, Uwe Leck:
A Simple Proof of the Karakhanyan--Riordan Theorem on the Even Discrete Torus. SIAM J. Discret. Math. 23(3): 1416-1421 (2009) - 2008
- [j22]Sergei L. Bezrukov, Dalibor Froncek, Steven J. Rosenberg, Petr Kovár:
On biclique coverings. Discret. Math. 308(2-3): 319-323 (2008) - [j21]Sergei L. Bezrukov, Miquel Rius, Oriol Serra:
The vertex isoperimetric problem for the powers of the diamond graph. Discret. Math. 308(11): 2067-2074 (2008) - [j20]József 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
- [j19]Sergei L. Bezrukov, Roberto Battiti:
On partitioning of hypergraphs. Discret. Math. 307(14): 1737-1753 (2007) - 2004
- [j18]Sergei L. Bezrukov, Victor P. Piotrowski, Thomas J. Pfaff:
A new approach to Macaulay posets. J. Comb. Theory A 105(2): 161-184 (2004) - [j17]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
- [j16]Nabanita Das, Bhargab B. Bhattacharya, Sergei L. Bezrukov:
Permutation routing in optical MIN with minimum number of stages. J. Syst. Archit. 48(11-12): 311-323 (2003) - [j15]Sergei L. Bezrukov, Robert Elsässer:
Edge-isoperimetric problems for cartesian powers of regular graphs. Theor. Comput. Sci. 307(3): 473-492 (2003) - 2002
- [j14]Sergei L. Bezrukov, Oriol Serra:
A local-global principle for vertex-isoperimetric problems. Discret. Math. 257(2-3): 285-309 (2002) - 2001
- [j13]Sergei L. Bezrukov:
Embedding complete trees into the hypercube. Discret. Appl. Math. 110(2-3): 101-119 (2001) - [c9]Sergei L. Bezrukov, Robert Elsässer:
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. WG 2001: 9-20 - 2000
- [j12]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. Discret. Math. 213(1-3): 13-19 (2000) - [j11]Sergei L. Bezrukov, Robert Elsässer:
The Spider Poset Is Macaulay. J. Comb. Theory A 90(1): 1-26 (2000) - [c8]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
1990 – 1999
- 1999
- [j10]Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder:
On k-partitioning of Hamming Graphs. Discret. Appl. Math. 95(1-3): 127-140 (1999) - [j9]Sergei L. Bezrukov:
On an equivalence in discrete extremal problems. Discret. Math. 203(1-3): 9-22 (1999) - [j8]Sergei L. Bezrukov, Aart Blokhuis:
A Kruskal-Katona Type Theorem for the Linear Lattice. Eur. J. Comb. 20(2): 123-130 (1999) - [j7]Sergei L. Bezrukov, Xavier Portas, Oriol Serra:
A Local-Global Principle for Macaulay Posets. Order 16(1): 57-76 (1999) - [c7]Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder:
On Bounds for the k-Partitioning of Graphs. COCOON 1999: 154-163 - [c6]Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer:
Optimal Cuts for Powers of the Petersen Graph. WG 1999: 228-239 - 1998
- [j6]Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung:
Embedding ladders and caterpillars into the hypercube. Discret. Appl. Math. 83(1-3): 21-29 (1998) - [j5]Sergei L. Bezrukov, Ulf-Peter Schroeder:
The Cyclic Wirelength of Trees. Discret. Appl. Math. 87(1-3): 275-277 (1998) - [j4]Sergei L. Bezrukov:
On Posets whose Products are Macaulay. J. Comb. Theory A 84(2): 157-170 (1998) - [c5]Nabanita Das, Bhargab B. Bhattacharya, Rekha Menon, Sergei L. Bezrukov:
Permutation admissibility in shuffle-exchange networks with arbitrary number of stages. HiPC 1998: 270-276 - [c4]Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder:
Embedding of Hypercubes into Grids. MFCS 1998: 693-701 - 1997
- [j3]Sergei L. Bezrukov, Branislav Rovan:
On Partitioning Grids into Equal Parts. Comput. Artif. Intell. 16(2): 153-165 (1997) - [c3]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 - 1996
- [c2]Sergei L. Bezrukov:
On k-Partitioning the n-Cube. WG 1996: 44-55 - 1995
- [c1]Sergei L. Bezrukov, Firoz Kaderali, Werner Poguntke:
On Central Spanning Trees of a Graph. Combinatorics and Computer Science 1995: 53-57 - 1994
- [j2]Sergei L. Bezrukov:
On Oriented Embedding of the Binary tree into the Hypercube. Comb. Probab. Comput. 3: 27-38 (1994) - 1993
- [j1]Sergei L. Bezrukov, Norbert Grünwald, Karl Weber:
On Edge Numberings of the n-Cube Graph. Discret. Appl. Math. 46(2): 99-116 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
