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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319135236, 9783319135243

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Editing to a Graph of Given Degrees

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_17 ◽

2014 ◽

pp. 196-207 ◽

Cited By ~ 2

Author(s):

Petr A. Golovach

Download Full-text

Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_24 ◽

2014 ◽

pp. 282-293 ◽

Cited By ~ 1

Author(s):

Henri Perret du Cray ◽

Ignasi Sau

Keyword(s):

Independent Set ◽

Fpt Algorithms

Download Full-text

The $$k$$ -Distinct Language: Parameterized Automata Constructions

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_8 ◽

2014 ◽

pp. 85-96

Author(s):

Ran Ben-Basat ◽

Ariel Gabizon ◽

Meirav Zehavi

Download Full-text

Parameterized Inapproximability of Degree Anonymization

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_7 ◽

2014 ◽

pp. 75-84 ◽

Cited By ~ 2

Author(s):

Cristina Bazgan ◽

André Nichterlein

Download Full-text

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_14 ◽

2014 ◽

pp. 159-171 ◽

Cited By ~ 2

Author(s):

Rajesh Hemant Chitnis ◽

Hossein Esfandiari ◽

MohammadTaghi Hajiaghayi ◽

Rohit Khandekar ◽

Guy Kortsarz ◽

...

Keyword(s):

Strongly Connected

Download Full-text

AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_16 ◽

2014 ◽

pp. 184-195

Author(s):

Holger Dell

Keyword(s):

Complete Problems ◽

Np Complete

Download Full-text

Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_18 ◽

2014 ◽

pp. 208-220 ◽

Cited By ~ 1

Author(s):

Gregory Gutin ◽

Stefan Kratsch ◽

Magnus Wahlström

Keyword(s):

Satisfiability Problem ◽

Polynomial Kernels

Download Full-text

The Parameterized Complexity of Geometric Graph Isomorphism

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_5 ◽

2014 ◽

pp. 51-62

Author(s):

Vikraman Arvind ◽

Gaurav Rattan

Keyword(s):

Parameterized Complexity ◽

Graph Isomorphism ◽

Geometric Graph

Download Full-text

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_10 ◽

2014 ◽

pp. 110-121 ◽

Cited By ~ 12

Author(s):

Paul Bonsma ◽

Amer E. Mouawad ◽

Naomi Nishimura ◽

Venkatesh Raman

Download Full-text

On Polynomial Kernelization of $$\mathcal {H}$$ -free Edge Deletion

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_3 ◽

2014 ◽

pp. 28-38 ◽

Cited By ~ 2

Author(s):

N. R. Aravind ◽

R. B. Sandeep ◽

Naveen Sivadasan

Keyword(s):

Free Edge ◽

Edge Deletion

Download Full-text

Parameterized and Exact Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Editing to a Graph of Given Degrees

Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs

The $$k$$ -Distinct Language: Parameterized Automata Constructions

Parameterized Inapproximability of Degree Anonymization

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)

AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations

Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

The Parameterized Complexity of Geometric Graph Isomorphism

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration

On Polynomial Kernelization of $$\mathcal {H}$$ -free Edge Deletion

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