<?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%">Faster FPT algorithms for deletion to pairs of graph classes</style></title><secondary-title><style face="normal" font="default" size="100%">Fundamentals of Computation Theory: 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings 23</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pages><style face="normal" font="default" size="100%">314–326</style></pages><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>