Heterogeneous Subset Sampling. - Meng-Tsung Tsai; Da-Wei Wang 004; Churn-Jung Liau; Tsan-sheng Hsu (COCOON, 2010)

Game Tree Search with Adaptive Resolution. - Hung-Jui Chang; Meng-Tsung Tsai; Tsan-sheng Hsu (ACG, 2011)

The Batched Predecessor Problem in External Memory. - Michael A. Bender; Martin Farach-Colton; Mayank Goswami 001; Dzejla Medjedovic; Pablo Montes; Meng-Tsung Tsai (ESA, 2014)

Computing the Degeneracy of Large Graphs. - Martin Farach-Colton; Meng-Tsung Tsai (LATIN, 2014)

On the Complexity of Computing Prime Tables. - Martin Farach-Colton; Meng-Tsung Tsai (ISAAC, 2015)

Finding Articulation Points of Large Graphs in Linear Time. - Martin Farach-Colton; Tsan-sheng Hsu; Meng Li; Meng-Tsung Tsai (WADS, 2015)

Exact Sublinear Binomial Sampling. - Martin Farach-Colton; Meng-Tsung Tsai (Algorithmica, 2015)

Tight Approximations of Degeneracy in Large Graphs. - Martin Farach-Colton; Meng-Tsung Tsai (LATIN, 2016)

Cross-Referenced Dictionaries and the Limits of Write Optimization. - Peyman Afshani; Michael A. Bender; Martin Farach-Colton; Jeremy T. Fineman; Mayank Goswami 001; Meng-Tsung Tsai (SODA, 2017)

A Dichotomy Result for Cyclic-Order Traversing Games. - Yen-Ting Chen; Meng-Tsung Tsai; Shi-Chun Tsai (ISAAC, 2018)

Streaming Algorithms for Planar Convex Hulls. - Martin Farach-Colton; Meng Li; Meng-Tsung Tsai (ISAAC, 2018)

Syntactic Separation of Subset Satisfiability Problems. - Eric Allender; Martin Farach-Colton; Meng-Tsung Tsai (APPROX-RANDOM, 2019)

Optimal Ball Recycling. - Michael A. Bender; Jake Christensen; Alex Conway 001; Martin Farach-Colton; Rob Johnson 001; Meng-Tsung Tsai (SODA, 2019)

Streaming Complexity of Spanning Tree Computation. - Yi-Jun Chang; Martin Farach-Colton; Tsan-sheng Hsu; Meng-Tsung Tsai (STACS, 2020)

Single-Pass Streaming Algorithms to Partition Graphs into Few Forests. - Cheng-Hung Chiang; Meng-Tsung Tsai (COCOON, 2021)

Obtaining Approximately Optimal and Diverse Solutions via Dispersion. - Jie Gao 001; Mayank Goswami 001; Karthik C. S. 001; Meng-Tsung Tsai; Shih-Yu Tsai; Hao-Tsung Yang (LATIN, 2022)

Dependent k-Set Packing on Polynomoids. - Meng-Tsung Tsai; Shi-Chun Tsai; Tsung-Ta Wu (MFCS, 2023)

Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs. - Wing-Kai Hon; Meng-Tsung Tsai; Hung-Lung Wang (WADS, 2023)

Guest Editors' Foreword. - Wing-Kai Hon; Chung-Shou Liao; Meng-Tsung Tsai (Int. J. Comput. Geom. Appl., 2023)

Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries. - Kuo-Kai Lee; Wing-Kai Hon; Chung-Shou Liao; Kunihiko Sadakane; Meng-Tsung Tsai (Int. J. Comput. Geom. Appl., 2023)

Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers. - Tong-Nong Lin; Yu-Cheng Lin; Cheng-Chen Tsai; Meng-Tsung Tsai; Shih-Yu Tsai (IWOCA, 2024)

Supereulerian Testing on Semi-Eulerian Graphs. - Wing-Kai Hon; Meng-Tsung Tsai; Ching-Yu Yang (CIAC (2), 2025)

Parameterized Streaming Algorithms for Topological Sorting. - Ho-Lin Chen; Peng-Ting Lin; Meng-Tsung Tsai (WADS, 2025)

On the Complexity of Finding 1-Center Spanning Trees. - Pin-Hsian Lee; Meng-Tsung Tsai; Hung-Lung Wang (WADS, 2025)

A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions. - Waldo Gálvez; Mayank Goswami 001; Arturo Merino; GiBeom Park; Meng-Tsung Tsai; Victor Verdugo (CoRR, 2025)

Computing Diverse and Nice Triangulations. - Waldo Gálvez; Mayank Goswami 001; Arturo Merino; GiBeom Park; Meng-Tsung Tsai (CoRR, 2025)