Pattara Sukprasert

Orcid: 0000-0003-4624-7546

According to our database1, Pattara Sukprasert authored at least 10 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
To Store or Not to Store: a graph theoretical approach for Dataset Versioning.
CoRR, 2024

2023
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs.
CoRR, 2023

Constant Approximation for Individual Preference Stable Clustering.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Discovery and Matching Numerical Attributes in Data Lakes.
Proceedings of the IEEE International Conference on Big Data, 2023

2022
Individual Preference Stability for Clustering.
Proceedings of the International Conference on Machine Learning, 2022

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2020
Multi-transversals for Triangles and the Tuza's Conjecture.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2018
An n<sup>O(1/ϵ)</sup> Approximation Scheme For The Minimum Dominating Set In Unit Disk Graphs.
Proceedings of the 15th International Joint Conference on Computer Science and Software Engineering, 2018

2017
Finding All Useless Arcs in Directed Planar Graphs.
CoRR, 2017


  Loading...