Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

66

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540744559, 9783540744566

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_55 ◽

2007 ◽

pp. 621-632

Author(s):

Vittorio Bilò ◽

Michele Flammini

Keyword(s):

Nash Equilibria ◽

Second Order ◽

Download Full-text

Analysis of Maximal Repetitions in Strings

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_42 ◽

2007 ◽

pp. 465-476 ◽

Author(s):

Maxime Crochemore ◽

Lucian Ilie

Download Full-text

Packing and Squeezing Subgraphs into Planar Graphs

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_36 ◽

2007 ◽

pp. 394-405

Author(s):

Fabrizio Frati ◽

Markus Geyer ◽

Michael Kaufmann

Keyword(s):

Download Full-text

The Maximum Solution Problem on Graphs

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_22 ◽

2007 ◽

pp. 228-239 ◽

Author(s):

Peter Jonsson ◽

Gustav Nordh ◽

Johan Thapper

Keyword(s):

Maximum Solution ◽

Solution Problem

Download Full-text

Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_16 ◽

2007 ◽

pp. 159-170 ◽

Author(s):

Jaroslav Nešetřil ◽

Mark Siggers

Keyword(s):

Constraint Satisfaction ◽

Constraint Satisfaction Problems ◽

Combinatorial Proof ◽

Download Full-text

Approximation Algorithms for the Maximum Internal Spanning Tree Problem

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_10 ◽

2007 ◽

pp. 90-102 ◽

Author(s):

Gábor Salamon

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Exact Algorithms for L(2,1)-Labeling of Graphs

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_46 ◽

2007 ◽

pp. 513-524 ◽

Author(s):

Jan Kratochvíl ◽

Dieter Kratsch ◽

Mathieu Liedloff

Keyword(s):

Exact Algorithms

Download Full-text

On the Complexity of Game Isomorphism

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_50 ◽

2007 ◽

pp. 559-571 ◽

Author(s):

Joaquim Gabarró ◽

Alina García ◽

Maria Serna

Keyword(s):

Game Isomorphism

Download Full-text

The Complexity of Solitaire

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_18 ◽

2007 ◽

pp. 182-193 ◽

Author(s):

Luc Longpré ◽

Pierre McKenzie

Download Full-text

Evolvability

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_5 ◽

2007 ◽

pp. 22-43 ◽

Author(s):

Leslie G. Valiant

Download Full-text