Table of Contents
|
Topics in Theoretical Computer Science
Mohammed Taghi Hajiaghayi, Mohammad Reza Mousavi |
Front Matter |
Distributional Sentence Entailment Using Density Matrices
Esma Balkir, Mehrnoosh Sadrzadeh, Bob Coecke |
1-22 |
On Symmetric and Choiceless Computation
Anuj Dawar |
23-29 |
Robots’ Cooperation for Finding a Target in Streets
Mohammad Mehrizi, Mohammad Ghodsi, Azadeh Tabatabaei |
30-43 |
Some Properties of Continuous Yao Graph
Davood Bakhshesh, Mohammad Farshi |
44-55 |
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid |
56-71 |
Visibility Graphs of Anchor Polygons
Hossein Boomari, Alireza Zarei |
72-89 |
Automating the Verification of Realtime Observers using Probes and the Modal mu-calculus
Silvano Dal Zilio, Bernard Berthomieu |
90-104 |
Minimizing Walking Length in Map Matching
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack |
105-120 |
Rainbow Domination and Related Problems on Some Classes of Perfect Graphs
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang |
121-134 |
Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width
Tomer Kotek, Johann Makowsky |
135-146 |
Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy
Stéphane Le Roux |
147-163 |
Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem
Vahid Roostapour, Iman Kiarazm, Mansoor Davoodi |
164-178 |
Hosted by HAL : 