Author:
Jain Pallavi,Rathore Manveer Singh
Publisher
Springer Nature Switzerland
Reference24 articles.
1. Agrawal, A., Gupta, S., Saurabh, S., Sharma, R.: Improved algorithms and combinatorial bounds for independent feedback vertex set. In: Guo, J., Hermelin, D. (eds.) IPEC, pp. 2:1–2:14 (2016)
2. Agrawal, A., Jain, P., Kanesh, L., Lokshtanov, D., Saurabh, S.: Conflict free feedback vertex set: a parameterized dichotomy. In: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) MFCS, pp. 53:1–53:15 (2018)
3. Agrawal, A., Jain, P., Kanesh, L., Saurabh, S.: Parameterized complexity of conflict-free matchings and paths. Algorithmica 82(7), 1939–1965 (2020)
4. Arkin, E.M., et al.: Conflict-free covering. In: CCCG (2015)
5. Banik, A., Panolan, F., Raman, V., Sahlot, V., Saurabh, S.: Parameterized complexity of geometric covering problems having conflicts. Algorithmica 82(1), 1–19 (2020)