default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPattara Sukprasert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. ALENEX 2024: 59-73- [c8]Anxin Guo, Jingwei Li, Pattara Sukprasert, Samir Khuller, Amol Deshpande, Koyel Mukherjee:
To Store or Not to Store: a graph theoretical approach for Dataset Versioning. IPDPS 2024: 479-493 - [i8]Anxin Guo, Jingwei Li, Pattara Sukprasert, Samir Khuller, Amol Deshpande, Koyel Mukherjee:
To Store or Not to Store: a graph theoretical approach for Dataset Versioning. CoRR abs/2402.11741 (2024) - 2023
- [c7]Pattara Sukprasert, Gromit Yeuk-Yin Chan, Ryan A. Rossi, Fan Du, Eunyee Koh:
Discovery and Matching Numerical Attributes in Data Lakes. IEEE Big Data 2023: 423-432 - [c6]Anders Aamand, Justin Y. Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakilian, Fred Zhang:
Constant Approximation for Individual Preference Stable Clustering. NeurIPS 2023 - [i7]Anders Aamand, Justin Y. Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakilian, Fred Zhang:
Constant Approximation for Individual Preference Stable Clustering. CoRR abs/2309.16840 (2023) - [i6]Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. CoRR abs/2311.04333 (2023) - 2022
- [c5]Sayan Bhattacharya, Thatchaphol Saranurak
, Pattara Sukprasert:
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. ESA 2022: 17:1-17:19 - [c4]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. ICALP 2022: 37:1-37:20 - [c3]Saba Ahmadi, Pranjal Awasthi, Samir Khuller, Matthäus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, Ali Vakilian:
Individual Preference Stability for Clustering. ICML 2022: 197-246 - [i5]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. CoRR abs/2205.14978 (2022) - [i4]Saba Ahmadi, Pranjal Awasthi, Samir Khuller, Matthäus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, Ali Vakilian:
Individual Preference Stability for Clustering. CoRR abs/2207.03600 (2022) - [i3]Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert:
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary. CoRR abs/2207.04954 (2022) - 2020
- [c2]Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal:
Multi-transversals for Triangles and the Tuza's Conjecture. SODA 2020: 1955-1974 - [i2]Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal:
Multi-transversals for Triangles and the Tuza's Conjecture. CoRR abs/2001.00257 (2020)
2010 – 2019
- 2018
- [c1]Jittat Fakcharoenphol, Pattara Sukprasert:
An nO(1/ϵ) Approximation Scheme For The Minimum Dominating Set In Unit Disk Graphs. JCSSE 2018: 1-5 - 2017
- [i1]Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert:
Finding All Useless Arcs in Directed Planar Graphs. CoRR abs/1702.04786 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
