↓ 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 5: Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
So far, Dimensions has found 2 publications that cite this research output.

2

The most recent citing publications are shown below. View all 2 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.