{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T20:40:09Z","timestamp":1762807209909},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00453-022-00971-7","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T07:03:57Z","timestamp":1651561437000},"page":"2335-2357","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Structural Parameterizations with Modulator Oblivion"],"prefix":"10.1007","volume":"84","author":[{"given":"Ashwin","family":"Jacob","sequence":"first","affiliation":[]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Vibha","family":"Sahlot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,3]]},"reference":[{"key":"971_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, A., Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Polylogarithmic approximation algorithms for weighted-f-deletion problems. ACM Trans. Algorithms 16(4), 51:1-51:38 (2020)","DOI":"10.1145\/3389338"},{"issue":"6","key":"971_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"971_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ic.2014.12.008","volume":"243","author":"HL Bodlaender","year":"2015","unstructured":"Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86\u2013111 (2015)","journal-title":"Inf. Comput."},{"issue":"2","key":"971_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $$c^{kn}$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"key":"971_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11, 191\u2013199 (1982)","journal-title":"SIAM J. Comput."},{"key":"971_CR6","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A.: On robust algorithms for the maximum weight stable set problem. In: International Symposium on Fundamentals of Computation Theory, pp. 445\u2013458. Springer (2001)","DOI":"10.1007\/3-540-44669-9_51"},{"issue":"1\u20132","key":"971_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1\u20132), 3\u201324 (1998)","journal-title":"Comput. Geom."},{"issue":"1","key":"971_CR8","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s00453-015-0014-x","volume":"75","author":"Y Cao","year":"2016","unstructured":"Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. Algorithmica 75(1), 118\u2013137 (2016)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"971_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"issue":"2","key":"971_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","volume":"22","author":"DG Corneil","year":"1988","unstructured":"Corneil, D.G., Fonlupt, J.: The complexity of generalized clique covering. Discrete Appl. Math. 22(2), 109\u2013118 (1988)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"971_CR11","doi-asserted-by":"publisher","first-page":"41:1","DOI":"10.1145\/2925416","volume":"12","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., Paturi, R., Saurabh, S., Wahlstr\u00f6m, M.: On problems as hard as CNF-SAT. ACM Trans. Algorithms 12(3), 41:1-41:24 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"971_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, vol. 3. Springer, Berlin (2015)"},{"issue":"1","key":"971_CR13","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2462896.2462899","volume":"5","author":"M Cygan","year":"2013","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: On multiway cut parameterized above lower bounds. TOCT 5(1), 3:1-3:11 (2013)","journal-title":"TOCT"},{"key":"971_CR14","volume-title":"Graph Theory","author":"R Diestel","year":"2006","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (2006)"},{"key":"971_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 4. Springer, Berlin (2013)"},{"issue":"3","key":"971_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0012-365X(89)90268-9","volume":"73","author":"M Farber","year":"1989","unstructured":"Farber, M.: On diameters and radii of bridged graphs. Discrete Math. 73(3), 249\u2013260 (1989)","journal-title":"Discrete Math."},{"key":"971_CR17","doi-asserted-by":"crossref","unstructured":"Fellows, M., Rosamond, F.: The complexity ecology of parameters: an illustration using bounded max leaf number. In: Conference on Computability in Europe, pp. 268\u2013277. Springer, (2007)","DOI":"10.1007\/978-3-540-73001-9_28"},{"issue":"3","key":"971_CR18","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"MR Fellows","year":"2013","unstructured":"Fellows, M.R., Jansen, B.M., Rosamond, F.: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34(3), 541\u2013566 (2013)","journal-title":"Eur. J. Comb."},{"key":"971_CR19","unstructured":"Fomin, F.V., Golovach, P.A.: Subexponential parameterized algorithms and kernelization on almost chordal graphs. In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7\u20139, 2020, Pisa, Italy (Virtual Conference), pp. 49:1\u201349:17 (2020)"},{"issue":"1","key":"971_CR20","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/17M1140030","volume":"33","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Kaski, P., Lokshtanov, D., Panolan, F., Saurabh, S.: Parameterized single-exponential time polynomial space algorithm for steiner tree. SIAM J. Discrete Math. 33(1), 327\u2013345 (2019)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"971_CR21","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/140964801","volume":"44","author":"FV Fomin","year":"2015","unstructured":"Fomin, F.V., Todinca, I., Villanger, Y.: Large induced subgraphs via triangulations and CMSO. SIAM J. Comput. 44(1), 54\u201387 (2015)","journal-title":"SIAM J. Comput."},{"key":"971_CR22","unstructured":"Gaspers, S., Szeider, S.: Backdoors to satisfaction. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) The Multivariate Algorithmic Revolution and Beyond-Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, volume 7370 of Lecture Notes in Computer Science, pp. 287\u2013317. Springer (2012)"},{"key":"971_CR23","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)"},{"issue":"2","key":"971_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2004.01.011","volume":"145","author":"M Habib","year":"2005","unstructured":"Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Appl. Math. 145(2), 183\u2013197 (2005)","journal-title":"Discrete Appl. Math."},{"key":"971_CR25","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2012.03.013","volume":"511","author":"P Heggernes","year":"2013","unstructured":"Heggernes, P., van\u2019t Hof, P., Jansen, B.M.P., Kratsch, S., Villanger, Y.: Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. 511, 172\u2013180 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"971_CR26","doi-asserted-by":"crossref","unstructured":"Iwata, Y., Yamaguchi, Y., Yoshida, Y.: 0\/1\/all CSPs, Half-integral A-path packing, and linear-time FPT algorithms. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 462\u2013473. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00051"},{"key":"971_CR27","unstructured":"Jacob, A., Panolan, F., Raman, V., Sahlot, V.: Structural parameterizations with modulator oblivion. In: 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14\u201318, 2020, Hong Kong, China (Virtual Conference), pp. 19:1\u201319:18 (2020)"},{"key":"971_CR28","unstructured":"Jansen, B.M.: The Power of Data Reduction: Kernels for Fundamental Graph Problems. PhD thesis, Utrecht University (2013)"},{"issue":"2","key":"971_CR29","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00224-012-9393-4","volume":"53","author":"BM Jansen","year":"2013","unstructured":"Jansen, B.M., Bodlaender, H.L.: Vertex cover kernelization revisited. Theory Comput. Syst. 53(2), 263\u2013299 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"971_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TST.2014.6867520","volume":"19","author":"BM Jansen","year":"2014","unstructured":"Jansen, B.M., Raman, V., Vatshelle, M.: Parameter ecology for feedback vertex set. Tsinghua Sci. Technol. 19(4), 387\u2013409 (2014)","journal-title":"Tsinghua Sci. Technol."},{"issue":"3","key":"971_CR31","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1137\/17M112035X","volume":"32","author":"BMP Jansen","year":"2018","unstructured":"Jansen, B.M.P., Pilipczuk, M.: Approximation and kernelization for chordal vertex deletion. SIAM J. Discrete Math. 32(3), 2258\u20132301 (2018)","journal-title":"SIAM J. Discrete Math."},{"key":"971_CR32","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.jctb.2020.05.002","volume":"145","author":"EJ Kim","year":"2020","unstructured":"Kim, E.J., Kwon, O.: Erd\u0151s-p\u00f3sa property of chordless cycles and its applications. J. Comb. Theory Ser. B 145, 65\u2013112 (2020)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"971_CR33","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1007\/s00453-018-0453-2","volume":"81","author":"M Liedloff","year":"2019","unstructured":"Liedloff, M., Montealegre, P., Todinca, I.: Beyond classes of graphs with \u201cfew\u2019\u2019 minimal separators: FPT results through potential maximal cliques. Algorithmica 81(3), 986\u20131005 (2019)","journal-title":"Algorithmica"},{"issue":"2","key":"971_CR34","first-page":"15","volume":"11","author":"D Lokshtanov","year":"2014","unstructured":"Lokshtanov, D., Narayanaswamy, N., Raman, V., Ramanujan, M., Saurabh, S.: Faster parameterized algorithms using linear programming. ACM Trans. Algorithms (TALG) 11(2), 15 (2014)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"9","key":"971_CR35","doi-asserted-by":"publisher","first-page":"2683","DOI":"10.1007\/s00453-018-0419-4","volume":"80","author":"D Majumdar","year":"2018","unstructured":"Majumdar, D., Raman, V.: Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization. Algorithmica 80(9), 2683\u20132724 (2018)","journal-title":"Algorithmica"},{"issue":"8","key":"971_CR36","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1007\/s00224-018-9858-1","volume":"62","author":"D Majumdar","year":"2018","unstructured":"Majumdar, D., Raman, V., Saurabh, S.: Polynomial kernels for vertex cover parameterized by small degree modulators. Theory Comput. Syst. 62(8), 1910\u20131951 (2018)","journal-title":"Theory Comput. Syst."},{"key":"971_CR37","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Scandinavian Workshop on Algorithm Theory, pp. 260\u2013272. Springer (2004)","DOI":"10.1007\/978-3-540-27810-8_23"},{"issue":"1","key":"971_CR38","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0196-6774(03)00048-8","volume":"48","author":"V Raghavan","year":"2003","unstructured":"Raghavan, V., Spinrad, J.P.: Robust algorithms for restricted domains. J. Algorithms 48(1), 160\u2013172 (2003)","journal-title":"J. Algorithms"},{"issue":"1","key":"971_CR39","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"key":"971_CR40","doi-asserted-by":"publisher","DOI":"10.1090\/fim\/019","volume-title":"Efficient Graph Representations","author":"JP Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society, Providence (2003)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00971-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00971-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00971-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T13:11:26Z","timestamp":1658409086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00971-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,3]]},"references-count":40,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["971"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00971-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,3]]},"assertion":[{"value":"18 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}