On the Parameterized Complexity of Grid Contraction

Saurabh, Saket; Souza, Uéverton dos Santos; Tale, Prafullkumar

doi:10.4230/LIPIcs.SWAT.2020.34

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Parameterized Complexity of Grid Contraction

MPS-Authors

/persons/resource/persons79462

Saurabh, Saket
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons180937

Tale, Prafullkumar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2020/12281/
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Saurabh, S., Souza, U. d. S., & Tale, P. (2020). On the Parameterized Complexity of Grid Contraction. In S. Albers (Ed.), 17th Scandinavian Symposium and Workshops on Algorithm Theory. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SWAT.2020.34.

Cite as: https://hdl.handle.net/21.11116/0000-0006-8BA6-2

Abstract

There is no abstract available