Q5743390 (Q5743390): Difference between revisions

@@ Property / cites work @@
+Planar spanners and approximate shortest path queries among obstacles in the plane
+Normal rank
@@ Property / cites work @@
+VC-Dimension and Shortest Path Algorithms
@@ Property / cites work: VC-Dimension and Shortest Path Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417667
@@ Property / cites work: Q5417667 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Preprocessing Speed-Up Techniques Is Hard
@@ Property / cites work: Preprocessing Speed-Up Techniques Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+The Shortcut Problem – Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Fast Routing in Road Networks with Transit Nodes
@@ Property / cites work: Fast Routing in Road Networks with Transit Nodes / rank @@
+Normal rank
@@ Property / cites work @@
+Min             <i>st</i>             -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
+Normal rank
@@ Property / cites work @@
+Many distances in planar graphs
@@ Property / cites work: Many distances in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest path queries in planar graphs
@@ Property / cites work: Shortest path queries in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths in digraphs of small treewidth. I: Sequential algorithms
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families, revisited
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
+Normal rank
@@ Property / cites work @@
+Improved algorithms for dynamic shortest paths
@@ Property / cites work: Improved algorithms for dynamic shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraph Isomorphism in Planar Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Compact Navigation and Distance Oracles for Graphs with Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4694731
@@ Property / cites work: Q4694731 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs, negative weight edges, shortest paths, and near linear time
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
+Normal rank
@@ Property / cites work @@
+Optimal branch-decomposition of planar graphs in             <i>O</i>             (             <i>n</i>             <sup>3</sup>             ) Time
+Normal rank
@@ Property / cites work @@
+Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3574261
@@ Property / cites work: Q3574261 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An external memory data structure for shortest path queries
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+Oracles for bounded-length shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
+Normal rank
@@ Property / cites work @@
+Q4829018
@@ Property / cites work: Q4829018 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921664
@@ Property / cites work: Q2921664 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths in directed planar graphs with negative lengths
+Normal rank
@@ Property / cites work @@
+Finding small simple cycle separators for 2-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
+Normal rank
@@ Property / cites work @@
+Improved Distance Queries in Planar Graphs
@@ Property / cites work: Improved Distance Queries in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distance Oracles beyond the Thorup--Zwick Bound
@@ Property / cites work: Distance Oracles beyond the Thorup--Zwick Bound / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+Distance Oracles for Sparse Graphs
@@ Property / cites work: Distance Oracles for Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank
@@ Property / cites work @@
+Computing the dilation of edge-augmented graphs in metric spaces
+Normal rank