Meng-Tsung Tsai

collaborators

3 papers

cs.DS2026

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model

Yu-Sheng Shih, Meng-Tsung Tsai, Yen-Chu Tsai +1

We study the space complexity of four variants of the standard subgraph finding problem in the streaming model. Specifically, given an $n$ -vertex input graph and a fixed-size patte…

cs.CG2025

Computing Diverse and Nice Triangulations

Waldo GÃ¡lvez, Mayank Goswami, Arturo Merino +2

We initiate the study of computing diverse triangulations to a given polygon. Given a simple $n$ -gon $P$ , an integer $k \geq 2$ , a quality measure $I ¨ $ on the set of triangulatio…

cs.CG2025

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems

Waldo GÃ¡lvez, Mayank Goswami, Arturo Merino +3

There has been considerable recent interest in computing a diverse collection of solutions to a given optimization problem, both in the AI and theory communities. Given a classical…