Topics in Theoretical Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319286778, 9783319286785

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Rainbow Domination and Related Problems on Some Classes of Perfect Graphs

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_9 ◽

2016 ◽

pp. 121-134 ◽

Cited By ~ 1

Author(s):

Wing-Kai Hon ◽

Ton Kloks ◽

Hsiang-Hsuan Liu ◽

Hung-Lung Wang

Keyword(s):

Perfect Graphs ◽

Rainbow Domination

Download Full-text

Distributional Sentence Entailment Using Density Matrices

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_1 ◽

2016 ◽

pp. 1-22 ◽

Cited By ~ 6

Author(s):

Esma Balkir ◽

Mehrnoosh Sadrzadeh ◽

Bob Coecke

Keyword(s):

Density Matrices

Download Full-text

Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_11 ◽

2016 ◽

pp. 147-163 ◽

Cited By ~ 5

Author(s):

Stéphane Le Roux

Keyword(s):

Subgame Perfect Equilibrium ◽

Perfect Equilibrium ◽

Difference Hierarchy

Download Full-text

Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_10 ◽

2016 ◽

pp. 135-146 ◽

Cited By ~ 1

Author(s):

Tomer Kotek ◽

Johann A. Makowsky

Keyword(s):

Efficient Computation

Download Full-text

Some Properties of Continuous Yao Graph

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_4 ◽

2016 ◽

pp. 44-55

Author(s):

Davood Bakhshesh ◽

Mohammad Farshi

Download Full-text

On Symmetric and Choiceless Computation

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_2 ◽

2016 ◽

pp. 23-29

Author(s):

Anuj Dawar

Download Full-text

Automating the Verification of Realtime Observers Using Probes and the Modal mu-calculus

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_7 ◽

2016 ◽

pp. 90-104

Author(s):

Silvano Dal Zilio ◽

Bernard Berthomieu

Download Full-text

Visibility Graphs of Anchor Polygons

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_6 ◽

2016 ◽

pp. 72-89

Author(s):

Hossein Boomari ◽

Alireza Zarei

Keyword(s):

Visibility Graphs

Download Full-text

Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_5 ◽

2016 ◽

pp. 56-71

Author(s):

Ahmad Biniaz ◽

Prosenjit Bose ◽

Anil Maheshwari ◽

Michiel Smid

Keyword(s):

Spanning Trees ◽

Simple Polygon ◽

Perfect Matchings ◽

Hamiltonian Cycles

Download Full-text

Robots’ Cooperation for Finding a Target in Streets

Topics in Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-28678-5_3 ◽

2016 ◽

pp. 30-43

Author(s):

Mohammad Abouei Mehrizi ◽

Mohammad Ghodsi ◽

Azadeh Tabatabaei

Download Full-text

Topics in Theoretical Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Rainbow Domination and Related Problems on Some Classes of Perfect Graphs

Distributional Sentence Entailment Using Density Matrices

Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy

Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width

Some Properties of Continuous Yao Graph

On Symmetric and Choiceless Computation

Automating the Verification of Realtime Observers Using Probes and the Modal mu-calculus

Visibility Graphs of Anchor Polygons

Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon

Robots’ Cooperation for Finding a Target in Streets

Topics in Theoretical Computer Science - Lecture Notes in Computer Science
Latest Publications