Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bezrukov, Sergei L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple proof of the Karakhanyan-Riordan theorem on the even discrete torus
Sergei L. Bezrukov
,
Uwe Leck
SIAM Journal on Discrete Mathematics
23
(3), 2009, pp. 1416-1421
A new approach to Macaulay posets
Sergei L. Bezrukov
,
Victor P. Piotrowski
,
Thomas J. Pfaff
Journal of Combinatorial Theory Series A
105
(2), 2004, pp. 161-184
Edge-isoperimetric problems for Cartesian powers of regular graphs
Sergei L. Bezrukov
,
Robert Elsässer
Theoretical Computer Science
307
(3), 2003, pp. 473-492
Edge-isoperimetric problems for Cartesian powers of regular graphs
Sergei L. Bezrukov
,
Robert Elsässer
Lecture Notes in Computer Science
2204
, 2001, pp. 9-20
Embedding complete trees into the hypercube
Sergei L. Bezrukov
Discrete Applied Mathematics
110
(2-3), 2001, pp. 101-119
New spectral lower bounds on the bisection width of graphs
Sergei L. Bezrukov
,
Robert Elsässer
,
Burkhard Monien
,
Robert Preis
,
Jean-Pierre Tillich
Lecture Notes in Computer Science
1928
, 2000, pp. 23-34
The spider poset is Macaulay
Sergei L. Bezrukov
,
Robert Elsässer
Journal of Combinatorial Theory Series A
90
(1), 2000, pp. 1-26
Optimal cuts for powers of the Petersen graph
Sergei L. Bezrukov
,
Sajal K. Das
,
Robert Elsässer
Lecture Notes in Computer Science
1665
, 1999, pp. 228-239
On posets whose products are Macaulay
Sergei L. Bezrukov
Journal of Combinatorial Theory Series A
84
(2), 1998, pp. 157-170