Lap Chi Lau

1.4k total citations
43 papers, 633 citations indexed

About

Lap Chi Lau is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Lap Chi Lau has authored 43 papers receiving a total of 633 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 20 papers in Computer Networks and Communications and 11 papers in Electrical and Electronic Engineering. Recurrent topics in Lap Chi Lau's work include Complexity and Algorithms in Graphs (28 papers), Advanced Graph Theory Research (24 papers) and Cooperative Communication and Network Coding (7 papers). Lap Chi Lau is often cited by papers focused on Complexity and Algorithms in Graphs (28 papers), Advanced Graph Theory Research (24 papers) and Cooperative Communication and Network Coding (7 papers). Lap Chi Lau collaborates with scholars based in Hong Kong, Canada and United States. Lap Chi Lau's co-authors include Mohit Singh, Zongpeng Li, Baochun Li, Yuk Hei Chan, Ho Yee Cheung, Mohammad R. Salavatipour, Joseph Naor, Derek G. Corneil, Tamás Király and Yin Tat Lee and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and Mathematical Programming.

In The Last Decade

Lap Chi Lau

41 papers receiving 591 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Lap Chi Lau Hong Kong	13	365	328	169	57	53	43	633
Joseph Cheriyan Canada	18	603 1.7×	678 2.1×	187 1.1×	100 1.8×	75 1.4×	62	917
Zeev Nutov Israel	17	517 1.4×	639 1.9×	114 0.7×	52 0.9×	68 1.3×	93	801
Andrea S. LaPaugh United States	12	401 1.1×	258 0.8×	178 1.1×	96 1.7×	34 0.6×	26	741
Ingo Althöfer Germany	9	146 0.4×	277 0.8×	90 0.5×	145 2.5×	101 1.9×	38	545
Linda Pagli Italy	14	244 0.7×	248 0.8×	156 0.9×	147 2.6×	78 1.5×	74	613
Martin Fürer United States	13	201 0.6×	473 1.4×	108 0.6×	294 5.2×	70 1.3×	38	744
Miroslav Chlebík Slovakia	12	125 0.3×	357 1.1×	37 0.2×	29 0.5×	42 0.8×	28	518
S. Poljak Czechia	10	106 0.3×	311 0.9×	77 0.5×	34 0.6×	31 0.6×	21	474
Pascal Schweitzer Germany	11	140 0.4×	207 0.6×	40 0.2×	86 1.5×	40 0.8×	38	415
Joseph G. Peters Canada	13	372 1.0×	186 0.6×	119 0.7×	40 0.7×	7 0.1×	48	559

Countries citing papers authored by Lap Chi Lau

Since Specialization

Citations

This map shows the geographic impact of Lap Chi Lau's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Lap Chi Lau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lap Chi Lau more than expected).

Fields of papers citing papers by Lap Chi Lau

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lap Chi Lau. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Lap Chi Lau. The network helps show where Lap Chi Lau may publish in the future.

Co-authorship network of co-authors of Lap Chi Lau

This figure shows the co-authorship network connecting the top 25 collaborators of Lap Chi Lau. A scholar is included among the top collaborators of Lap Chi Lau based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Lap Chi Lau. Lap Chi Lau is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Anari, Nima, et al.. (2018). Graph Clustering using Effective Resistance. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

2.

Chan, Siu On, et al.. (2017). Random walks and evolving sets: faster convergences and limitations. Symposium on Discrete Algorithms. 1849–1865. 1 indexed citations

3.

Lau, Lap Chi, et al.. (2017). Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile. SIAM Journal on Computing. 46(3). 890–910. 2 indexed citations

4.

Singh, Mohit & Lap Chi Lau. (2015). Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal. Journal of the ACM. 62(1). 1–19. 30 indexed citations

5.

Lau, Lap Chi, et al.. (2014). Lower Bounds on Expansions of Graph Powers. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

6.

Lau, Lap Chi, et al.. (2013). Improved Cheeger's inequality. 11–20. 23 indexed citations

7.

Lau, Lap Chi, et al.. (2013). Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. SIAM Journal on Computing. 42(3). 1185–1200. 1 indexed citations

8.

Lau, Lap Chi & Mohit Singh. (2013). Additive Approximation for Bounded Degree Survivable Network Design. SIAM Journal on Computing. 42(6). 2217–2242. 7 indexed citations

9.

Király, Tamás, Lap Chi Lau, & Mohit Singh. (2012). Degree bounded matroids and submodular flows. COMBINATORICA. 32(6). 703–720. 12 indexed citations

10.

Chan, Yuk Hei, et al.. (2011). Degree Bounded Network Design with Metric Costs. SIAM Journal on Computing. 40(4). 953–980. 7 indexed citations

11.

Harvey, Nicholas J. A., Tamás Király, & Lap Chi Lau. (2011). On Disjoint Common Bases in Two Matroids. SIAM Journal on Discrete Mathematics. 25(4). 1792–1803. 4 indexed citations

12.

Chan, Yuk Hei & Lap Chi Lau. (2010). On linear and semidefinite programming relaxations for hypergraph matching. Symposium on Discrete Algorithms. 1500–1511. 4 indexed citations

13.

Chan, Yuk Hei & Lap Chi Lau. (2010). On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. 1500–1511. 3 indexed citations

14.

Lau, Lap Chi, et al.. (2009). Computing Graph Roots Without Short Cycles. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations

15.

Lau, Lap Chi & Mohit Singh. (2008). Iterative Rounding and Relaxation. 1 indexed citations

16.

Király, Tamás & Lap Chi Lau. (2008). Approximate min–max theorems for Steiner rooted-orientations of graphs and hypergraphs. Journal of Combinatorial Theory Series B. 98(6). 1233–1252. 8 indexed citations

17.

Lau, Lap Chi & Mohit Singh. (2008). Additive approximation for bounded degree survivable network design. 759–768. 21 indexed citations

18.

Frank, András, Lap Chi Lau, & Jácint Szabó. (2007). A note on degree-constrained subgraphs. Discrete Mathematics. 308(12). 2647–2648. 4 indexed citations

19.

Lau, Lap Chi. (2004). Bipartite roots of graphs. Symposium on Discrete Algorithms. 952–961. 4 indexed citations

20.

Lau, Lap Chi. (2004). An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. 29. 61–70. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact