On the Parameterized Complexity of Vertex Cover and Edge Cover with 
Connectivity Constraints

Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket

doi:10.1016/j.tcs.2014.10.035

Local TagsRelease HistoryDetailsSummary

On the Parameterized Complexity of Vertex Cover and Edge Cover with Connectivity Constraints

Fernau, H., Fomin, F. V., Philip, G., & Saurabh, S. (2015). On the Parameterized Complexity of Vertex Cover and Edge Cover with Connectivity Constraints. Theoretical Computer Science, 565, 1-15. doi:10.1016/j.tcs.2014.10.035.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-4764-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-AA81-E

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Fernau, Henning¹, Author
Fomin, Fedor V.¹, Author
Philip, Geevarghese², Author
Saurabh, Saket¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Accepted: 2014-10-21Published Online: 2014-10-28Date issued: 2015

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: FernauFominPhilipSaurabh
DOI: 10.1016/j.tcs.2014.10.035

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Theoretical Computer Science

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 565 Sequence Number: - Start / End Page: 1 - 15 Identifier: ISSN: 0304-3975
CoNE: https://pure.mpg.de/cone/journals/resource/954925512450