{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T13:11:31Z","timestamp":1769692291701,"version":"3.49.0"},"publisher-location":"Cham","reference-count":173,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031215339","type":"print"},{"value":"9783031215346","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T00:00:00Z","timestamp":1674000000000},"content-version":"vor","delay-in-days":382,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has resulted in an algorithmic toolbox that is by now well-established. However, these theoretical algorithmic ideas have received very little attention from the practical perspective. We survey recent trends in data reduction engineering results for selected problems. Moreover, we describe concrete techniques that may be useful for future implementations in the area and give open problems and research questions.<\/jats:p>","DOI":"10.1007\/978-3-031-21534-6_6","type":"book-chapter","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T20:02:53Z","timestamp":1673985773000},"page":"97-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Recent Advances in\u00a0Practical Data Reduction"],"prefix":"10.1007","author":[{"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Lamm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Mnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Noe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darren","family":"Strash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,18]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Abello, J., Pardalos, P.M., Resende, M.: On maximum clique problems in very large graphs. In: External Memory Algorithms, pp. 119\u2013130 (1999). https:\/\/doi.org\/10.1090\/dimacs\/050\/06","DOI":"10.1090\/dimacs\/050\/06"},{"issue":"7","key":"6_CR2","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for $$d$$-hitting set. J. Comput. Syst. Sci. 76(7), 524\u2013531 (2010). https:\/\/doi.org\/10.1016\/j.jcss.2009.09.002","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.jda.2017.07.003","volume":"45","author":"FN Abu-Khzam","year":"2017","unstructured":"Abu-Khzam, F.N.: On the complexity of multi-parameterized cluster editing. J. Discrete Algor. 45, 26\u201334 (2017). https:\/\/doi.org\/10.1016\/j.jda.2017.07.003","journal-title":"J. Discrete Algor."},{"key":"6_CR4","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of ALENEX\/ANALCO, pp. 62\u201369 (2004)"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Akiba, T., Iwata, Y.: Branch-and-reduce exponential\/FPT algorithms in practice: a case study of vertex cover. Theore. Comput. Sci. 609, Part 1, 211\u2013225 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.09.023","DOI":"10.1016\/j.tcs.2015.09.023"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-030-34223-4_45","volume-title":"Web Information Systems Engineering \u2013 WISE 2019","author":"M Alsahafy","year":"2019","unstructured":"Alsahafy, M., Chang, L.: Computing maximum independent sets over large sparse graphs. In: Cheng, R., Mamoulis, N., Sun, Y., Huang, X. (eds.) WISE 2020. LNCS, vol. 11881, pp. 711\u2013727. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34223-4_45"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525\u2013547 (2012). https:\/\/doi.org\/10.1007\/s10732-012-9196-4","journal-title":"J. Heuristics"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0607033","volume":"7","author":"S Arnborg","year":"1986","unstructured":"Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Algeb. Discrete Methods 7(2), 305\u2013314 (1986). https:\/\/doi.org\/10.1137\/0607033","journal-title":"SIAM J. Algeb. Discrete Methods"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1137\/0916081","volume":"16","author":"C Ashcraft","year":"1995","unstructured":"Ashcraft, C.: Compressed graphs and the minimum degree algorithm. SIAM J. Scient. Comput. 16(6), 1404\u20131411 (1995). https:\/\/doi.org\/10.1137\/0916081","journal-title":"SIAM J. Scient. Comput."},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona, F., Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493\u2013513 (1988). https:\/\/doi.org\/10.1287\/opre.36.3.493","journal-title":"Oper. Res."},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Barr, J.R., Shaw, P., Abu-Khzam, F.N., Yu, S., Yin, H., Thatcher, T.: Combinatorial code classification vulnerability rating. In: 2020 Second TransAI, pp. 80\u201383 (2020). https:\/\/doi.org\/10.1109\/TransAI49837.2020.00017","DOI":"10.1109\/TransAI49837.2020.00017"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Barr, J.R., Shaw, P., Abu-Khzam, F.N., Chen, J.: Combinatorial text classification: the effect of multi-parameterized correlation clustering. In: Proceedings of GC 2019, pp. 29\u201336 (2019). https:\/\/doi.org\/10.1109\/GC46384.2019.00013","DOI":"10.1109\/GC46384.2019.00013"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Baste, J., et al.: Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. In: Proceedings of IJCAI 2020, pp. 1119\u20131125 (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/156","DOI":"10.24963\/ijcai.2020\/156"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Berlowitz, D., Cohen, S., Kimelfeld, B.: Efficient enumeration of maximal $$k$$-plexes. In: Proceedings of SIGMOD 2015, pp. 431\u2013444 (2015). https:\/\/doi.org\/10.1145\/2723372.2746478","DOI":"10.1145\/2723372.2746478"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Fischbeck, P., Friedrich, T., Schirneck, M.: Understanding the effectiveness of data reduction in public transportation networks. In: Proceedings of WAW 2019, pp. 87\u2013101 (2019). https:\/\/doi.org\/10.1007\/978-3-030-25070-6_7","DOI":"10.1007\/978-3-030-25070-6_7"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jda.2012.04.005","volume":"16","author":"S B\u00f6cker","year":"2012","unstructured":"B\u00f6cker, S.: A golden ratio parameterized algorithm for cluster editing. J. Discrete Algor. 16, 79\u201389 (2012). https:\/\/doi.org\/10.1016\/j.jda.2012.04.005","journal-title":"J. Discrete Algor."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-39053-1_5","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"S B\u00f6cker","year":"2013","unstructured":"B\u00f6cker, S., Baumbach, J.: Cluster editing. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 33\u201344. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_5"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"5467","DOI":"10.1016\/j.tcs.2009.05.006","volume":"410","author":"S B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Truss, A.: Going weighted: parameterized algorithms for cluster editing. Theor. Comput. Sci. 410, 5467\u20135480 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.05.006","journal-title":"Theor. Comput. Sci."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: A fixed-parameter approach for weighted cluster editing. In: Proceedings of APBC 2008, pp. 211\u2013220 (2008). https:\/\/doi.org\/10.1142\/9781848161092_0023","DOI":"10.1142\/9781848161092_0023"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: evaluation and experiments. Algorithmica 60(2), 316\u2013334 (2011). https:\/\/doi.org\/10.1007\/s00453-009-9339-7","journal-title":"Algorithmica"},{"issue":"6","key":"6_CR21","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). https:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"issue":"8","key":"6_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009). https:\/\/doi.org\/10.1016\/j.jcss.2009.04.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"6_CR23","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^k n$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016). https:\/\/doi.org\/10.1137\/130947374","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s00453-010-9421-1","volume":"61","author":"HL Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Heggernes, P., Villanger, Y.: Faster parameterized algorithms for Minimum Fill-in. Algorithmica 61(4), 817\u2013838 (2010). https:\/\/doi.org\/10.1007\/s00453-010-9421-1","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"2108","DOI":"10.1137\/120903518","volume":"27","author":"HL Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for treewidth: a combinatorial analysis through kernelization. SIAM J. Discrete Math. 27(4), 2108\u20132142 (2013). https:\/\/doi.org\/10.1137\/120903518","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.disc.2005.12.017","volume":"306","author":"HL Bodlaender","year":"2006","unstructured":"Bodlaender, H.L., Koster, A.M.: Safe separators for treewidth. Discrete Math. 306(3), 337\u2013350 (2006). https:\/\/doi.org\/10.1016\/j.disc.2005.12.017","journal-title":"Discrete Math."},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Koster, A.M., Eijkhof, F.V.d.: Preprocessing rules for triangulation of probabilistic networks. Comput. Intell. 21(3), 286\u2013305 (2005). https:\/\/doi.org\/10.1111\/j.1467-8640.2005.00274.x","DOI":"10.1111\/j.1467-8640.2005.00274.x"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Sikora, F.: The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration. In: Proceedings of IPEC 2018, pp. 26:1\u201326:15 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2018.26","DOI":"10.4230\/LIPIcs.IPEC.2018.26"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212\u2013232 (2001). https:\/\/doi.org\/10.1137\/S0097539799359683","journal-title":"SIAM J. Comput."},{"issue":"9","key":"6_CR30","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Comm. ACM 16(9), 575\u2013577 (1973). https:\/\/doi.org\/10.1145\/362342.362367","journal-title":"Comm. ACM"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1137\/15M1045521","volume":"47","author":"N Buchbinder","year":"2018","unstructured":"Buchbinder, N., Naor, J., Schwartz, R.: Simplex partitioning via exponential clocks and the multiway cut problem. SIAM J. Comput. 47, 1463\u20131482 (2018). https:\/\/doi.org\/10.1137\/15M1045521","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR32","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","volume":"84","author":"L Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice classes of parameterized tractability. Ann. Pure Appl. Logic 84(1), 119\u2013138 (1997). https:\/\/doi.org\/10.1016\/S0168-0072(95)00020-8","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K., Luo, C., Sattar, A.: NuMVC: an efficient local search algorithm for minimum vertex cover. J. Artif. Intell. Res. 46, 687\u2013716 (2013). https:\/\/doi.org\/10.1613\/jair.3907","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR34","unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Proceedings of IJCAI 2015, pp. 747\u2013753 (2015)"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Cai, S., Hou, W., Lin, J., Li, Y.: Improving local search for minimum weight vertex cover by dynamic strategies. In: Proceedings of IJCAI 2018, pp. 1412\u20131418 (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/196","DOI":"10.24963\/ijcai.2018\/196"},{"key":"6_CR36","unstructured":"Cai, S., Lin, J.: Fast solving maximum weight clique problem in massive graphs. In: Proceedings of IJCAI 2016, pp. 568\u2013574 (2016)"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1613\/jair.5443","volume":"59","author":"S Cai","year":"2017","unstructured":"Cai, S., Lin, J., Luo, C.: Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess. J. Artif. Intell. Res. 59, 463\u2013494 (2017). https:\/\/doi.org\/10.1613\/jair.5443","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Cao, Y., Chen, J., Fan, J.H.: An $$\\cal{O} (1.84^k)$$ parameterized algorithm for the multiterminal cut problem. Inf. Proc. Lett. 114(4), 167\u2013173 (2014). https:\/\/doi.org\/10.1016\/j.ipl.2013.12.001","DOI":"10.1016\/j.ipl.2013.12.001"},{"key":"6_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104514","volume":"271","author":"Y Cao","year":"2020","unstructured":"Cao, Y., Sandeep, R.: Minimum fill-in: inapproximability and almost tight lower bounds. Inf. Comput. 271, 104514 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104514","journal-title":"Inf. Comput."},{"key":"6_CR40","doi-asserted-by":"publisher","unstructured":"Chang, L.: Efficient maximum clique computation over large sparse graphs. In: Proceedings of KDD 2019, pp. 529\u2013538 (2019). https:\/\/doi.org\/10.1145\/3292500.3330986","DOI":"10.1145\/3292500.3330986"},{"issue":"5","key":"6_CR41","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1007\/s00778-020-00602-z","volume":"29","author":"L Chang","year":"2020","unstructured":"Chang, L.: Efficient maximum clique computation and enumeration over large sparse graphs. VLDB J. 29(5), 999\u20131022 (2020). https:\/\/doi.org\/10.1007\/s00778-020-00602-z","journal-title":"VLDB J."},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1145\/3035918.3035939","volume":"2017","author":"L Chang","year":"2017","unstructured":"Chang, L., Li, W., Zhang, W.: Computing a near-maximum independent set in linear time by reducing-peeling. Proc. SIGMOD 2017, 1181\u20131196 (2017). https:\/\/doi.org\/10.1145\/3035918.3035939","journal-title":"Proc. SIGMOD"},{"key":"6_CR43","unstructured":"Chekuri, C., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: Proceedings of SODA 1997, pp. 324\u2013333 (1997)"},{"issue":"1","key":"6_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-9130-6","volume":"55","author":"J Chen","year":"2009","unstructured":"Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55(1), 1\u201313 (2009). https:\/\/doi.org\/10.1007\/s00453-007-9130-6","journal-title":"Algorithmica"},{"issue":"1","key":"6_CR45","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jcss.2011.04.001","volume":"78","author":"J Chen","year":"2012","unstructured":"Chen, J., Meng, J.: A $$2k$$ kernel for the cluster editing problem. J. Comput. Syst. Sci. 78(1), 211\u2013220 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.04.001","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR46","doi-asserted-by":"publisher","unstructured":"Conte, A., Firmani, D., Mordente, C., Patrignani, M., Torlone, R.: Fast enumeration of large $$k$$-plexes. In: Proceedings of KDD 2017, pp. 115\u2013124 (2017). https:\/\/doi.org\/10.1145\/3097983.3098031","DOI":"10.1145\/3097983.3098031"},{"issue":"3","key":"6_CR47","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1007\/s00453-014-9870-z","volume":"72","author":"R Crowston","year":"2014","unstructured":"Crowston, R., Jones, M., Mnich, M.: Max-cut parameterized above the Edwards-Erd\u0151s bound. Algorithmica 72(3), 734\u2013757 (2014). https:\/\/doi.org\/10.1007\/s00453-014-9870-z","journal-title":"Algorithmica"},{"key":"6_CR48","doi-asserted-by":"publisher","unstructured":"Cunningham, W.H.: The optimal multiterminal cut problem. In: Reliability of Computer and Communication Networks, pp. 105\u2013120 (1989). https:\/\/doi.org\/10.1090\/dimacs\/005\/07","DOI":"10.1090\/dimacs\/005\/07"},{"key":"6_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"4","key":"6_CR50","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994). https:\/\/doi.org\/10.1137\/S0097539792225297","journal-title":"SIAM J. Comput."},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-38851-9_9","volume-title":"Experimental Algorithms","author":"J Dahlum","year":"2016","unstructured":"Dahlum, J., Lamm, S., Sanders, P., Schulz, C., Strash, D., Werneck, R.F.: Accelerating local search for the maximum independent set problem. In: Goldberg, A.V., Kulikov, A.S. (eds.) SEA 2016. LNCS, vol. 9685, pp. 118\u2013133. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-38851-9_9"},{"key":"6_CR52","unstructured":"Daneshmand, S.V.: Algorithmic approaches to the Steiner problem in networks. Ph.D. thesis, Universit\u00e4t Mannheim, Germany (2004). http:\/\/bibserv7.bib.uni-mannheim.de\/madoc\/volltexte\/2004\/176\/index.html"},{"key":"6_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11847250_2","volume-title":"Parameterized and Exact Computation","author":"F Dehne","year":"2006","unstructured":"Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 13\u201324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11847250_2"},{"key":"6_CR54","doi-asserted-by":"publisher","unstructured":"Dell, H., Husfeldt, T., Jansen, B.M.P., Kaski, P., Komusiewicz, C., Rosamond, F.A.: The first parameterized algorithms and computational experiments challenge. In: Proceedings of IPEC 2016, LIPI, vol. 63, pp. 30:1\u201330:9 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2016.30","DOI":"10.4230\/LIPIcs.IPEC.2016.30"},{"key":"6_CR55","unstructured":"Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: Proceedings of IPEC 2017, LIPI, vol. 89, pp. 30:1\u201330:12 (2017)"},{"key":"6_CR56","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"2","key":"6_CR57","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/229473.229480","volume":"22","author":"IS Duff","year":"1996","unstructured":"Duff, I.S., Reid, J.K.: Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 22(2), 227\u2013257 (1996). https:\/\/doi.org\/10.1145\/229473.229480","journal-title":"ACM Trans. Math. Softw."},{"key":"6_CR58","doi-asserted-by":"publisher","unstructured":"Dzulfikar, M.A., Fichte, J.K., Hecher, M.: The PACE 2019 parameterized algorithms and computational experiments challenge: the fourth iteration (invited paper). In: Proceedings of IPEC 2019, LIPI, vol. 148, pp. 25:1\u201325:23 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2019.25","DOI":"10.4230\/LIPIcs.IPEC.2019.25"},{"key":"6_CR59","doi-asserted-by":"publisher","unstructured":"Ebenegger, C., Hammer, P., De Werra, D.: Pseudo-boolean functions and stability of graphs. In: North-Holland mathematics studies, vol. 95, pp. 83\u201397 (1984). https:\/\/doi.org\/10.1016\/S0304-0208(08)72955-4","DOI":"10.1016\/S0304-0208(08)72955-4"},{"key":"6_CR60","doi-asserted-by":"publisher","unstructured":"Eblen, J.D., Phillips, C.A., Rogers, G.L., Langston, M.A.: The maximum clique enumeration problem: algorithms, applications, and implementations. In: BMC Bioinformatics, p. S5 (2012). https:\/\/doi.org\/10.1186\/1471-2105-13-S10-S5","DOI":"10.1186\/1471-2105-13-S10-S5"},{"issue":"3","key":"6_CR61","doi-asserted-by":"publisher","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"25","author":"CS Edwards","year":"1973","unstructured":"Edwards, C.S.: Some extremal properties of bipartite subgraphs. Can. J. Math. 25(3), 475\u2013485 (1973). https:\/\/doi.org\/10.4153\/CJM-1973-048-x","journal-title":"Can. J. Math."},{"key":"6_CR62","unstructured":"Edwards, C.: An improved lower bound for the number of edges in a largest bipartite subgraph. In: Recent Advances in Graph Theory, pp. 167\u2013181 (1975)"},{"issue":"2","key":"6_CR63","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00453-006-1226-x","volume":"47","author":"F van den Eijkhof","year":"2007","unstructured":"van den Eijkhof, F., Bodlaender, H.L., Koster, A.M.C.A.: Safe reduction rules for weighted treewidth. Algorithmica 47(2), 139\u2013158 (2007). https:\/\/doi.org\/10.1007\/s00453-006-1226-x","journal-title":"Algorithmica"},{"key":"6_CR64","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2543629","volume":"18","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs in near-optimal time. J. Exp. Algorithmics 18, 3\u20131 (2013). https:\/\/doi.org\/10.1145\/2543629","journal-title":"J. Exp. Algorithmics"},{"key":"6_CR65","doi-asserted-by":"publisher","unstructured":"Erickson, R.E., Monma, C.L., Jr., A.F.V.: Send-and-split method for minimum-concave-cost network flows. Math. Oper. Res. 12(4), 634\u2013664 (1987). https:\/\/doi.org\/10.1287\/moor.12.4.634","DOI":"10.1287\/moor.12.4.634"},{"issue":"9","key":"6_CR66","doi-asserted-by":"publisher","first-page":"2574","DOI":"10.1007\/s00453-017-0388-z","volume":"80","author":"M Etscheid","year":"2017","unstructured":"Etscheid, M., Mnich, M.: Linear kernels and linear-time algorithms for finding large cuts. Algorithmica 80(9), 2574\u20132615 (2017). https:\/\/doi.org\/10.1007\/s00453-017-0388-z","journal-title":"Algorithmica"},{"key":"6_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-662-48054-0_25","volume-title":"Mathematical Foundations of Computer Science 2015","author":"S Fafianie","year":"2015","unstructured":"Fafianie, S., Kratsch, S.: A shortcut to (sun)flowers: kernels in logarithmic space or linear time. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 299\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_25"},{"key":"6_CR68","doi-asserted-by":"publisher","unstructured":"Ferizovic, D., Hespe, D., Lamm, S., Mnich, M., Schulz, C., Strash, D.: Engineering kernelization for maximum cut. In: Proceedings of ALENEX 2020, pp. 27\u201341 (2020). https:\/\/doi.org\/10.1137\/1.9781611976007.3","DOI":"10.1137\/1.9781611976007.3"},{"key":"6_CR69","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 25:1\u201325:32 (2009). https:\/\/doi.org\/10.1145\/1552285.1552286","DOI":"10.1145\/1552285.1552286"},{"key":"6_CR70","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781107415157","DOI":"10.1017\/9781107415157"},{"issue":"6","key":"6_CR71","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1137\/11085390X","volume":"42","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in. SIAM J. Comput. 42(6), 2197\u20132216 (2013). https:\/\/doi.org\/10.1137\/11085390X","journal-title":"SIAM J. Comput."},{"key":"6_CR72","doi-asserted-by":"publisher","unstructured":"Gao, J., Chen, J., Yin, M., Chen, R., Wang, Y.: An exact algorithm for maximum $$k$$-plexes in massive graphs. In: Proceedings of IJCAI 2018, pp. 1449\u20131455 (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/201","DOI":"10.24963\/ijcai.2018\/201"},{"key":"6_CR73","doi-asserted-by":"publisher","unstructured":"Gao, W., Friedrich, T., K\u00f6tzing, T., Neumann, F.: Scaling up local search for minimum vertex cover in large graphs by parallel kernelization. In: Proceedings of ACAI 2017, pp. 131\u2013143 (2017). https:\/\/doi.org\/10.1007\/978-3-319-63004-5_11","DOI":"10.1007\/978-3-319-63004-5_11"},{"key":"6_CR74","doi-asserted-by":"publisher","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of STOC 1974, pp. 47\u201363 (1974). https:\/\/doi.org\/10.1145\/800119.803884","DOI":"10.1145\/800119.803884"},{"key":"6_CR75","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., San Francisco, Calif. (1979). A Guide to the Theory of NP-Completeness"},{"key":"6_CR76","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Mozes, S., Weimann, O.: Minimum cut in $$\\cal{O} (m \\log ^2n)$$ time. In: Proceedings of ICALP 2020, LIPI, vol. 168, pp. 57:1\u201357:15 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.57","DOI":"10.4230\/LIPIcs.ICALP.2020.57"},{"key":"6_CR77","doi-asserted-by":"publisher","unstructured":"Gellner, A., Lamm, S., Schulz, C., Strash, D., Zav\u00e1lnij, B.: Boosting data reduction for the maximum weight independent set problem using increasing transformations. In: Proceedings of ALENEX 2021, pp. 128\u2013142. https:\/\/doi.org\/10.1137\/1.9781611976472.10","DOI":"10.1137\/1.9781611976472.10"},{"issue":"2","key":"6_CR78","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A George","year":"1973","unstructured":"George, A.: Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10(2), 345\u2013363 (1973). https:\/\/doi.org\/10.1137\/0710032","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"6_CR79","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A George","year":"1989","unstructured":"George, A., Liu, J.W.: The evolution of the minimum degree ordering algorithm. SIAM Rev. 31(1), 1\u201319 (1989). https:\/\/doi.org\/10.1137\/1031001","journal-title":"SIAM Rev."},{"issue":"3","key":"6_CR80","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1137\/100812513","volume":"42","author":"A Goel","year":"2013","unstructured":"Goel, A., Kapralov, M., Khanna, S.: Perfect matchings in $$\\cal{O} (n\\log n)$$ time in regular bipartite graphs. SIAM J. Comput. 42(3), 1392\u20131404 (2013). https:\/\/doi.org\/10.1137\/100812513","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR81","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9(4), 551\u2013570 (1961). https:\/\/doi.org\/10.1137\/0109047","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"6_CR82","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-44849-7_17","volume-title":"Algorithms and Complexity","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: fixed-parameter algorithms for clique generation. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 108\u2013119. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44849-7_17"},{"issue":"8","key":"6_CR83","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","volume":"410","author":"J Guo","year":"2009","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8), 718\u2013726 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.10.021","journal-title":"Theor. Comput. Sci."},{"key":"6_CR84","unstructured":"Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a graph. In: Proceedings of SODA 1992, pp. 165\u2013174 (1992)"},{"key":"6_CR85","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-16926-7_17","volume-title":"Graph Theoretic Concepts in Computer Science","author":"P Heggernes","year":"2010","unstructured":"Heggernes, P., Lokshtanov, D., Nederlof, J., Paul, C., Telle, J.A.: Generalized graph clustering: recognizing (p,q)-cluster graphs. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 171\u2013183. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_17"},{"key":"6_CR86","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Noe, A., Schulz, C.: Shared-memory exact minimum cuts. In: Proceedings of IPDPS 2019, pp. 13\u201322 (2019). https:\/\/doi.org\/10.1109\/IPDPS.2019.00013","DOI":"10.1109\/IPDPS.2019.00013"},{"key":"6_CR87","unstructured":"Henzinger, M., Noe, A., Schulz, C.: Faster parallel multiterminal cuts. Technical report (2020). https:\/\/arxiv.org\/abs\/2004.11666"},{"key":"6_CR88","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Noe, A., Schulz, C.: Shared-memory branch-and-reduce for multiterminal cuts. In: Proceedings of ALENEX 2020, pp. 42\u201355 (2020). https:\/\/doi.org\/10.1137\/1.9781611976007.4","DOI":"10.1137\/1.9781611976007.4"},{"key":"6_CR89","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Noe, A., Schulz, C., Strash, D.: Practical minimum cut algorithms. ACM J. Exp. Algorithmics 23 (2018). https:\/\/doi.org\/10.1145\/3274662","DOI":"10.1145\/3274662"},{"key":"6_CR90","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Noe, A., Schulz, C., Strash, D.: Finding all global minimum cuts in practice. In: Proceedings of ESA 2020, pp. 59:1\u201359:20 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.59","DOI":"10.4230\/LIPIcs.ESA.2020.59"},{"issue":"1","key":"6_CR91","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/18M1180335","volume":"49","author":"M Henzinger","year":"2020","unstructured":"Henzinger, M., Rao, S., Wang, D.: Local flow partitioning for faster edge connectivity. SIAM J. Comput. 49(1), 1\u201336 (2020). https:\/\/doi.org\/10.1137\/18M1180335","journal-title":"SIAM J. Comput."},{"key":"6_CR92","doi-asserted-by":"publisher","unstructured":"Hespe, D., Lamm, S., Schulz, C., Strash, D.: WeGotYouCovered: the winning solver from the PACE 2019 challenge, vertex cover track. In: Proceedings of CSC 2020, pp. 1\u201311 (2020). https:\/\/doi.org\/10.1137\/1.9781611976229.1","DOI":"10.1137\/1.9781611976229.1"},{"issue":"1","key":"6_CR93","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3355502","volume":"24","author":"D Hespe","year":"2019","unstructured":"Hespe, D., Schulz, C., Strash, D.: Scalable kernelization for maximum independent sets. J. Exp. Algor. 24(1), 1\u201322 (2019). https:\/\/doi.org\/10.1145\/3355502","journal-title":"J. Exp. Algor."},{"key":"6_CR94","doi-asserted-by":"publisher","unstructured":"Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a scalable high quality graph partitioner. In: Proceedings of IPDPS 2010, pp. 1\u201312 (2010). https:\/\/doi.org\/10.1109\/IPDPS.2010.5470485","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"6_CR95","doi-asserted-by":"publisher","unstructured":"Iwata, Y., Oka, K., Yoshida, Y.: Linear-time FPT algorithms via network flow. In: Proceedings of SODA 2014, pp. 1749\u20131761 (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.127","DOI":"10.1137\/1.9781611973402.127"},{"key":"6_CR96","doi-asserted-by":"publisher","unstructured":"Iwata, Y., Shigemura, T.: Separator-based pruned dynamic programming for Steiner tree. In: Proceedings of AAAI 2019, pp. 1520\u20131527 (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33011520","DOI":"10.1609\/aaai.v33i01.33011520"},{"key":"6_CR97","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-57586-5_29","volume-title":"Algorithms and Complexity","author":"L Jaffke","year":"2017","unstructured":"Jaffke, L., Jansen, B.M.P.: Fine-grained parameterized complexity analysis of graph coloring problems. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 345\u2013356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_29"},{"issue":"3","key":"6_CR98","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s00453-014-9924-2","volume":"71","author":"BMP Jansen","year":"2014","unstructured":"Jansen, B.M.P.: On sparsification for computing treewidth. Algorithmica 71(3), 605\u2013635 (2014). https:\/\/doi.org\/10.1007\/s00453-014-9924-2","journal-title":"Algorithmica"},{"issue":"10","key":"6_CR99","doi-asserted-by":"publisher","first-page":"3865","DOI":"10.1007\/s00453-019-00578-5","volume":"81","author":"BMP Jansen","year":"2019","unstructured":"Jansen, B.M.P., Pieterse, A.: Optimal data reduction for graph coloring using low-degree polynomials. Algorithmica 81(10), 3865\u20133889 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00578-5","journal-title":"Algorithmica"},{"key":"6_CR100","doi-asserted-by":"crossref","unstructured":"Jiang, H., Li, C., Many\u00e0, F.: An exact algorithm for the maximum weight clique problem in large graphs. In: Proceedings of AAAI 2017, pp. 830\u2013838 (2017)","DOI":"10.1609\/aaai.v31i1.10648"},{"issue":"1","key":"6_CR101","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s004539910009","volume":"26","author":"M J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Rinaldi, G., Thienel, S.: Practical performance of efficient minimum cut algorithms. Algorithmica 26(1), 172\u2013195 (2000). https:\/\/doi.org\/10.1007\/s004539910009","journal-title":"Algorithmica"},{"issue":"5","key":"6_CR102","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput. 28(5), 1906\u20131922 (1999). https:\/\/doi.org\/10.1137\/S0097539796303044","journal-title":"SIAM J. Comput."},{"key":"6_CR103","doi-asserted-by":"publisher","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping. In: Proceedings of FOCS 1994, pp. 780\u2013791 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365715","DOI":"10.1109\/SFCS.1994.365715"},{"issue":"1","key":"6_CR104","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/331605.331608","volume":"47","author":"DR Karger","year":"2000","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. J. ACM 47(1), 46\u201376 (2000). https:\/\/doi.org\/10.1145\/331605.331608","journal-title":"J. ACM"},{"issue":"4","key":"6_CR105","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"DR Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM 43(4), 601\u2013640 (1996). https:\/\/doi.org\/10.1145\/234533.234534","journal-title":"J. ACM"},{"issue":"3","key":"6_CR106","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.19.3.513","volume":"19","author":"RM Karp","year":"1994","unstructured":"Karp, R.M., Kan, A.H.G.R., Vohra, R.V.: Average case analysis of a heuristic for the assignment problem. Math. Oper. Res. 19(3), 513\u2013522 (1994). https:\/\/doi.org\/10.1287\/moor.19.3.513","journal-title":"Math. Oper. Res."},{"key":"6_CR107","doi-asserted-by":"publisher","unstructured":"Karp, R.M., Sipser, M.: Maximum matchings in sparse random graphs. In: Proceedings of FOCS 1981, pp. 364\u2013375 (1981). https:\/\/doi.org\/10.1109\/SFCS.1981.21","DOI":"10.1109\/SFCS.1981.21"},{"key":"6_CR108","doi-asserted-by":"publisher","unstructured":"Kaya, K., Langguth, J., Panagiotas, I., U\u00e7ar, B.: Karp-Sipser based kernels for bipartite graph matching. In: Proceedings of ALENEX 2020, pp. 134\u2013145 (2020). https:\/\/doi.org\/10.1137\/1.9781611976007.11","DOI":"10.1137\/1.9781611976007.11"},{"key":"6_CR109","doi-asserted-by":"publisher","unstructured":"Kobayashi, Y., Tamaki, H.: Treedepth parameterized by vertex cover number. In: Proceedings of IPEC 2016, Leibniz International Proceedings of Informatics, vol. 63, pp. 18:1\u201318:11 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2016.18","DOI":"10.4230\/LIPIcs.IPEC.2016.18"},{"issue":"15","key":"6_CR110","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discrete Appl. Math. 160(15), 2259\u20132270 (2012). https:\/\/doi.org\/10.1016\/j.dam.2012.05.019","journal-title":"Discrete Appl. Math."},{"key":"6_CR111","doi-asserted-by":"publisher","unstructured":"Korenwein, V., Nichterlein, A., Niedermeier, R., Zschoche, P.: Data reduction for maximum matching on real-world graphs: theory and experiments. In: Proceedings of ESA 2018, Leibniz International Proceedings of Informatics, vol. 112, pp. 53:1\u201353:13 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.53","DOI":"10.4230\/LIPIcs.ESA.2018.53"},{"key":"6_CR112","unstructured":"Korhonen, T.: SMS in PACE 2020. Technical report (2020). https:\/\/arxiv.org\/abs\/2006.07302"},{"key":"6_CR113","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-20086-6_6","volume-title":"Experimental Algorithms","author":"S Lamm","year":"2015","unstructured":"Lamm, S., Sanders, P., Schulz, C.: Graph partitioning for independent sets. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 68\u201381. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_6"},{"issue":"4","key":"6_CR114","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10732-017-9337-x","volume":"23","author":"S Lamm","year":"2017","unstructured":"Lamm, S., Sanders, P., Schulz, C., Strash, D., Werneck, R.F.: Finding near-optimal independent sets at scale. J. Heurist. 23(4), 207\u2013229 (2017). https:\/\/doi.org\/10.1007\/s10732-017-9337-x","journal-title":"J. Heurist."},{"key":"6_CR115","doi-asserted-by":"publisher","unstructured":"Lamm, S., Schulz, C., Strash, D., Williger, R., Zhang, H.: Exactly solving the maximum weight independent set problem on large real-world graphs. In: Proceedings of ALENEX 2019, pp. 144\u2013158 (2019). https:\/\/doi.org\/10.1137\/1.9781611975499.12","DOI":"10.1137\/1.9781611975499.12"},{"key":"6_CR116","doi-asserted-by":"publisher","unstructured":"Lange, J.H., Andres, B., Swoboda, P.: Combinatorial persistency criteria for multicut and max-cut. In: Proceedings of IEEE Conference Computer Vision Pattern Recognition, pp. 6093\u20136102 (2019). https:\/\/doi.org\/10.1109\/CVPR.2019.00625","DOI":"10.1109\/CVPR.2019.00625"},{"key":"6_CR117","doi-asserted-by":"publisher","unstructured":"Langguth, J., Manne, F., Sanders, P.: Heuristic initialization for bipartite matching problems. ACM J. Exp. Algorithmics 15 (2010). https:\/\/doi.org\/10.1145\/1671970.1712656","DOI":"10.1145\/1671970.1712656"},{"key":"6_CR118","doi-asserted-by":"publisher","unstructured":"Lavallee, B., Russell, H., Sullivan, B.D., van der Poel, A.: Approximating vertex cover using structural rounding. In: Proceedings of ALENEX 2020, pp. 70\u201380 (2020). https:\/\/doi.org\/10.1137\/1.9781611976007.6","DOI":"10.1137\/1.9781611976007.6"},{"key":"6_CR119","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.02.017","volume":"84","author":"CM Li","year":"2017","unstructured":"Li, C.M., Jiang, H., Many\u00e0, F.: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. 84, 1\u201315 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.02.017","journal-title":"Comput. Oper. Res."},{"key":"6_CR120","doi-asserted-by":"publisher","unstructured":"Li, R., Hu, S., Cai, S., Gao, J., Wang, Y., Yin, M.: NuMWVC: a novel local search for minimum weighted vertex cover problem. J. Oper. Res. Soc., 1\u201312 (2019). https:\/\/doi.org\/10.1080\/01605682.2019.1621218","DOI":"10.1080\/01605682.2019.1621218"},{"key":"6_CR121","doi-asserted-by":"publisher","unstructured":"Lin, J., Cai, S., Luo, C., Su, K.: A reduction based method for coloring very large graphs. In: Proceedings of IJCAI 2017, pp. 517\u2013523 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/73","DOI":"10.24963\/ijcai.2017\/73"},{"key":"6_CR122","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Known algorithms on graphs of bounded treewidth are probably optimal. ACM Trans. Algor. 14(2) (2018). https:\/\/doi.org\/10.1145\/3170442","DOI":"10.1145\/3170442"},{"issue":"3","key":"6_CR123","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","volume":"351","author":"D Marx","year":"2006","unstructured":"Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci. 351(3), 394\u2013406 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2005.10.007","journal-title":"Theor. Comput. Sci."},{"key":"6_CR124","unstructured":"Matula, D.W.: A linear time $$2+\\varepsilon $$ approximation algorithm for edge connectivity. In: Proceedings of SODA 1993, pp. 500\u2013504 (1993)"},{"key":"6_CR125","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0013055","volume":"5","author":"D Mellor","year":"2010","unstructured":"Mellor, D., Prieto-Rodr\u00edguez, E., Mathieson, L., Moscato, P.A.: A kernelisation approach for multiple $$d$$-hitting set and its application in optimal multi-drug therapeutic combinations. PLoS ONE 5, 1\u201313 (2010)","journal-title":"PLoS ONE"},{"issue":"5","key":"6_CR126","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1016\/j.dam.2005.05.022","volume":"154","author":"I M\u00e9ndez-D\u00edaz","year":"2006","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P.: A branch-and-cut algorithm for graph coloring. Discrete Appl. Math. 154(5), 826\u2013847 (2006). https:\/\/doi.org\/10.1016\/j.dam.2005.05.022","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"6_CR127","doi-asserted-by":"publisher","first-page":"3521","DOI":"10.1007\/s00453-020-00736-0","volume":"82","author":"GB Mertzios","year":"2020","unstructured":"Mertzios, G.B., Nichterlein, A., Niedermeier, R.: The power of linear-time data reduction for maximum matching. Algorithmica 82(12), 3521\u20133565 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00736-0","journal-title":"Algorithmica"},{"key":"6_CR128","unstructured":"M\u00f6hring, R., M\u00fcller-Hannemann, M.: Cardinality matching: heuristic search for augmenting paths. Technical Report 439, Technische Universit\u00e4t Berlin, Fachbereich 3 (1995)"},{"key":"6_CR129","unstructured":"Moser, H.: Finding optimal solutions for covering and matching problems. Ph.D. thesis, Friedrich-Schiller-Universit\u00e4t Jena (2010). http:\/\/d-nb.info\/999819399"},{"issue":"1","key":"6_CR130","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math. 5(1), 54\u201366 (1992). https:\/\/doi.org\/10.1137\/0405004","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"6_CR131","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01582226","volume":"67","author":"H Nagamochi","year":"1994","unstructured":"Nagamochi, H., Ono, T., Ibaraki, T.: Implementing an efficient minimum capacity cut algorithm. Math. Prog. 67(1), 325\u2013341 (1994). https:\/\/doi.org\/10.1007\/BF01582226","journal-title":"Math. Prog."},{"issue":"4","key":"6_CR132","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/S0097539798336073","volume":"30","author":"A Natanzon","year":"2000","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: A polynomial approximation algorithm for the minimum fill-in problem. SIAM J. Comput. 30(4), 1067\u20131079 (2000). https:\/\/doi.org\/10.1137\/S0097539798336073","journal-title":"SIAM J. Comput."},{"key":"6_CR133","doi-asserted-by":"publisher","unstructured":"Nemhauser, G., Trotter, L.E., J.: Vertex packings: structural properties and algorithms. Math. Prog. 8(1), 232\u2013248 (1975). https:\/\/doi.org\/10.1007\/BF01580444","DOI":"10.1007\/BF01580444"},{"issue":"1","key":"6_CR134","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-hitting set. J. Discrete Algor. 1(1), 89\u2013102 (2003). https:\/\/doi.org\/10.1016\/S1570-8667(03)00009-1","journal-title":"J. Discrete Algor."},{"issue":"1","key":"6_CR135","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10878-014-9756-7","volume":"31","author":"L Bastos","year":"2014","unstructured":"Bastos, L., Ochi, L.S., Protti, F., Subramanian, A., Martins, I.C., Pinheiro, R.G.S.: Efficient algorithms for cluster editing. J. Comb. Optim. 31(1), 347\u2013371 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9756-7","journal-title":"J. Comb. Optim."},{"key":"6_CR136","doi-asserted-by":"publisher","unstructured":"Olesen, K.G., Madsen, A.L.: Maximal prime subgraph decomposition of Bayesian networks. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 32(1), 21\u201331 (2002). https:\/\/doi.org\/10.1109\/3477.979956","DOI":"10.1109\/3477.979956"},{"key":"6_CR137","doi-asserted-by":"publisher","unstructured":"1 Ost, W., Schulz, C., Strash, D.: Engineering data reduction for nested dissection. In: Proceedings of ALENEX 2021, pp. 113\u2013127 (2021). https:\/\/doi.org\/10.1137\/1.9781611976472.9","DOI":"10.1137\/1.9781611976472.9"},{"issue":"1","key":"6_CR138","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M Padberg","year":"1990","unstructured":"Padberg, M., Rinaldi, G.: An efficient algorithm for the minimum capacity cut problem. Math. Prog. 47(1), 19\u201336 (1990). https:\/\/doi.org\/10.1007\/BF01580850","journal-title":"Math. Prog."},{"key":"6_CR139","unstructured":"Panagiotas, I., U\u00e7ar, B.: Engineering fast almost optimal algorithms for bipartite graph matching: Extended version. Research Report RR-9321, Inria Research Centre Grenoble, Rh\u00f4ne-Alpes (2020). https:\/\/hal.inria.fr\/hal-02463717"},{"key":"6_CR140","doi-asserted-by":"publisher","unstructured":"Pelofske, E., Hahn, G., Djidjev, H.: Solving large minimum vertex cover problems on a quantum annealer. In: Proceedings of CF 2019, pp. 76\u201384 (2019). https:\/\/doi.org\/10.1145\/3310273.3321562","DOI":"10.1145\/3310273.3321562"},{"key":"6_CR141","unstructured":"Polzin, T.: Algorithms for the Steiner problem in networks. Ph.D. thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany (2003). http:\/\/scidok.sulb.uni-saarland.de\/volltexte\/2004\/218\/index.html"},{"key":"6_CR142","unstructured":"Pothen, A.: The complexity of optimal elimination trees. Technical report, Pennsylvania State University, Department of Computer Science (1988). https:\/\/www.cs.purdue.edu\/homes\/apothen\/Papers\/shortest-etree1988.pdf"},{"key":"6_CR143","doi-asserted-by":"publisher","unstructured":"Rehfeldt, D., Koch, T.: SCIP-Jack - a solver for STP and variants with parallelization extensions: an update. In: Proceedings of OR 2017, pp. 191\u2013196 (2017). https:\/\/doi.org\/10.1007\/978-3-319-89920-6_27","DOI":"10.1007\/978-3-319-89920-6_27"},{"issue":"2","key":"6_CR144","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1002\/net.21857","volume":"73","author":"D Rehfeldt","year":"2019","unstructured":"Rehfeldt, D., Koch, T., Maher, S.J.: Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. Networks 73(2), 206\u2013233 (2019). https:\/\/doi.org\/10.1002\/net.21857","journal-title":"Networks"},{"key":"6_CR145","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/978-3-662-43948-7_77","volume-title":"Automata, Languages, and Programming","author":"F Reidl","year":"2014","unstructured":"Reidl, F., Rossmanith, P., Villaamil, F.S., Sikdar, S.: A faster parameterized algorithm for treedepth. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 931\u2013942. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_77"},{"key":"6_CR146","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.: Graph minors. II. Algorithmic aspects of tree-width. J. Algor. 7(3), 309\u2013322 (1986). https:\/\/doi.org\/10.1016\/0196-6774(86)90023-4","DOI":"10.1016\/0196-6774(86)90023-4"},{"issue":"3","key":"6_CR147","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"DJ Rose","year":"1970","unstructured":"Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32(3), 597\u2013609 (1970). https:\/\/doi.org\/10.1016\/0022-247X(70)90282-9","journal-title":"J. Math. Anal. Appl."},{"key":"6_CR148","unstructured":"Sanders, P., Schulz, C.: KaHIP v3.00 - Karlsruhe High Quality Partitioning - User Guide. Technical report (2013). https:\/\/arxiv.org\/abs\/1311.1714"},{"issue":"2","key":"6_CR149","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"AA Sch\u00e4ffer","year":"1989","unstructured":"Sch\u00e4ffer, A.A.: Optimal node ranking of trees in linear time. Inf. Proc. Lett. 33(2), 91\u201396 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90161-0","journal-title":"Inf. Proc. Lett."},{"key":"6_CR150","unstructured":"Schulz, C.: Scalable Graph Algorithms. Habilitation (2019). http:\/\/arxiv.org\/abs\/1912.00245"},{"issue":"1","key":"6_CR151","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978). https:\/\/doi.org\/10.1080\/0022250X.1978.9989883","journal-title":"J. Math. Sociol."},{"key":"6_CR152","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-030-19212-9_35","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"Y Shinano","year":"2019","unstructured":"Shinano, Y., Rehfeldt, D., Koch, T.: Building optimal steiner trees on supercomputers by using up to 43,000 cores. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 529\u2013539. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_35"},{"key":"6_CR153","unstructured":"Stallmann, M.F., Ho, Y., Goodrich, T.D.: Graph profiling for vertex cover: targeted reductions in a branch and reduce solver. Technical report (2020). https:\/\/arxiv.org\/abs\/2003.06639"},{"issue":"4","key":"6_CR154","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585\u2013591 (1997). https:\/\/doi.org\/10.1145\/263867.263872","journal-title":"J. ACM"},{"key":"6_CR155","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-42634-1_28","volume-title":"Computing and Combinatorics","author":"D Strash","year":"2016","unstructured":"Strash, D.: On the power of simple reductions for the maximum independent set problem. In: Dinh, T.N., Thai, M.T. (eds.) Proceedings of COCOON 2016. LNCS, vol. 9797, pp. 345\u2013356. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42634-1_28"},{"key":"6_CR156","doi-asserted-by":"publisher","unstructured":"Tamaki, H.: Positive-instance driven dynamic programming for treewidth. In: Proceedings of ESA 2017, Leibniz International Proceedings of Informatics, vol. 87, pp. 68:1\u201368:13 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.68","DOI":"10.4230\/LIPIcs.ESA.2017.68"},{"issue":"3","key":"6_CR157","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984). https:\/\/doi.org\/10.1137\/0213035","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR158","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1137\/0214020","volume":"14","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E., Yannakakis, M.: Addendum: simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 14(1), 254\u2013255 (1985). https:\/\/doi.org\/10.1137\/0214020","journal-title":"SIAM J. Comput."},{"issue":"11","key":"6_CR159","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1109\/PROC.1967.6011","volume":"55","author":"WF Tinney","year":"1967","unstructured":"Tinney, W.F., Walker, J.W.: Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55(11), 1801\u20131809 (1967). https:\/\/doi.org\/10.1109\/PROC.1967.6011","journal-title":"Proc. IEEE"},{"issue":"1","key":"6_CR160","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37(1), 95\u2013111 (2007). https:\/\/doi.org\/10.1007\/s10898-006-9039-7","journal-title":"J. Glob. Optim."},{"key":"6_CR161","doi-asserted-by":"publisher","unstructured":"Trimble, J.: An algorithm for the exact treedepth problem. In: Proceedings of SEA 2020, Leibniz International Proceedings of Informatics, vol. 160, pp. 19:1\u201319:14 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2020.19","DOI":"10.4230\/LIPIcs.SEA.2020.19"},{"issue":"1","key":"6_CR162","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00453-013-9774-3","volume":"70","author":"R Bevern","year":"2013","unstructured":"Bevern, R.: Towards optimal and expressive kernelization for d-hitting set. Algorithmica 70(1), 129\u2013147 (2013). https:\/\/doi.org\/10.1007\/s00453-013-9774-3","journal-title":"Algorithmica"},{"key":"6_CR163","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2020.105998","volume":"163","author":"R van Bevern","year":"2020","unstructured":"van Bevern, R., Smirnov, P.V.: Optimal-size problem kernels for $$d$$-hitting set in linear time and space. Inf. Process. Lett. 163, 105998 (2020). https:\/\/doi.org\/10.1016\/j.ipl.2020.105998","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"6_CR164","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.2014.0618","volume":"27","author":"A Verma","year":"2015","unstructured":"Verma, A., Buchanan, A., Butenko, S.: Solving the maximum clique and vertex coloring problems on very large sparse networks. INFORMS J. Comput. 27(1), 164\u2013177 (2015). https:\/\/doi.org\/10.1287\/ijoc.2014.0618","journal-title":"INFORMS J. Comput."},{"key":"6_CR165","unstructured":"Wang, L., Li, C.M., Zhou, J., Jin, B., Yin, M.: An exact algorithm for minimum weight vertex cover problem in large graphs. Technical report (2019). https:\/\/urldefense.com\/v3\/__https:\/\/www.mdpi.com\/2227-7390\/7\/7\/603__;!!NLFGqXoFfo8MMQ!ryv0VjrmlwLawl0j6PQDtgV3XzU7mM4U8uFD6oX3d4bPcT9yMMYD958fi7tNg1IaVc81OzW7E7AEb5NnCFGAplRjt2vxhvOs"},{"key":"6_CR166","unstructured":"Weihe, K.: Covering trains by stations or the power of data reduction. In: Proceedings of ALEX 1998, pp. 1\u20138 (1998)"},{"issue":"4","key":"6_CR167","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s00224-009-9215-5","volume":"46","author":"M Xiao","year":"2010","unstructured":"Xiao, M.: Simple and improved parameterized algorithms for multiterminal cuts. Theory Comput. Syst. 46(4), 723\u2013736 (2010). https:\/\/doi.org\/10.1007\/s00224-009-9215-5","journal-title":"Theory Comput. Syst."},{"key":"6_CR168","doi-asserted-by":"crossref","unstructured":"Xiao, M., Lin, W., Dai, Y., Zeng, Y.: A fast algorithm to compute maximum k-plexes in social network analysis. In: Proceedings of AAAI 2017, pp. 919\u2013925 (2017)","DOI":"10.1609\/aaai.v31i1.10655"},{"key":"6_CR169","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2012.09.022","volume":"469","author":"M Xiao","year":"2013","unstructured":"Xiao, M., Nagamochi, H.: Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs. Theor. Comput. Sci. 469, 92\u2013104 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.09.022","journal-title":"Theor. Comput. Sci."},{"key":"6_CR170","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ic.2017.06.001","volume":"255","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Nagamochi, H.: Exact algorithms for maximum independent set. Inf. Comput. 255, 126\u2013146 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.06.001","journal-title":"Inf. Comput."},{"issue":"1","key":"6_CR171","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algeb. Discrete Meth. 2(1), 77\u201379 (1981). https:\/\/doi.org\/10.1137\/0602010","journal-title":"SIAM J. Algeb. Discrete Meth."},{"key":"6_CR172","doi-asserted-by":"publisher","unstructured":"Zheng, W., Gu, J., Peng, P., Yu, J.X.: Efficient weighted independent set computation over large graphs. In: Proceedings of ICDE 2020, pp. 1970\u20131973 (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00216","DOI":"10.1109\/ICDE48307.2020.00216"},{"issue":"1","key":"6_CR173","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103\u2013128 (2007). https:\/\/doi.org\/10.4086\/toc.2007.v003a006","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21534-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T20:04:02Z","timestamp":1673985842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21534-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031215339","9783031215346"],"references-count":173,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21534-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}