Yiu-Cho Leung

According to our database, Yiu-Cho Leung authored at least 5 papers between 2003 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

Permanents of Circulants: A Transfer Matrix Approach.

Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005

Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results.

Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang, Xuerong Yong

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters.

Mordecai J. Golin, Yiu-Cho Leung

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs.

Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Recurrence Relations on Transfer Matrices Yield Good Lower and Upper Bounds on the Channel Capacity of Some 2-Dimensional Constrained Systems (Extended Abstract).

Mordecai J. Golin, Yiu-Cho Leung

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003