Search alternatives:
swash » swath, smash, awash
slash » flash, clash, slas
sweath » sheath, sweat, sweats
swat » sweat, swan, sat
spate » spater, spaten, space
Cover Image
Read Now

1
Published 2004
Springer Berlin Heidelberg
Table of Contents: “...Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic...”
Cover Image
Read Now

2
Published 2014
Springer International Publishing
“... and Workshops on Algorithm Theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. The 33 papers were...”
Cover Image
Read Now

3
Published 2012
Springer Berlin Heidelberg
“... and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd...”
Cover Image
Read Now

4
by Li, Fajie, Klette, Reinhard
Published 2011
Springer London
Table of Contents: “...Part I: Discrete or Continuous Shortest Paths -- Euclidean Shortest Paths -- Deltas and Epsilons...”
Cover Image
Read Now

5
Published 2017
Springer International Publishing
“... Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT...”
Cover Image
Read Now

6
by Ramalingam, G.
Published 1996
Springer Berlin Heidelberg
Table of Contents: “... algorithms for shortest-path problems -- Generalizations of the shortest-path problem -- An incremental...”
Cover Image
Read Now

7
by Resende, Mauricio G.C., Ribeiro, Celso C.
Published 2016
Springer New York
Table of Contents: “...: The basic heuristic -- 6. Runtime distributions -- 7. GRASP: extended construction heuristics -- 8. Path...”
Cover Image
Read Now

8
by Marino, Andrea
Published 2015
Atlantis Press
Table of Contents: “... -- Enumerating bubbles: listing pairs of vertex disjoint paths -- Enumerating Cycles and (s,t)-Paths...”
Cover Image
Read Now

9
by Bubley, Russ
Published 2001
Springer London
Table of Contents: “... Log-Concave Sampling, and the Volume of a Convex Body -- Intermezzo: Path Coupling -- 5 Applications...”
Cover Image
Read Now

10
Published 2009
Springer Berlin Heidelberg
Table of Contents: “... Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings -- Core and Conditional...”
Cover Image
Read Now

11
Published 2013
Springer Berlin Heidelberg
Table of Contents: “... and Path Planning -- Image and Video Processing -- Other Applications...”
Cover Image
Read Now

12
Published 2001
Springer Berlin Heidelberg
Table of Contents: “...Lattice Paths and Determinants -- The Nearest Neighbor -- Explicit and Implicit Enforcing...”
Cover Image
Read Now

13
Published 2006
Springer Berlin Heidelberg
Table of Contents: “... of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees...”
Cover Image
Read Now

14
Published 2015
Springer International Publishing
Table of Contents: “... -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries...”
Cover Image
Read Now

15
Published 2020
Springer International Publishing
Table of Contents: “...Algorithmic -- Hypergraph Decompositions -- Multi-Agent Path Finding -- New Constraint Programming...”
Cover Image
Read Now

16
Published 2021
Springer International Publishing
Table of Contents: “... -- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation -- Block Elimination Distance...”
Cover Image
Read Now

17
Published 2014
Springer International Publishing
Table of Contents: “... -- Classification methods -- GPU-based methods -- Scheduling and path planning -- Wireless sensor networks -- Power...”
Cover Image
Read Now

18
Published 2014
Springer International Publishing
Table of Contents: “... -- Classification methods -- GPU-based methods -- Scheduling and path planning -- Wireless sensor networks -- Power...”
Cover Image
Read Now

19
Published 1985
Springer Berlin Heidelberg
Table of Contents: “... -- A single source shortest path algorithm for a planar distributed network -- An algorithm for two...”
Cover Image
Read Now

20
Published 2015
Springer International Publishing
Table of Contents: “... Applications to Constant-Time Distributed Computation -- Path-Fault-Tolerant Approximate Shortest-Path Trees...”