Meng-Tsung Tsai

Orcid: 0000-0002-2243-8666

According to our database1, Meng-Tsung Tsai authored at least 21 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries.
Int. J. Comput. Geom. Appl., 2023

Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 2023

Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Dependent k-Set Packing on Polynomoids.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Obtaining Approximately Optimal and Diverse Solutions via Dispersion.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Streaming Complexity of Spanning Tree Computation.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019
Optimal Ball Recycling.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Syntactic Separation of Subset Satisfiability Problems.
Proceedings of the Approximation, 2019

2018
Streaming Algorithms for Planar Convex Hulls.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

A Dichotomy Result for Cyclic-Order Traversing Games.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Cross-Referenced Dictionaries and the Limits of Write Optimization.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Tight Approximations of Degeneracy in Large Graphs.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Exact Sublinear Binomial Sampling.
Algorithmica, 2015

Finding Articulation Points of Large Graphs in Linear Time.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

On the Complexity of Computing Prime Tables.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
Computing the Degeneracy of Large Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Batched Predecessor Problem in External Memory.
Proceedings of the Algorithms - ESA 2014, 2014

2011
Game Tree Search with Adaptive Resolution.
Proceedings of the Advances in Computer Games - 13th International Conference, 2011

2010
Heterogeneous Subset Sampling.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010


  Loading...