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

TOTAL DOCUMENTS

54

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642229923, 9783642229930

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

New Parameterized Algorithms for the Edge Dominating Set Problem

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

10.1007/978-3-642-22993-0_54 ◽

2011 ◽

pp. 604-615 ◽

Author(s):

Mingyu Xiao ◽

Ton Kloks ◽

Sheung-Hung Poon

Keyword(s):

Dominating Set ◽

Parameterized Algorithms ◽

Edge Dominating Set ◽

Dominating Set Problem

Download Full-text

Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable

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

10.1007/978-3-642-22993-0_30 ◽

2011 ◽

pp. 315-326 ◽

Author(s):

Peter Franek ◽

Stefan Ratschan ◽

Piotr Zgliczynski

Keyword(s):

Analytic Functions ◽

Systems Of Equations ◽

Real Analytic Functions ◽

Download Full-text

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection

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

10.1007/978-3-642-22993-0_23 ◽

2011 ◽

pp. 231-242 ◽

Author(s):

David A. Cohen ◽

Páidí Creed ◽

Peter G. Jeavons ◽

Stanislav Živný

Keyword(s):

Algebraic Theory ◽

Galois Connection ◽

Theory Of Complexity

Download Full-text

Faster Coupon Collecting via Replication with Applications in Gossiping

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

10.1007/978-3-642-22993-0_10 ◽

2011 ◽

pp. 72-83 ◽

Author(s):

Petra Berenbrink ◽

Robert Elsässer ◽

Tom Friedetzky ◽

Lars Nagel ◽

Thomas Sauerwald

Download Full-text

Compressed Word Problems for Inverse Monoids

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

10.1007/978-3-642-22993-0_41 ◽

2011 ◽

pp. 448-459 ◽

Author(s):

Markus Lohrey

Keyword(s):

Word Problems ◽

Inverse Monoids

Download Full-text

The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree

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

10.1007/978-3-642-22993-0_12 ◽

2011 ◽

pp. 96-107 ◽

Author(s):

Markus Bläser ◽

Radu Curticapean

Keyword(s):

Planar Graphs ◽

Download Full-text

Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions

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

10.1007/978-3-642-22993-0_38 ◽

2011 ◽

pp. 412-423 ◽

Author(s):

Andreas Krebs ◽

Nutan Limaye ◽

Srikanth Srinivasan

Keyword(s):

Streaming Algorithms

Download Full-text

Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence

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

10.1007/978-3-642-22993-0_46 ◽

2011 ◽

pp. 508-519 ◽

Author(s):

Kevin Perrot ◽

Eric Rémila

Keyword(s):

Wave Pattern ◽

Sand Pile ◽

Pattern Emergence

Download Full-text

The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity

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

10.1007/978-3-642-22993-0_17 ◽

2011 ◽

pp. 158-169

Author(s):

Christina Boucher

Keyword(s):

Search Tree ◽

Tree Algorithm ◽

Download Full-text

Quantitative Refinement for Weighted Modal Transition Systems

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

10.1007/978-3-642-22993-0_9 ◽

2011 ◽

pp. 60-71 ◽

Author(s):

Sebastian S. Bauer ◽

Uli Fahrenberg ◽

Line Juhl ◽

Kim G. Larsen ◽

Axel Legay ◽

...

Keyword(s):

Transition Systems ◽

Modal Transition Systems

Download Full-text