Stephen Suen

According to our database1, Stephen Suen authored at least 22 papers between 1990 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
Graph products and integer domination.
Discrete Mathematics, 2013

2012
An Improved Inequality Related to Vizing's Conjecture.
Electr. J. Comb., 2012

2010
Some Results for the Acceptance Urn Model.
SIAM J. Discrete Math., 2010

The Enumeration of Sequences with Restrictions on their Partial Sums.
Electr. J. Comb., 2010

2008
Reducing the Energy Consumption of Ethernet with Adaptive Link Rate (ALR).
IEEE Trans. Computers, 2008

2006
Ethernet Adaptive Link Rate (ALR): Analysis of a Buffer Threshold Policy.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2003
Application of Upper and Lower Bounds for the Domination Number to Vizing's Conjecture.
Ars Comb., 2003

2000
Inequality Related to Vizing's Conjecture.
Electr. J. Comb., 2000

Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II.
Electr. J. Comb., 2000

1996
Analysis of Two Simple Heuristics on a Random Instance of k-SAT.
J. Algorithms, 1996

An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
On the Size of a Random Maximal Graph.
Random Struct. Algorithms, 1995

Randomized Greedy Matching II.
Random Struct. Algorithms, 1995

Ordering Clone Libraries in Computational Biology.
Journal of Computational Biology, 1995

1994
On the Independence Number of Random Cubic Graphs.
Random Struct. Algorithms, 1994

The Probability of Unique Solutions of Sequencing by Hybridization.
Journal of Computational Biology, 1994

Optimal Construction of Edge-Disjoint Paths in Random Graphs.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

On the Greedy Heuristic for Matchings.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
On depth first search trees in m-out digraphs.
Combinatorica, 1993

Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
Counting the Number of Hamilton Cycles in Random Digraphs.
Random Struct. Algorithms, 1992

1990
A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph.
Random Struct. Algorithms, 1990


  Loading...