Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Thatchaphol Saranurak
University of Michigan, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 123 matches
- 2024
- Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. SODA 2024: 1465-1502 - Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representation of Minimum Cuts: Derandomize and Speed up. SODA 2024: 1503-1541 - Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representation of Minimum Cuts: Derandomize and Speed up. CoRR abs/2401.10856 (2024) - Deeksha Adil, Thatchaphol Saranurak:
Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method. CoRR abs/2402.17929 (2024) - Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak:
Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. CoRR abs/2402.18541 (2024) - Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak:
Approximating Small Sparse Cuts. CoRR abs/2403.08983 (2024) - 2023
- Thatchaphol Saranurak, Wuwei Yuan:
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. ESA 2023: 92:1-92:9 - Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. FOCS 2023: 2204-2212 - Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak:
Chasing Positive Bodies. FOCS 2023: 1694-1714 - Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. FOCS 2023: 1563-1588 - Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA 2023: 240-275 - Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. SODA 2023: 1-47 - Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. SODA 2023: 100-128 - Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA 2023: 70-86 - Chaitanya Nalam, Thatchaphol Saranurak:
Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction. SODA 2023: 183-211 - Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Sublinear Algorithms for (1.5+ε)-Approximate Matching. STOC 2023: 254-266 - Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak:
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. STOC 2023: 1371-1383 - Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang:
Tight Conditional Lower Bounds for Vertex Connectivity Problems. STOC 2023: 1384-1395 - Chaitanya Nalam, Thatchaphol Saranurak:
Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction. CoRR abs/2302.02290 (2023) - Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time. CoRR abs/2302.05030 (2023) - Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR abs/2302.05951 (2023) - Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak:
Chasing Positive Bodies. CoRR abs/2304.01889 (2023) - Thatchaphol Saranurak, Wuwei Yuan:
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. CoRR abs/2307.00147 (2023) - Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic k-Vertex Connectivity in k2 Max-flows. CoRR abs/2308.04695 (2023) - Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. CoRR abs/2311.10706 (2023) - Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak:
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). Dagstuhl Reports 13(10): 76-89 (2023) - 2022
- Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert:
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. ESA 2022: 17:1-17:19 - Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang:
Vertex Sparsifiers for Hyperedge Connectivity. ESA 2022: 70:1-70:13 - Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi:
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. FOCS 2022: 884-895 - Yaowei Long, Thatchaphol Saranurak:
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. FOCS 2022: 1002-1010
skipping 93 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-24 02:53 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint