Parameterized and Exact Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540797227, 9783540797234

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_4 ◽

2008 ◽

pp. 13-29 ◽

Cited By ~ 6

Author(s):

Omid Amini ◽

Ignasi Sau ◽

Saket Saurabh

Keyword(s):

Parameterized Complexity

Download Full-text

Parameterized Chess

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_17 ◽

2008 ◽

pp. 172-189 ◽

Cited By ~ 1

Author(s):

Allan Scott ◽

Ulrike Stege

Download Full-text

Parameterized Complexity and Approximability of the SLCS Problem

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_12 ◽

2008 ◽

pp. 115-128 ◽

Cited By ~ 3

Author(s):

Sylvain Guillemot

Keyword(s):

Parameterized Complexity

Download Full-text

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_8 ◽

2008 ◽

pp. 66-77

Author(s):

Maw-Shang Chang ◽

Chuang-Chieh Lin ◽

Peter Rossmanith

Keyword(s):

Fixed Parameter

Download Full-text

Fixed Structure Complexity

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_5 ◽

2008 ◽

pp. 30-42 ◽

Cited By ~ 3

Author(s):

Yonatan Aumann ◽

Yair Dombb

Keyword(s):

Structure Complexity ◽

Fixed Structure

Download Full-text

Algorithmic Graph Minors and Bidimensionality

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_2 ◽

2008 ◽

pp. 9-9

Author(s):

Erik D. Demaine

Keyword(s):

Graph Minors

Download Full-text

A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_19 ◽

2008 ◽

pp. 202-213 ◽

Cited By ~ 15

Author(s):

Magnus Wahlström

Download Full-text

A Purely Democratic Characterization of W[1]

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_11 ◽

2008 ◽

pp. 103-114 ◽

Cited By ~ 1

Author(s):

Michael Fellows ◽

Danny Hermelin ◽

Moritz Müller ◽

Frances Rosamond

Download Full-text

The Time Complexity of Constraint Satisfaction

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_18 ◽

2008 ◽

pp. 190-201 ◽

Cited By ~ 15

Author(s):

Patrick Traxler

Keyword(s):

Constraint Satisfaction ◽

Time Complexity

Download Full-text

An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79723-4_6 ◽

2008 ◽

pp. 43-54

Author(s):

Sebastian Böcker ◽

Quang Bao Anh Bui ◽

Anke Truss

Keyword(s):

Consensus Trees ◽

Fixed Parameter ◽

Fixed Parameter Algorithm

Download Full-text

Parameterized and Exact Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem

Parameterized Chess

Parameterized Complexity and Approximability of the SLCS Problem

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem

Fixed Structure Complexity

Algorithmic Graph Minors and Bidimensionality

A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances

A Purely Democratic Characterization of W[1]

The Time Complexity of Constraint Satisfaction

An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees

Parameterized and Exact Computation - Lecture Notes in Computer Science
Latest Publications