Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher 
Guarantee

Garg, Shivam; Philip, Geevarghese

doi:10.1137/1.9781611974331.ch80

Local TagsRelease HistoryDetailsSummary

Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee

Garg, S., & Philip, G. (2016). Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee. In R. Krauthgamer (Ed.), Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1152-1166). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974331.ch80.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-8205-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0029-4B15-6

Genre: Conference Paper

Latex : Raising The Bar For Vertex Cover: {F}ixed-parameter Tractability Above A Higher Guarantee

Files

show Files

Locators

show

Creators

show

hide

Creators:
Garg, Shivam¹, Author
Philip, Geevarghese², 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: 2015-09-15Published Online: 2016

Publication Status: Published online

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: GargSODA2015
DOI: 10.1137/1.9781611974331.ch80

Degree: -

Event

show

hide

Title: Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

Place of Event: Arlington, VA, USA

Start-/End Date: 2016-01-10 - 2016-01-12

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

Abbreviation : SODA 2016

Source Genre: Proceedings

Creator(s):
Krauthgamer, Robert¹, Editor

Affiliations:
1 External Organizations, ou_persistent22

Publ. Info: Philadelphia, PA : SIAM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1152 - 1166 Identifier: ISBN: 978-1-61197-433-1