Portfolio item number 1
Short description of portfolio item number 1
Posts by Collection
portfolio
Portfolio item number 2
Short description of portfolio item number 2
publications
Finding All Useless Arcs in Directed Planar Graphs
Published in arXiv, 2017
A linear-time algorithm for simplifying flow networks on directed planar graphs.
Recommended citation: Fakcharoenphol, Jittat, Bundit Laekhanukit, and Pattara Sukprasert. "Finding all useless arcs in directed planar graphs." arXiv preprint arXiv:1702.04786 (2017). https://arxiv.org/abs/1702.04786
Multi-transversals for Triangles and the Tuza’s Conjecture
Published in Symposium on Discrete Algorithms (SODA), 2020
Tuza conjectured that the ratio between max triangle packing and min triangle covering is bounded by two. We prove the multi-tranversals version of the conjecture.
Recommended citation: Chalermsook, Parinya, Samir Khuller, Pattara Sukprasert, and Sumedha Uniyal. "Multi-transversals for Triangles and the Tuza`s Conjecture." In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1955-1974. Society for Industrial and Applied Mathematics, 2020. https://epubs.siam.org/doi/abs/10.1137/1.9781611975994.121
The landscape of receptor-mediated precision cancer combination therapy via a single-cell perspective
Published in Nature communications, 2022
MadHitter is featured on the Northwestern CS’s website!.
Recommended citation: Ahmadi, Saba, Pattara Sukprasert, Rahulsimham Vegesna, Sanju Sinha, Fiorella Schischlik, Natalie Artzi, Samir Khuller, Alejandro A. Schäffer, and Eytan Ruppin. "The landscape of receptor-mediated precision cancer combination therapy via a single-cell perspective." Nature communications 13, no. 1 (2022): 1-17. https://www.nature.com/articles/s41467-022-29154-2
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver
Published in The 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP), 2022
[arXiv]
Recommended citation: Chalermsook, Parinya, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, and Sorrachai Yingchareontharownchai. "Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver." In 49th International Colloquium on Automata, Languages, and Programming (ICALP), 2022. https://drops.dagstuhl.de/opus/volltexte/2022/16378/
Individual Preference Stability for Clustering
Published in The Thirty-ninth International Conference on Machine Learning (ICML), 2022
[arXiv]
Recommended citation: Ahmadi, Saba, Pranjal Awasthi, Samir Khuller, Matthäus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, and Ali Vakilian. "Individual Preference Stability for Clustering." In 39th International Conference on Machine Learning (ICML), 2022. https://arxiv.org/abs/2207.03600
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary
Published in The 30th Annual European Symposium on Algorithms (ESA), 2022
[arXiv]
Recommended citation: Bhattacharya Sayan, Thatchaphol Saranurak, and Pattara Sukprasert. "Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary." The 30th Annual European Symposium on Algorithms (ESA), 2022. https://arxiv.org/abs/2207.04954
Constant Approximation for Individual Preference Stable Clustering
Published in The Thirty-seventh Conference on Neural Information Processing Systems (NeurIPS), 2023
[arXiv]
Recommended citation: Aamand, Anders, Justin Y. Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakilian, and Fred Zhang. "Constant Approximation for Individual Preference Stable Clustering." In 37th Conference on Neural Information Processing Systems (NeurIPS), 2023. https://arxiv.org/abs/2309.16840
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Published in SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), 2024
[arXiv]
Recommended citation: Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, and Julian Shun. "Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs." SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), 2024. https://arxiv.org/abs/2311.04333
To Store or Not to Store: a graph theoretical approach for Dataset Versioning
Published in IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2024
[arXiv]
Recommended citation: Guo, Anxin, Jingwei Li, Pattara Sukprasert, Samir Khuller, Amol Deshpande, and Koyel Mukherjee. "To Store or Not to Store: a graph theoretical approach for Dataset Versioning." IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2024. https://arxiv.org/abs/2402.11741
Finding Multiple Optimal Solutions to an Integer Linear Program by Random Perturbations of Its Objective Function
Published in Algorithms, 2025
[Journal]
Recommended citation: Schulhof, Noah, Pattara Sukprasert, Eytan Ruppin, Samir Khuller, and Alejandro A. Schäffer. "Finding Multiple Optimal Solutions to an Integer Linear Program by Random Perturbations of Its Objective Function." Algorithms, 18(3):140, 2025. https://www.mdpi.com/1999-4893/18/3/140
talks
Talk 1 on Relevant Topic in Your Field
Published:
This is a description of your talk, which is a markdown files that can be all markdown-ified like any other post. Yay markdown!
Conference Proceeding talk 3 on Relevant Topic in Your Field
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
teaching
Teaching experience 1
Undergraduate course, University 1, Department, 2014
This is a description of a teaching experience. You can use markdown like any other post.
Teaching experience 2
Workshop, University 1, Department, 2015
This is a description of a teaching experience. You can use markdown like any other post.