Lecture Notes in Computer Science - Theory and Applications of Models of Computation
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642020162, 9783642020179

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Tractability of Maximal Strip Recovery

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_42 ◽

2009 ◽

pp. 400-409 ◽

Cited By ~ 10

Author(s):

Lusheng Wang ◽

Binhai Zhu

Download Full-text

The Two-Guard Polygon Walk Problem

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_47 ◽

2009 ◽

pp. 450-459

Author(s):

John Z. Zhang

Download Full-text

Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_44 ◽

2009 ◽

pp. 420-429

Author(s):

Douglas Cenzer ◽

Johanna N. Y. Franklin ◽

Jiang Liu ◽

Guohua Wu

Keyword(s):

Diamond Lattice

Download Full-text

A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_41 ◽

2009 ◽

pp. 390-399

Author(s):

Jianxin Wang ◽

Guohong Jiang

Keyword(s):

Enumeration Algorithm ◽

Fixed Parameter

Download Full-text

Terminal Coalgebras for Measure-Polynomial Functors

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_35 ◽

2009 ◽

pp. 325-334 ◽

Cited By ~ 3

Author(s):

Christoph Schubert

Keyword(s):

Polynomial Functors

Download Full-text

Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_26 ◽

2009 ◽

pp. 231-240

Author(s):

Bin Fu ◽

Ming-Yang Kao ◽

Lusheng Wang

Keyword(s):

Polynomial Time ◽

Success Probability ◽

Sample Complexity ◽

High Success Probability ◽

Multiple Sequences

Download Full-text

Improved Deterministic Algorithms for Weighted Matching and Packing Problems

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_24 ◽

2009 ◽

pp. 211-220 ◽

Cited By ~ 1

Author(s):

Qilong Feng ◽

Yang Liu ◽

Songjian Lu ◽

Jianxin Wang

Keyword(s):

Packing Problems ◽

Weighted Matching ◽

Deterministic Algorithms

Download Full-text

Best-Order Streaming Model

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_21 ◽

2009 ◽

pp. 178-191 ◽

Cited By ~ 5

Author(s):

Atish Das Sarma ◽

Richard J. Lipton ◽

Danupon Nanongkai

Download Full-text

On Parameterized Exponential Time Complexity

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_20 ◽

2009 ◽

pp. 168-177

Author(s):

Jianer Chen ◽

Iyad A. Kanj ◽

Ge Xia

Keyword(s):

Time Complexity ◽

Exponential Time

Download Full-text

Block-Graph Width

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-02017-9_18 ◽

2009 ◽

pp. 150-157 ◽

Cited By ~ 1

Author(s):

Maw-Shang Chang ◽

Ling-Ju Hung ◽

Ton Kloks ◽

Sheng-Lung Peng

Keyword(s):

Block Graph

Download Full-text

Lecture Notes in Computer Science - Theory and Applications of Models of ComputationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the Tractability of Maximal Strip Recovery

The Two-Guard Polygon Walk Problem

Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms

A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem

Terminal Coalgebras for Measure-Polynomial Functors

Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability

Improved Deterministic Algorithms for Weighted Matching and Packing Problems

Best-Order Streaming Model

On Parameterized Exponential Time Complexity

Block-Graph Width

Lecture Notes in Computer Science - Theory and Applications of Models of Computation
Latest Publications