pdfformat: 

@InProceedings{tamura_et_al:LIPIcs:2020:13384, author = {Yuma Tamura and Takehiro Ito and Xiao Zhou}, title = {{Minimization and Parameterized Variants of Vertex Partition Problems on Graphs}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {40:140:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771733}, ISSN = {18688969}, year = {2020}, volume = {181}, editor = {Yixin Cao and SiuWing Cheng and Minming Li}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13384}, URN = {urn:nbn:de:0030drops133844}, doi = {10.4230/LIPIcs.ISAAC.2020.40}, annote = {Keywords: Graph Algorithms, Approximability, FixedParameter Tractability, Vertex Partition Problem, Feedback Vertex Set Problem} }
Keywords:  Graph Algorithms, Approximability, FixedParameter Tractability, Vertex Partition Problem, Feedback Vertex Set Problem  
Seminar:  31st International Symposium on Algorithms and Computation (ISAAC 2020)  
Issue date:  2020  
Date of publication:  04.12.2020 