Parameterized pre-coloring extension and list coloring problems

Gutin, G., Majumdar, D., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (1 more author) (2020) Parameterized pre-coloring extension and list coloring problems. In: Paul, C. and Bläser, M., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 10-13 Mar 2020, Montpellier, France. Leibniz International Proceedings in Informatics (LIPIcs) (154). Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 9783959771405

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2020 The Authors. Licensed under Creative Commons License CC-BY (https://creativecommons.org/licenses/by/3.0/).
Keywords: Parameterized Algorithms; W-hardness; Kernelization; Graph Coloring; List Coloring
Dates:
  • Published (online): 27 February 2020
  • Published: 1 March 2020
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 29 Apr 2020 09:05
Last Modified: 29 Apr 2020 09:05
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Series Name: Leibniz International Proceedings in Informatics (LIPIcs)
Refereed: Yes
Identification Number: https://doi.org/10.4230/LIPIcs.STACS.2020.19
Related URLs:

Share / Export

Statistics