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="Selkow, Stanley"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved bound for vertex partitions by connected monochromatic
k
-regular graphs
Gábor N. Sárközy
,
Stanley M. Selkow
,
Fei Song
Journal of Graph Theory
73
(2), 2013, pp. 127-145
Ramsey-type results for Gallai colorings
András Gyárfás
,
Gábor N. Sárközy
,
András Sebŏ
,
Stanley Selkow
Journal of Graph Theory
64
(3), 2010, pp. 233-243
Inequalities for the first-fit chromatic number
Zoltán Füredi
,
András Gyárfás
,
Gábor N. Sárközy
,
Stanley Selkow
Journal of Graph Theory
59
(1), 2008, pp. 75-88
On an anti-Ramsey problem of Burr, Erdŏs, Graham, and T. Soś
Gábor N. Sárközy
,
Stanley Selkow
Journal of Graph Theory
52
(2), 2006, pp. 147-156
An extension of the Ruzsa-Szemerédi theorem
Gábor N. Sárközy
,
Stanley Selkow
Combinatorica
25
(1), 2005, pp. 77-84
The complexity of the certification of properties of stable marriage
Daniel J. Dougherty
,
Stanley M. Selkow
Information Processing Letters
92
(6), 2004, pp. 275-277
An application of the regularity lemma in generalized Ramsey theory
Gábor N. Sárközy
,
Stanley M. Selkow
Journal of Graph Theory
44
(1), 2003, pp. 39-49
Vertex partitions by connected monochromatic
k
-regular graphs
Gábor N. Sárközy
,
Stanley M. Selkow
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 115-122
The average height of a node in the BANG abstract directory tree
Stephen Taylor
,
Nabil Hachem
,
Stanley Selkow
Information Processing Letters
61
(1), 1997, pp. 55-61
Some perfect coloring properties of graphs
Claude A. Christen
,
Stanley M. Selkow
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 49-59
One-pass complexity of digital picture properties
Stanley M. Selkow
Journal of the ACM
19
, 1972, pp. 283-295