Q5009600 (Q5009600): Difference between revisions

@@ Property / author @@
+Monika R. Henzinger
@@ Property / author: Monika R. Henzinger / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
+Normal rank
@@ Property / cites work @@
+Q4471358
@@ Property / cites work: Q4471358 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangular Factorization and Inversion by Fast Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
+Normal rank
@@ Property / cites work @@
+Solving SDD linear systems in nearly             <i>m</i>             log             <sup>1/2</sup>             <i>n</i>             time
+Normal rank
@@ Property / cites work @@
+Dynamic Plane Transitive Closure
@@ Property / cites work: Dynamic Plane Transitive Closure / rank @@
+Normal rank
@@ Property / cites work @@
+Towards Resistance Sparsifiers
@@ Property / cites work: Towards Resistance Sparsifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3706275
@@ Property / cites work: Q3706275 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic spectral vertex sparsifiers and applications
+Normal rank
@@ Property / cites work @@
+Sampling random spanning trees faster than matrix multiplication
+Normal rank
@@ Property / cites work @@
+Separator based sparsification. I: Planarity testing and minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Q5111734
@@ Property / cites work: Q5111734 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579444
@@ Property / cites work: Q3579444 / rank @@
+Normal rank
@@ Property / cites work @@
+Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
+Normal rank
@@ Property / cites work @@
+Contracting a Planar Graph Efficiently
@@ Property / cites work: Contracting a Planar Graph Efficiently / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of the fast LUP matrix decomposition algorithm and applications
+Normal rank
@@ Property / cites work @@
+Decremental single-source reachability in planar digraphs
+Normal rank
@@ Property / cites work @@
+Improved algorithms for min cut and max flow in undirected planar graphs
+Normal rank
@@ Property / cites work @@
+Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse
+Normal rank
@@ Property / cites work @@
+Q4607877
@@ Property / cites work: Q4607877 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster approximate multicommodity flow using quadratically coupled flows
+Normal rank
@@ Property / cites work @@
+A fully dynamic approximation scheme for shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+Sparsified Cholesky and multigrid solvers for connection laplacians
+Normal rank
@@ Property / cites work @@
+Maximizing the Number of Spanning Trees in a Connected Graph
+Normal rank
@@ Property / cites work @@
+Q4608048
@@ Property / cites work: Q4608048 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Nested Dissection
@@ Property / cites work: Generalized Nested Dissection / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Generation of Random Spanning Trees and the Effective Resistance Metric
+Normal rank
@@ Property / cites work @@
+Approximate Maximum Flow on Separable Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Separators for sphere-packings and nearest neighbor graphs
+Normal rank
@@ Property / cites work @@
+Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
+Normal rank
@@ Property / cites work @@
+An almost-linear time algorithm for uniform random spanning tree generation
+Normal rank
@@ Property / cites work @@
+Graph Sparsification by Effective Resistances
@@ Property / cites work: Graph Sparsification by Effective Resistances / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank