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

TOTAL DOCUMENTS

71

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642325885, 9783642325892

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Regularity Problems for Weak Pushdown ω-Automata and Games

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

10.1007/978-3-642-32589-2_66 ◽

2012 ◽

pp. 764-776 ◽

Author(s):

Christof Löding ◽

Stefan Repke

Download Full-text

Drawing Planar Graphs on Points Inside a Polygon

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

10.1007/978-3-642-32589-2_18 ◽

2012 ◽

pp. 172-183

Author(s):

Therese Biedl ◽

Peter Floderus

Keyword(s):

Download Full-text

New Races in Parameterized Algorithmics

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

10.1007/978-3-642-32589-2_2 ◽

2012 ◽

pp. 19-30 ◽

Author(s):

Christian Komusiewicz ◽

Rolf Niedermeier

Keyword(s):

Parameterized Algorithmics ◽

Download Full-text

Pancake Flipping Is Hard

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

10.1007/978-3-642-32589-2_24 ◽

2012 ◽

pp. 247-258 ◽

Author(s):

Laurent Bulteau ◽

Guillaume Fertin ◽

Irena Rusu

Download Full-text

Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection

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

10.1007/978-3-642-32589-2_48 ◽

2012 ◽

pp. 542-553 ◽

Author(s):

Sayaka Kamei ◽

Anissa Lamani ◽

Fukuhito Ooshita ◽

Sébastien Tixeuil

Download Full-text

Strictness of the Collapsible Pushdown Hierarchy

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

10.1007/978-3-642-32589-2_50 ◽

2012 ◽

pp. 566-577 ◽

Author(s):

Alexander Kartzow ◽

Paweł Parys

Download Full-text

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses

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

10.1007/978-3-642-32589-2_25 ◽

2012 ◽

pp. 259-270 ◽

Author(s):

Jingsen Chen ◽

Stefan Edelkamp ◽

Amr Elmasry ◽

Jyrki Katajainen

Download Full-text

An Improved Approximation Scheme for Variable-Sized Bin Packing

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

10.1007/978-3-642-32589-2_47 ◽

2012 ◽

pp. 529-541 ◽

Author(s):

Klaus Jansen ◽

Stefan Kraft

Keyword(s):

Bin Packing ◽

Approximation Scheme

Download Full-text

Finite State Transducers for Modular Möbius Number Systems

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

10.1007/978-3-642-32589-2_30 ◽

2012 ◽

pp. 323-334 ◽

Author(s):

Martin Delacourt ◽

Petr Kůrka

Keyword(s):

Number Systems ◽

Finite State Transducers ◽

Download Full-text

Computational Complexity of Smooth Differential Equations

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

10.1007/978-3-642-32589-2_51 ◽

2012 ◽

pp. 578-589 ◽

Author(s):

Akitoshi Kawamura ◽

Hiroyuki Ota ◽

Carsten Rösnick ◽

Martin Ziegler

Keyword(s):

Computational Complexity ◽

Differential Equations

Download Full-text