<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jacob, Ashwin</style></author><author><style face="normal" font="default" size="100%">Majumdar, Diptapriyo</style></author><author><style face="normal" font="default" size="100%">Raman, Venkatesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Parameterized complexity of deletion to scattered graph classes</style></title><secondary-title><style face="normal" font="default" size="100%">15th International Symposium on Parameterized and Exact Computation (IPEC 2020)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><publisher><style face="normal" font="default" size="100%">Schloss Dagstuhl-Leibniz-Zentrum für Informatik</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">n/a</style></abstract><notes><style face="normal" font="default" size="100%">n/a</style></notes></record></records></xml>