Thatchaphol Saranurak

Available identifiers

zbMath Open saranurak.thatchapholMaRDI QIDQ2941484

List of research outcomes

Publication	Date of Publication	Type
Maximal \(k\)-edge-connected subgraphs in almost-linear time for small \(k\)	2025-01-06	Paper
Cactus representations in polylogarithmic max-flow via maximal isolating mincuts	2024-11-28	Paper
Cactus representation of minimum cuts: derandomize and speed up	2024-11-28	Paper
Fully-dynamic graph sparsifiers against an adaptive adversary	2024-06-24	Paper
Approximating \(k\)-edge-connected spanning subgraphs via a near-linear time LP solver	2024-06-24	Paper
Dynamic algorithms for packing-covering LPs via multiplicative weight updates	2024-05-14	Paper
Fully dynamic exact edge connectivity in sublinear time	2024-05-14	Paper
Dynamic matching with better-than-2 approximation in polylogarithmic update time	2024-05-14	Paper
Maximal \(k\)-edge-connected subgraphs in weighted graphs via local random contraction	2024-05-14	Paper
Near-linear time approximations for cut problems via fair cuts	2024-05-14	Paper
A simple deterministic algorithm for edge connectivity	2024-05-14	Paper
Sublinear algorithms for \((1.5+\epsilon)\)-approximate matching	2024-05-08	Paper
Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast	2024-05-08	Paper
Tight conditional lower bounds for vertex connectivity problems	2024-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q6138067	2024-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q6147388	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147403	2024-01-15	Paper
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds	2023-12-08	Paper
Optimal vertex connectivity oracles	2023-12-08	Paper
Vertex connectivity in poly-logarithmic max-flows	2023-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q6062157	2023-10-31	Paper
Near-optimal Distributed Triangle Enumeration via Expander Decompositions	2022-12-08	Paper
Multi-Finger Binary Search Trees	2022-07-21	Paper
Coarse-Grained Complexity for Dynamic Algorithms	2021-02-02	Paper
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration	2021-01-20	Paper
Smooth Heaps and a Dual View of Self-Adjusting Data Structures	2020-10-29	Paper
Distributed edge connectivity in sublinear time	2020-01-30	Paper
Breaking quadratic time for small vertex connectivity and an approximation scheme	2020-01-30	Paper
Smooth heaps and a dual view of self-adjusting data structures	2019-08-22	Paper
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time	2017-08-17	Paper
Binary search trees and rectangulations	2016-03-26	Paper
Self-Adjusting Binary Search Trees: What Makes Them Tick?	2015-11-19	Paper
Greedy Is an Almost Optimal Deque	2015-10-30	Paper
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture	2015-08-21	Paper
Pattern-avoiding access in binary search trees	2015-07-24	Paper

Research outcomes over time

This page was built for person: Thatchaphol Saranurak