An Efficient Algorithm for the Longest Pattern Subsequence Problem. - Xiaodong Wang 003; Lei Wang 010; Yingjie Wu (BIOCOMP, 2008)

Efficiency, Fairness and Competitiveness in Nash Bargaining Games. - Deeparnab Chakrabarty; Gagan Goel; Vijay V. Vazirani; Lei Wang 010; Changyuan Yu (WINE, 2008)

Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models. - Vijay V. Vazirani; Lei Wang 010 (Electron. Colloquium Comput. Complex., 2008)

Optimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions - Gagan Goel; Pushkar Tripathi; Lei Wang 010 (CoRR, 2009)

An Optimal Algorithm for Prufer Codes. - Xiaodong Wang 003; Lei Wang 010; Yingjie Wu (J. Softw. Eng. Appl., 2009)

Combinatorial Problems with Discounted Price Functions in Multi-agent Systems. - Gagan Goel; Pushkar Tripathi; Lei Wang 010 (FSTTCS, 2010)

Single-Parameter Combinatorial Auctions with Partially Public Valuations. - Gagan Goel; Chinmay Karande; Lei Wang 010 (SAGT, 2010)

Speeding up the Algorithms for the Subset-Sum Problem with the Bitset Class. - Xiaodong Wang 003; Lei Wang 010; Yingjie Wu (Software Engineering Research and Practice, 2010)

Approximability of combinatorial problems with multi-agent submodular cost functions. - Gagan Goel; Chinmay Karande; Pushkar Tripathi; Lei Wang 010 (SIGecom Exch., 2010)

Black-Box Reductions in Mechanism Design. - Zhiyi Huang 002; Lei Wang 010; Yuan Zhou 007 (APPROX-RANDOM, 2011)

On the Approximation Ratio of k-Lookahead Auction. - Xue Chen 001; Guangda Hu; Pinyan Lu; Lei Wang 010 (WINE, 2011)

Some approximation algorithms for multi-agent systems. - Lei Wang 010 (2011)

Budget smoothing for internet ad auctions: a game theoretic approach. - Denis Xavier Charles; Deeparnab Chakrabarty; Max Chickering; Nikhil R. Devanur; Lei Wang 010 (EC, 2013)

Complete Solutions for a Combinatorial Puzzle in Linear Time. - Lei Wang 010; Xiaodong Wang 003; Yingjie Wu; Daxin Zhu (CoRR, 2013)

An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains - Lei Wang 010; Xiaodong Wang 003; Yingjie Wu; Daxin Zhu (CoRR, 2013)

A dynamic programming solution to a generalized LCS problem. - Lei Wang 010; Xiaodong Wang 003; Yingjie Wu; Daxin Zhu (Inf. Process. Lett., 2013)

An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints. - Yingjie Wu; Lei Wang 010; Daxin Zhu; Xiaodong Wang 003 (J. Discrete Algorithms, 2014)

Submodularity Helps in Nash and Nonsymmetric Bargaining Games. - Deeparnab Chakrabarty; Gagan Goel; Vijay V. Vazirani; Lei Wang 010; Changyuan Yu (SIAM J. Discret. Math., 2014)

An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-EC-LCS Problem. - Daxin Zhu; Lei Wang 010; Yingjie Wu; Xiaodong Wang 003 (ICA3PP (4), 2015)

An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints. - Daxin Zhu; Lei Wang 010; Yingjie Wu; Xiaodong Wang 003 (CoRR, 2015)

An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem. - Daxin Zhu; Lei Wang 010; Yingjie Wu; Xiaodong Wang 003 (CoRR, 2015)

A Practical O(Rlog log n+n) time Algorithm for Computing the Longest Common Subsequence. - Daxin Zhu; Lei Wang 010; Yingjie Wu; Xiaodong Wang 003 (CoRR, 2015)

A simple linear space algorithm for computing a longest common increasing subsequence. - Daxin Zhu; Lei Wang 010; Tinran Wang; Xiaodong Wang 003 (CoRR, 2016)

A note on the largest number of red nodes in red-black trees. - Daxin Zhu; Yingjie Wu; Lei Wang 010; Xiaodong Wang 003 (J. Discrete Algorithms, 2017)

A space efficient algorithm for the longest common subsequence in k-length substrings. - Daxin Zhu; Lei Wang 010; Tinran Wang; Xiaodong Wang 003 (Theor. Comput. Sci., 2017)

Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints. - Xiaodong Wang 003; Lei Wang 010; Daxin Zhu (J. Comput. Biol., 2019)