Automata, Languages and Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

102

(FIVE YEARS 0)

H-INDEX

22

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540228493, 9783540278368

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

LA, Permutations, and the Hajós Calculus

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_97 ◽

2004 ◽

pp. 1176-1187

Author(s):

Michael Soltys

Download Full-text

Counting in Trees for Free

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_94 ◽

2004 ◽

pp. 1136-1149 ◽

Author(s):

Helmut Seidl ◽

Thomas Schwentick ◽

Anca Muscholl ◽

Peter Habermehl

Download Full-text

Transparent Long Proofs: A First PCP Theorem for $\mbox{NP}_{\mathbb R}$

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_80 ◽

2004 ◽

pp. 959-970 ◽

Author(s):

K. Meer

Keyword(s):

Download Full-text

Property Testing of Regular Tree Languages

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_78 ◽

2004 ◽

pp. 932-944 ◽

Author(s):

Frédéric Magniez ◽

Michel de Rougemont

Keyword(s):

Property Testing ◽

Regular Tree ◽

Download Full-text

Regular Solutions of Language Inequalities and Well Quasi-orders

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_73 ◽

2004 ◽

pp. 870-881 ◽

Author(s):

Michal Kunc

Keyword(s):

Regular Solutions

Download Full-text

Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_68 ◽

2004 ◽

pp. 805-818 ◽

Author(s):

Raja Jothi ◽

Balaji Raghavachari

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Capacitated Minimum Spanning Tree ◽

Minimum Spanning Tree Problem

Download Full-text

Testing Monotonicity over Graph Products

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_61 ◽

2004 ◽

pp. 721-732 ◽

Author(s):

Shirley Halevy ◽

Eyal Kushilevitz

Keyword(s):

Download Full-text

Selfish Unsplittable Flows

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_51 ◽

2004 ◽

pp. 593-605 ◽

Author(s):

Dimitris Fotakis ◽

Spyros Kontogiannis ◽

Paul Spirakis

Download Full-text

Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_50 ◽

2004 ◽

pp. 581-592 ◽

Author(s):

Fedor V. Fomin ◽

Dimitrios M. Thilikos

Keyword(s):

Parameterized Algorithms ◽

Linear Kernel ◽

Graphs On Surfaces ◽

Download Full-text

Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_48 ◽

2004 ◽

pp. 555-567 ◽

Author(s):

Jörg Flum ◽

Martin Grohe ◽

Mark Weyer

Keyword(s):

Fixed Parameter Tractability ◽

Fixed Parameter

Download Full-text