Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Stanley M. Selkow
@article{DBLP:journals/gc/GyarfasSS15,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {Coverings by Few Monochromatic Pieces: {A} Transition Between Two
Ramsey Problems},
journal = {Graphs Comb.},
volume = {31},
number = {1},
pages = {131--140},
year = {2015},
url = {https://doi.org/10.1007/s00373-013-1372-2},
doi = {10.1007/S00373-013-1372-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GyarfasSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SarkozySS13,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow and
Fei Song},
title = {An Improved Bound for Vertex Partitions by Connected Monochromatic
K-Regular Graphs},
journal = {J. Graph Theory},
volume = {73},
number = {2},
pages = {127--145},
year = {2013},
url = {https://doi.org/10.1002/jgt.21661},
doi = {10.1002/JGT.21661},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SarkozySS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SarkozySS11,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow and
Fei Song},
title = {Vertex partitions of non-complete graphs into connected monochromatic
k-regular graphs},
journal = {Discret. Math.},
volume = {311},
number = {18-19},
pages = {2079--2084},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2011.05.031},
doi = {10.1016/J.DISC.2011.05.031},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SarkozySS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GyarfasSSS10,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Andr{\'{a}}s Seb{\"{o}} and
Stanley M. Selkow},
title = {Ramsey-type results for Gallai colorings},
journal = {J. Graph Theory},
volume = {64},
number = {3},
pages = {233--243},
year = {2010},
url = {https://doi.org/10.1002/jgt.20452},
doi = {10.1002/JGT.20452},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GyarfasSSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0021734,
author = {George T. Heineman and
Gary Pollice and
Stanley M. Selkow},
title = {Algorithms in a nutshell - a desktop quick reference},
publisher = {O'Reilly},
year = {2009},
url = {http://www.oreilly.de/catalog/9780596516246/index.html},
isbn = {978-0-596-51624-6},
timestamp = {Wed, 25 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0021734.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SarkozyS08,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {Distributing vertices along a Hamiltonian cycle in Dirac graphs},
journal = {Discret. Math.},
volume = {308},
number = {23},
pages = {5757--5770},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.10.042},
doi = {10.1016/J.DISC.2007.10.042},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SarkozyS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FurediGSS08,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {Inequalities for the first-fit chromatic number},
journal = {J. Graph Theory},
volume = {59},
number = {1},
pages = {75--88},
year = {2008},
url = {https://doi.org/10.1002/jgt.20327},
doi = {10.1002/JGT.20327},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FurediGSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SarkozyS06,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {On an anti-Ramsey problem of Burr, Erd{\"{o}}s, Graham, and T.
S{\'{o}}s},
journal = {J. Graph Theory},
volume = {52},
number = {2},
pages = {147--156},
year = {2006},
url = {https://doi.org/10.1002/jgt.20148},
doi = {10.1002/JGT.20148},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SarkozyS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SarkozyS05,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {On a Tur{\'{a}}n-type hypergraph problem of Brown, Erdos and
T. S{\'{o}}s},
journal = {Discret. Math.},
volume = {297},
number = {1-3},
pages = {190--195},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.05.002},
doi = {10.1016/J.DISC.2005.05.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SarkozyS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SarkozyS04,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {An Extension Of The Ruzsa-Szemer{\'{e}}di Theorem},
journal = {Comb.},
volume = {25},
number = {1},
pages = {77--84},
year = {2004},
url = {https://doi.org/10.1007/s00493-005-0006-6},
doi = {10.1007/S00493-005-0006-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SarkozyS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DoughertyS04,
author = {Daniel J. Dougherty and
Stanley M. Selkow},
title = {The complexity of the certification of properties of Stable Marriage},
journal = {Inf. Process. Lett.},
volume = {92},
number = {6},
pages = {275--277},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.09.006},
doi = {10.1016/J.IPL.2004.09.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DoughertyS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/SarkozyS03,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {On bipartite generalized Ramsey theory},
journal = {Ars Comb.},
volume = {68},
year = {2003},
timestamp = {Tue, 02 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/SarkozyS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SarkozySS03,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow and
Endre Szemer{\'{e}}di},
title = {On the number of Hamiltonian cycles in Dirac graphs},
journal = {Discret. Math.},
volume = {265},
number = {1-3},
pages = {237--250},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00582-4},
doi = {10.1016/S0012-365X(02)00582-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SarkozySS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SarkozyS03,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {An application of the regularity lemma in generalized Ramsey theory},
journal = {J. Graph Theory},
volume = {44},
number = {1},
pages = {39--49},
year = {2003},
url = {https://doi.org/10.1002/jgt.10129},
doi = {10.1002/JGT.10129},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SarkozyS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/SarkozyS01,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {On Edge Colorings with at Least q Colors in Every Subset of p Vertices},
journal = {Electron. J. Comb.},
volume = {8},
number = {1},
year = {2001},
url = {https://doi.org/10.37236/1553},
doi = {10.37236/1553},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/SarkozyS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/SarkozyS00,
author = {G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {Vertex Partitions by Connected Monochromatic k-Regular Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {78},
number = {1},
pages = {115--122},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1933},
doi = {10.1006/JCTB.1999.1933},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/SarkozyS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AtkinsSS99,
author = {Aron C. Atkins and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {Counting irregular multigraphs},
journal = {Discret. Math.},
volume = {195},
number = {1-3},
pages = {235--237},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00190-3},
doi = {10.1016/S0012-365X(98)00190-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AtkinsSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KiersteadSS99,
author = {Hal A. Kierstead and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Stanley M. Selkow},
title = {On \emph{k}-ordered Hamiltonian graphs},
journal = {J. Graph Theory},
volume = {32},
number = {1},
pages = {17--25},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199909)32:1\&\#60;17::AID-JGT2\&\#62;3.0.CO;2-G},
doi = {10.1002/(SICI)1097-0118(199909)32:1\&\#60;17::AID-JGT2\&\#62;3.0.CO;2-G},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KiersteadSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Selkow98,
author = {Stanley M. Selkow},
title = {The enumeration of labeled graphs by number of cutpoints},
journal = {Discret. Math.},
volume = {185},
number = {1-3},
pages = {183--191},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00170-2},
doi = {10.1016/S0012-365X(97)00170-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Selkow98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TaylorHS97,
author = {Steve Taylor and
Nabil I. Hachem and
Stanley M. Selkow},
title = {The Average Height of a Node in the {BANG} Abstract Directory Tree},
journal = {Inf. Process. Lett.},
volume = {61},
number = {1},
pages = {55--61},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(96)00187-1},
doi = {10.1016/S0020-0190(96)00187-1},
timestamp = {Tue, 27 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TaylorHS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChristenCS96,
author = {Claude A. Christen and
Giovanni Coray and
Stanley M. Selkow},
title = {A characterization of n-component graphs},
journal = {Discret. Math.},
volume = {149},
number = {1-3},
pages = {279--281},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00246-S},
doi = {10.1016/0012-365X(95)00246-S},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChristenCS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Selkow94,
author = {Stanley M. Selkow},
title = {A Probabilistic lower bound on the independence number of graphs},
journal = {Discret. Math.},
volume = {132},
number = {1-3},
pages = {363--365},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(93)00102-B},
doi = {10.1016/0012-365X(93)00102-B},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Selkow94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Selkow93,
author = {Stanley M. Selkow},
title = {The independence number of graphs in terms of degrees},
journal = {Discret. Math.},
volume = {122},
number = {1-3},
pages = {343--348},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90307-F},
doi = {10.1016/0012-365X(93)90307-F},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Selkow93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MurphyS90,
author = {O. J. Murphy and
Stanley M. Selkow},
title = {Finding Nearest Neighbors with Voronoi Tessellations},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {37--41},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90227-O},
doi = {10.1016/0020-0190(90)90227-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MurphyS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MurphyS86,
author = {O. J. Murphy and
Stanley M. Selkow},
title = {The Efficiency of Using k-d Trees for Finding Nearest Neighbors in
Discrete Space},
journal = {Inf. Process. Lett.},
volume = {23},
number = {4},
pages = {215--218},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90138-9},
doi = {10.1016/0020-0190(86)90138-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MurphyS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HughesS81,
author = {Charles E. Hughes and
Stanley M. Selkow},
title = {The Finite Power Property for Context-Free Languages},
journal = {Theor. Comput. Sci.},
volume = {15},
pages = {111--114},
year = {1981},
url = {https://doi.org/10.1016/0304-3975(81)90065-7},
doi = {10.1016/0304-3975(81)90065-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HughesS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BabaiES80,
author = {L{\'{a}}szl{\'{o}} Babai and
Paul Erd{\"{o}}s and
Stanley M. Selkow},
title = {Random Graph Isomorphism},
journal = {{SIAM} J. Comput.},
volume = {9},
number = {3},
pages = {628--635},
year = {1980},
url = {https://doi.org/10.1137/0209047},
doi = {10.1137/0209047},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BabaiES80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ChristenS79,
author = {Claude A. Christen and
Stanley M. Selkow},
title = {Some perfect coloring properties of graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {27},
number = {1},
pages = {49--59},
year = {1979},
url = {https://doi.org/10.1016/0095-8956(79)90067-4},
doi = {10.1016/0095-8956(79)90067-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ChristenS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Selkow78,
author = {Stanley M. Selkow},
title = {New Bounds for the Clique Number of a Graph},
journal = {Inf. Process. Lett.},
volume = {7},
number = {4},
pages = {173--174},
year = {1978},
url = {https://doi.org/10.1016/0020-0190(78)90061-3},
doi = {10.1016/0020-0190(78)90061-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Selkow78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Selkow77,
author = {Stanley M. Selkow},
title = {The Tree-to-Tree Editing Problem},
journal = {Inf. Process. Lett.},
volume = {6},
number = {6},
pages = {184--186},
year = {1977},
url = {https://doi.org/10.1016/0020-0190(77)90064-3},
doi = {10.1016/0020-0190(77)90064-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Selkow77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/NastanskySS74,
author = {Ludwig Nastansky and
Stanley M. Selkow and
Neil F. Stewart},
title = {Cost-minimal trees in directed acyclic graphs},
journal = {Z. Oper. Research},
volume = {18},
number = {1},
pages = {59--67},
year = {1974},
url = {https://doi.org/10.1007/BF01949715},
doi = {10.1007/BF01949715},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/NastanskySS74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/Selkow74,
author = {Stanley M. Selkow},
title = {Diagnostic Keys as a Representation for Context in Pattern Recognition},
journal = {{IEEE} Trans. Computers},
volume = {23},
number = {9},
pages = {970--971},
year = {1974},
url = {https://doi.org/10.1109/T-C.1974.224063},
doi = {10.1109/T-C.1974.224063},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/Selkow74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Selkow72,
author = {Stanley M. Selkow},
title = {One-Pass Complexity of Digital Picture Properties},
journal = {J. {ACM}},
volume = {19},
number = {2},
pages = {283--295},
year = {1972},
url = {https://doi.org/10.1145/321694.321701},
doi = {10.1145/321694.321701},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Selkow72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:58 CEST 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:
