↓ Skip to main content
What is this page? Embed badge

Topics in Theoretical Computer Science

Overview of attention for book
Cover of 'Topics in Theoretical Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Topics in Theoretical Computer Science
  3. Altmetric Badge
    Chapter 2 On Symmetric and Choiceless Computation
  4. Altmetric Badge
    Chapter 3 Topics in Theoretical Computer Science
  5. Altmetric Badge
    Chapter 4 Some Properties of Continuous Yao Graph
  6. Altmetric Badge
    Chapter 5 Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon
  7. Altmetric Badge
    Chapter 6 Topics in Theoretical Computer Science
  8. Altmetric Badge
    Chapter 7 Automating the Verification of Realtime Observers Using Probes and the Modal mu-calculus
  9. Altmetric Badge
    Chapter 8 Minimizing Walking Length in Map Matching
  10. Altmetric Badge
    Chapter 9 Topics in Theoretical Computer Science
  11. Altmetric Badge
    Chapter 10 Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width
  12. Altmetric Badge
    Chapter 11 Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy
  13. Altmetric Badge
    Chapter 12 Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem
Attention for Chapter 8: Minimizing Walking Length in Map Matching
Altmetric Badge

Citations

dimensions_citation
2 Dimensions
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Minimizing Walking Length in Map Matching
Chapter number 8
Book title
Topics in Theoretical Computer Science
Published by
Springer, Cham, August 2015
DOI 10.1007/978-3-319-28678-5_8
Book ISBNs
978-3-31-928677-8, 978-3-31-928678-5
Authors

Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack

View on publisher site

This page is provided by Altmetric.