Lecture Notes in Computer Science - Theory and Applications of Models of Computation
Latest Publications

TOTAL DOCUMENTS

50

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer International Publishing

9783319559100, 9783319559117

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Complexity of Breaking Pseudoentropy

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_43 ◽

2017 ◽

pp. 600-613

Author(s):

Maciej Skorski

Download Full-text

The Complexity of Perfect Packings in Dense Graphs

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_21 ◽

2017 ◽

pp. 289-303

Author(s):

Jie Han

Keyword(s):

Download Full-text

Cognitive Reasoning and Trust in Human-Robot Interactions

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_1 ◽

2017 ◽

pp. 3-11 ◽

Author(s):

Marta Kwiatkowska

Keyword(s):

Cognitive Reasoning

Download Full-text

Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_34 ◽

2017 ◽

pp. 470-483 ◽

Author(s):

Daniël Paulusma ◽

Christophe Picouleau ◽

Bernard Ries

Keyword(s):

Independent Sets

Download Full-text

On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_9 ◽

2017 ◽

pp. 112-128

Author(s):

Florian Bridoux ◽

Pierre Guillon ◽

Kévin Perrot ◽

Sylvain Sené ◽

Guillaume Theyssier

Keyword(s):

The Cost ◽

Automata Network

Download Full-text

Scheduling Fully Parallel Jobs with Integer Parallel Units

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_11 ◽

2017 ◽

pp. 144-157

Author(s):

Vincent Chau ◽

Minming Li ◽

Kai Wang

Keyword(s):

Download Full-text

The Strength of the SCT Criterion

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_19 ◽

2017 ◽

pp. 260-273 ◽

Author(s):

Emanuele Frittaion ◽

Silvia Steila ◽

Keita Yokoyama

Download Full-text

Algorithmic Aspects of the Maximum Colorful Arborescence Problem

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_16 ◽

2017 ◽

pp. 216-230 ◽

Author(s):

Guillaume Fertin ◽

Julien Fradin ◽

Géraldine Jean

Download Full-text

Fast Searching on Cartesian Products of Graphs

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_48 ◽

2017 ◽

pp. 669-683 ◽

Author(s):

Yuan Xue ◽

Boting Yang

Keyword(s):

Cartesian Products ◽

Fast Searching ◽

Cartesian Products Of Graphs

Download Full-text

Counting Minimal Dominating Sets

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-319-55911-7_24 ◽

2017 ◽

pp. 333-347 ◽

Author(s):

Mamadou Moustapha Kanté ◽

Takeaki Uno

Keyword(s):

Dominating Sets

Download Full-text