default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArie Bialostocki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j20]Tanbir Ahmed, Arie Bialostocki, Thang Pham, Le Anh Vinh:
Power Sum Polynomials as Relaxed EGZ Polynomials. Integers 19: A49 (2019)- 2015
- [j19]Arie Bialostocki, Shoni Gilboa, Yehuda Roditty:
Anti-Ramsey numbers of small graphs. Ars Comb. 123: 41-53 (2015) - 2008
- [j18]Arie Bialostocki, Daniel Finkel, András Gyárfás:
Disjoint chorded cycles in graphs. Discret. Math. 308(23): 5886-5890 (2008) - [j17]Arie Bialostocki, Rasheed Sabar, Daniel Schaal:
On a Zero-Sum Generalization of a Variation of Schur's Equation. Graphs Comb. 24(6): 511-518 (2008) - 2007
- [j16]Arie Bialostocki, David J. Grynkiewicz:
On the Intersection of two m-sets and the Erdos-Ginzburg-Ziv Theorem. Ars Comb. 83 (2007) - 2006
- [j15]Arie Bialostocki, Mark J. Nielsen:
Minimum Sets Forcing Monochromatic Triangles. Ars Comb. 81 (2006) - 2005
- [j14]Arie Bialostocki, Rasheed Sabar:
On constrained 2-Partitions of monochromatic sets and generalizations in the sense of Erdos-Ginzburg-Ziv. Ars Comb. 76 (2005) - 2003
- [j13]Arie Bialostocki, William Voxman:
On Monochromatic-Rainbow Generalizations of Two Ramsey Type Theorems. Ars Comb. 68 (2003) - [j12]Arie Bialostocki, Guy Bialostocki, Daniel Schaal:
A zero-sum theorem. J. Comb. Theory A 101(1): 147-152 (2003) - 2001
- [j11]Arie Bialostocki, William Voxman:
Generalizations of some Ramsey-type theorems for matchings. Discret. Math. 239(1-3): 101-107 (2001) - 2000
- [j10]Arie Bialostocki, Daniel Schaal:
On a Variation of Schur Numbers. Graphs Comb. 16(2): 139-147 (2000) - 1996
- [j9]Arie Bialostocki, Hanno Lefmann, Terry Meerdink:
On the degree of regularity of some equations. Discret. Math. 150(1-3): 49-60 (1996) - 1995
- [j8]Arie Bialostocki, Paul Erdös, Hanno Lefmann:
Monochromatic and zero-sum sets of nondecreasing diameter. Discret. Math. 137(1-3): 19-34 (1995) - 1994
- [j7]Arie Bialostocki, P. Dierker:
On zero sum Ramsey numbers: Multiple copies of a graph. J. Graph Theory 18(2): 143-151 (1994) - 1992
- [j6]Arie Bialostocki, P. Dierker:
On the Erdös-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings. Discret. Math. 110(1-3): 1-8 (1992) - 1991
- [j5]Arie Bialostocki, P. Dierker:
An isoperimetric lemma. Discret. Math. 94(3): 221-228 (1991) - 1990
- [j4]Arie Bialostocki, P. Dierker, B. Voxman:
Some notes on the Erdös-Szekeres theorem. Discret. Math. 91(3): 231-238 (1990) - 1989
- [j3]E. Barbut, Arie Bialostocki:
A generalization of rotational tournaments. Discret. Math. 76(2): 81-87 (1989) - 1986
- [j2]Arie Bialostocki, Norbert Sauer:
On Ramsey-Turán type problems in tournaments. Discret. Math. 59(3): 221-228 (1986) - [j1]Arie Bialostocki:
An application of the Ramsey theorem to ordered r-tournaments. Discret. Math. 61(2-3): 325-328 (1986)
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 2024-06-10 21:24 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:
