default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen Suen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j19]Niluk John, Stephen Suen:
Graph products and integer domination. Discret. Math. 313(3): 217-224 (2013)- 2012
- [j18]Stephen Suen, Jennifer Tarr:
An Improved Inequality Related to Vizing's Conjecture. Electron. J. Comb. 19(1): 8 (2012) - 2010
- [j17]Stephen Suen, Kevin P. Wagner:
The Enumeration of Sequences with Restrictions on their Partial Sums. Electron. J. Comb. 17(1) (2010) - [j16]Stephen Suen, Kevin P. Wagner:
Some Results for the Acceptance Urn Model. SIAM J. Discret. Math. 24(3): 876-891 (2010)
2000 – 2009
- 2008
- [j15]Chamara Gunaratne, Kenneth J. Christensen, Bruce Nordman, Stephen Suen:
Reducing the Energy Consumption of Ethernet with Adaptive Link Rate (ALR). IEEE Trans. Computers 57(4): 448-461 (2008) - 2006
- [c5]Chamara Gunaratne, Kenneth J. Christensen, Stephen Suen:
Ethernet Adaptive Link Rate (ALR): Analysis of a Buffer Threshold Policy. GLOBECOM 2006 - 2003
- [j14]William Edwin Clark, Mourad E. H. Ismail, Stephen Suen:
Application of Upper and Lower Bounds for the Domination Number to Vizing's Conjecture. Ars Comb. 69 (2003) - 2000
- [j13]William Edwin Clark, Larry A. Dunning, Stephen Suen:
Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II. Electron. J. Comb. 7 (2000) - [j12]William Edwin Clark, Stephen Suen:
Inequality Related to Vizing's Conjecture. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1998
- [j11]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
Optimal Construction of Edge-Disjoint Paths in Random Graphs. SIAM J. Comput. 28(2): 541-573 (1998) - 1996
- [j10]Alan M. Frieze
, Stephen Suen:
Analysis of Two Simple Heuristics on a Random Instance of k-SAT. J. Algorithms 20(2): 312-355 (1996) - [c4]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. SODA 1996: 261-268 - 1995
- [j9]Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. Comb. Probab. Comput. 4: 47-66 (1995) - [j8]Martin E. Dyer, Alan M. Frieze, Stephen Suen:
Ordering Clone Libraries in Computational Biology. J. Comput. Biol. 2(2): 207-218 (1995) - [j7]Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen:
Randomized Greedy Matching II. Random Struct. Algorithms 6(1): 55-74 (1995) - [j6]Paul Erdös, Stephen Suen, Peter Winkler:
On the Size of a Random Maximal Graph. Random Struct. Algorithms 6(2/3): 309-318 (1995) - 1994
- [j5]Martin E. Dyer, Alan M. Frieze, Stephen Suen:
The Probability of Unique Solutions of Sequencing by Hybridization. J. Comput. Biol. 1(2): 105-110 (1994) - [j4]Alan M. Frieze, Stephen Suen:
On the Independence Number of Random Cubic Graphs. Random Struct. Algorithms 5(5): 649-664 (1994) - [c3]Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen:
On the Greedy Heuristic for Matchings. SODA 1994: 141-149 - [c2]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA 1994: 603-612 - 1993
- [j3]Stephen Suen:
On depth first search trees in m-out digraphs. Comb. 13(2): 209-229 (1993) - [c1]Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. SODA 1993: 341-351 - 1992
- [j2]Alan M. Frieze, Stephen Suen:
Counting the Number of Hamilton Cycles in Random Digraphs. Random Struct. Algorithms 3(3): 235-242 (1992) - 1990
- [j1]Stephen Suen:
A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph. Random Struct. Algorithms 1(2): 231-242 (1990)
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-04-24 22:50 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:
