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

TOTAL DOCUMENTS

73

(FIVE YEARS 0)

H-INDEX

17

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540705741, 9783540705758

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Tree Projections: Hypergraph Games and Minimality

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

10.1007/978-3-540-70575-8_60 ◽

2008 ◽

pp. 736-747 ◽

Author(s):

Gianluigi Greco ◽

Francesco Scarcello

Download Full-text

Randomized Self-assembly for Approximate Shapes

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

10.1007/978-3-540-70575-8_31 ◽

2008 ◽

pp. 370-384 ◽

Author(s):

Ming-Yang Kao ◽

Robert Schweller

Keyword(s):

Download Full-text

Polynomial-Time Construction of Linear Network Coding

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

10.1007/978-3-540-70575-8_23 ◽

2008 ◽

pp. 271-282 ◽

Author(s):

Kazuo Iwama ◽

Harumichi Nishimura ◽

Mike Paterson ◽

Rudy Raymond ◽

Shigeru Yamashita

Keyword(s):

Network Coding ◽

Polynomial Time ◽

Linear Network ◽

Linear Network Coding

Download Full-text

Function Evaluation Via Linear Programming in the Priced Information Model

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

10.1007/978-3-540-70575-8_15 ◽

2008 ◽

pp. 173-185 ◽

Author(s):

Ferdinando Cicalese ◽

Eduardo Sany Laber

Keyword(s):

Linear Programming ◽

Information Model ◽

Function Evaluation

Download Full-text

Fast Distributed Computation of Cuts Via Random Circulations

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

10.1007/978-3-540-70575-8_13 ◽

2008 ◽

pp. 145-160

Author(s):

David Pritchard

Keyword(s):

Distributed Computation

Download Full-text

Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time

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

10.1007/978-3-540-70575-8_14 ◽

2008 ◽

pp. 161-172

Author(s):

Prasad Chebolu ◽

Alan Frieze ◽

Páll Melsted

Keyword(s):

Random Graph ◽

Maximum Matching ◽

Download Full-text

Understanding the Complexity of Induced Subgraph Isomorphisms

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

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

2008 ◽

pp. 587-596 ◽

Author(s):

Yijia Chen ◽

Marc Thurley ◽

Mark Weyer

Keyword(s):

Induced Subgraph

Download Full-text

Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2

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

10.1007/978-3-540-70575-8_20 ◽

2008 ◽

pp. 234-245 ◽

Author(s):

Klaus Jansen ◽

Ralf Thöle

Keyword(s):

Approximation Algorithms ◽

Approximation Ratio ◽

Download Full-text

Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines

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

10.1007/978-3-540-70575-8_19 ◽

2008 ◽

pp. 222-233 ◽

Author(s):

C. Greg Plaxton

Keyword(s):

Download Full-text

The Complexity of the Counting Constraint Satisfaction Problem

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

10.1007/978-3-540-70575-8_53 ◽

2008 ◽

pp. 646-661 ◽

Author(s):

Andrei A. Bulatov

Keyword(s):

Constraint Satisfaction ◽

Constraint Satisfaction Problem

Download Full-text