Q5009466 (Q5009466): Difference between revisions

@@ Property / cites work @@
+Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of diameter
@@ Property / cites work: Parameterized complexity of diameter / rank @@
+Normal rank
@@ Property / cites work @@
+Multidimensional divide-and-conquer
@@ Property / cites work: Multidimensional divide-and-conquer / rank @@
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for graphs of bounded treewidth via orthogonal range searching
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
+Normal rank
@@ Property / cites work @@
+Lower bounds for orthogonal range searching: I. The reporting case
+Normal rank
@@ Property / cites work @@
+Computing Graph Distances Parameterized by Treewidth and Diameter
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Quintary trees
@@ Property / cites work: Quintary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial solutions of multidimensional divide-and-conquer recurrences
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithms for the diameter and radius of sparse graphs
+Normal rank
@@ Property / cites work @@
+New Data Structures for Orthogonal Range Queries
@@ Property / cites work: New Data Structures for Orthogonal Range Queries / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
+Normal rank