Meng-Tsung Tsai
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
22
Venues
12
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
22 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Determining the Outerthickness of Graphs Is NP-Hard. | Pin-Hsian Lee, Te-Cheng Liu, Meng-Tsung Tsai |
| 2025 | CIAC | Supereulerian Testing on Semi-Eulerian Graphs. | Wing-Kai Hon, Meng-Tsung Tsai, Ching-Yu Yang |
| 2025 | FCT | Computing Diverse and Nice Triangulations. | Waldo Glvez, Mayank Goswami, Arturo Merino, GiBeom Park, Meng-Tsung Tsai |
| 2025 | WADS | Parameterized Streaming Algorithms for Topological Sorting. | Ho-Lin Chen, Peng-Ting Lin, Meng-Tsung Tsai |
| 2025 | WADS | On the Complexity of Finding 1-Center Spanning Trees. | Pin-Hsian Lee, Meng-Tsung Tsai, Hung-Lung Wang |
| 2024 | IWOCA | 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 |
| 2023 | MFCS | Dependent k-Set Packing on Polynomoids. | Meng-Tsung Tsai, Shi-Chun Tsai, Tsung-Ta Wu |
| 2023 | WADS | Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs. | Wing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang |
| 2022 | LATIN | Obtaining Approximately Optimal and Diverse Solutions via Dispersion. | Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang |
| 2021 | COCOON | Single-Pass Streaming Algorithms to Partition Graphs into Few Forests. | Cheng-Hung Chiang, Meng-Tsung Tsai |
| 2020 | STACS | Streaming Complexity of Spanning Tree Computation. | Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai |
| 2019 | SODA | Optimal Ball Recycling. | Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai |
| 2018 | ISAAC | A Dichotomy Result for Cyclic-Order Traversing Games. | Yen-Ting Chen, Meng-Tsung Tsai, Shi-Chun Tsai |
| 2018 | ISAAC | Streaming Algorithms for Planar Convex Hulls. | Martin Farach-Colton, Meng Li, Meng-Tsung Tsai |
| 2017 | SODA | Cross-Referenced Dictionaries and the Limits of Write Optimization. | Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai |
| 2016 | LATIN | Tight Approximations of Degeneracy in Large Graphs. | Martin Farach-Colton, Meng-Tsung Tsai |
| 2015 | ISAAC | On the Complexity of Computing Prime Tables. | Martin Farach-Colton, Meng-Tsung Tsai |
| 2015 | WADS | Finding Articulation Points of Large Graphs in Linear Time. | Martin Farach-Colton, Tsan-sheng Hsu, Meng Li, Meng-Tsung Tsai |
| 2014 | ESA | The Batched Predecessor Problem in External Memory. | Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai |
| 2014 | LATIN | Computing the Degeneracy of Large Graphs. | Martin Farach-Colton, Meng-Tsung Tsai |
| 2013 | ISAAC | Exact Sublinear Binomial Sampling. | Martin Farach-Colton, Meng-Tsung Tsai |
| 2010 | COCOON | Heterogeneous Subset Sampling. | Meng-Tsung Tsai, Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu |