暂无分享,去创建一个
Thatchaphol Saranurak | Harald Räcke | Gramoz Goranci | Zihan Tan | Harald Räcke | Thatchaphol Saranurak | Gramoz Goranci | Zihan Tan
[1] Fabian Kuhn,et al. Sublinear-time distributed algorithms for detecting small cliques and even cycles , 2021, Distributed Computing.
[2] Richard Peng,et al. Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[3] Thatchaphol Saranurak,et al. Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , 2020, ICALP.
[4] Xiaorui Sun,et al. Fully Dynamic c-Edge Connectivity in Subpolynomial Time , 2020, ArXiv.
[5] Richard Peng,et al. A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , 2019, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[6] Thatchaphol Saranurak,et al. Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[7] Yi-Jun Chang,et al. Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration , 2019, PODC.
[8] Thatchaphol Saranurak,et al. Expander Decomposition and Pruning: Faster, Stronger, and Simpler , 2018, SODA.
[9] Monika Henzinger,et al. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching , 2018, SODA.
[10] Seth Pettie,et al. Distributed Triangle Detection via Expander Decomposition , 2018, SODA.
[11] Akash Kumar,et al. Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[12] Sebastian Krinninger,et al. Dynamic low-stretch trees via dynamic low-diameter decompositions , 2018, STOC.
[13] Manoj Gupta,et al. Simple dynamic algorithms for Maximal Independent Set and other problems , 2018, ArXiv.
[14] Aaron Sidford,et al. Efficient Õ(n/∊) Spectral Sketches for the Laplacian and its Pseudoinverse , 2018, SODA.
[15] Christian Wulff-Nilsen,et al. Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[16] Jonah Sherman,et al. Area-convexity, l∞ regularization, and undirected multicommodity flow , 2017, STOC.
[17] Thatchaphol Saranurak,et al. Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time , 2017, STOC.
[18] Petar Maymounkov,et al. Rumor Spreading with No Dependence on Conductance , 2017, SIAM J. Comput..
[19] Christian Wulff-Nilsen,et al. Fully-dynamic minimum spanning forest with improved worst-case update time , 2016, STOC.
[20] Richard Peng,et al. On Fully Dynamic Graph Sparsifiers , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[21] Michal Pilipczuk,et al. A ck n 5-Approximation Algorithm for Treewidth , 2016, SIAM J. Comput..
[22] David P. Woodruff,et al. On Sketching Quadratic Forms , 2015, ITCS.
[23] Michal Pilipczuk,et al. Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth , 2015, SODA.
[24] Richard Peng,et al. Approximate Undirected Maximum Flows in O(mpolylog(n)) Time , 2014, SODA.
[25] Chintan Shah,et al. Improved Guarantees for Tree Cut Sparsifiers , 2014, ESA.
[26] Chintan Shah,et al. Computing Cut-Based Hierarchical Decompositions in Almost Linear Time , 2014, SODA.
[27] Zdenek Dvorak,et al. Dynamic Data Structure for Tree-Depth Decomposition , 2013, ArXiv.
[28] Yin Tat Lee,et al. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.
[29] Jonah Sherman,et al. Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[30] Chandra Chekuri,et al. Large-treewidth graph decompositions and applications , 2013, STOC '13.
[31] Ittai Abraham,et al. Using petal-decompositions to build a low stretch spanning tree , 2012, STOC '12.
[32] Robert Krauthgamer,et al. Min-max Graph Partitioning and Small Set Expansion , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[33] Aleksander Madry,et al. Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[34] Eyal Amir,et al. Approximation Algorithms for Treewidth , 2010, Algorithmica.
[35] Bruce M. Maggs,et al. Simultaneous source location , 2009, TALG.
[36] Shang-Hua Teng,et al. Spectral Sparsification of Graphs , 2008, SIAM J. Comput..
[37] Harald Räcke,et al. Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.
[38] M. Patrascu,et al. Planning for Fast Connectivity Updates , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[39] Satish Rao,et al. Graph partitioning using single commodity flows , 2006, STOC '06.
[40] Uriel Feige,et al. Finding small balanced separators , 2006, STOC '06.
[41] Luca Trevisan,et al. Approximation algorithms for unique games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[42] Sanjeev Khanna,et al. Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.
[43] Sanjeev Khanna,et al. The all-or-nothing multicommodity flow problem , 2004, STOC '04.
[44] Edith Cohen,et al. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.
[45] Marcin Bienkowski,et al. A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.
[46] Satish Rao,et al. A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.
[47] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[48] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[49] Santosh S. Vempala,et al. On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[50] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[51] Dana Ron,et al. A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1998, STOC '98.
[52] Stefano Leonardi,et al. On-Line Routing in All-Optical Networks , 1997, Theor. Comput. Sci..
[53] Ronitt Rubinfeld,et al. Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[54] John R. Gilbert,et al. Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree , 1995, J. Algorithms.
[55] Noga Alon,et al. A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..
[56] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[57] Bruce A. Reed,et al. Finding approximate separators and computing tree width quickly , 1992, STOC '92.
[58] Shiri Chechik,et al. Dynamic Low-Stretch Spanning Trees in Subpolynomial Time , 2020, SODA.
[59] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.