{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:06Z","timestamp":1759639086475},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319398167"},{"type":"electronic","value":"9783319398174"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39817-4_23","type":"book-chapter","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T13:15:09Z","timestamp":1464268509000},"page":"238-249","source":"Crossref","is-referenced-by-count":0,"title":["Kernelization of Two Path Searching Problems on Split Graphs"],"prefix":"10.1007","author":[{"given":"Yongjie","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yash Raj","family":"Shrestha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"issue":"7","key":"23_CR1","doi-asserted-by":"crossref","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"23_CR2","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00224-007-1328-0","volume":"41","author":"FN Abu-Khzam","year":"2007","unstructured":"Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown structures for vertex cover kernelization. Theor. Comput. Syst. 41(3), 411\u2013430 (2007)","journal-title":"Theor. Comput. Syst."},{"issue":"3","key":"23_CR3","first-page":"239","volume":"23","author":"AB Adcock","year":"2015","unstructured":"Adcock, A.B., Demaine, E.D., Demaine, M.L., O\u2019Brien, M.P., Reidl, F., Villaamil, F.S., Sullivan, B.D.: Zig-zag numberlink is NP-complete. JIP 23(3), 239\u2013245 (2015)","journal-title":"JIP"},{"issue":"8","key":"23_CR4","doi-asserted-by":"crossref","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"35","key":"23_CR5","doi-asserted-by":"crossref","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-540-30559-0_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Chor","year":"2004","unstructured":"Chor, B., Fellows, M., Juedes, D.W.: Linear kernels in linear time, or how to save k colors in $$O(n^2)$$ steps. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 257\u2013269. Springer, Heidelberg (2004)"},{"key":"23_CR7","first-page":"49","volume-title":"Paths, Flows, and VLSI-Layout","author":"A Frank","year":"1990","unstructured":"Frank, A.: Packing paths, circuits and cuts: a survey. In: Korte, B., Lov\u00e1sz, L., Pr\u00f6mel, H.J., Schrijver, A. (eds.) Paths, Flows, and VLSI-Layout, pp. 49\u2013100. Springer, Berlin (1990)"},{"issue":"1","key":"23_CR8","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/s00224-014-9580-6","volume":"57","author":"P Heggernes","year":"2015","unstructured":"Heggernes, P., Hof, P., van Leeuwen, E.J., Saei, R.: Finding disjoint paths in split graphs. Theor. Comput. Syst. 57(1), 140\u2013159 (2015)","journal-title":"Theor. Comput. Syst."},{"issue":"3","key":"23_CR9","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1137\/080741197","volume":"25","author":"P Heggernes","year":"2011","unstructured":"Heggernes, P., Lokshtanov, D., Mihai, R., Papadopoulos, C.: Cutwidth of split graphs and threshold graphs. SIAM J. Discrete Math. 25(3), 1418\u20131437 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/978-3-662-44777-2_48","volume-title":"Algorithms - ESA 2014","author":"BMP Jansen","year":"2014","unstructured":"Jansen, B.M.P.: Turing kernelization for finding long paths and cycles in restricted graph classes. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 579\u2013591. Springer, Heidelberg (2014)"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01840353","volume":"2","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Leighton, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global wire routing in two-dimensional arrays. Algorithmica 2, 113\u2013129 (1987)","journal-title":"Algorithmica"},{"key":"23_CR12","first-page":"129","volume":"2","author":"MR Kramer","year":"1984","unstructured":"Kramer, M.R., van Leeuwen, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. Adv. Comput. Res. 2, 129\u2013146 (1984)","journal-title":"Adv. Comput. Res."},{"issue":"3","key":"23_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1061425.1061430","volume":"5","author":"JF Lynch","year":"1975","unstructured":"Lynch, J.F.: The equivalence of theorem proving and the interconnection problem. SIGDA Newsl. 5(3), 31\u201336 (1975)","journal-title":"SIGDA Newsl."},{"issue":"4","key":"23_CR14","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/S0195-6698(03)00030-1","volume":"24","author":"R Merris","year":"2003","unstructured":"Merris, R.: Split graphs. Eur. J. Comb. 24(4), 413\u2013430 (2003)","journal-title":"Eur. J. Comb."},{"issue":"1\u20133","key":"23_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156(1\u20133), 291\u2013298 (1996)","journal-title":"Discrete Math."},{"issue":"3","key":"23_CR16","first-page":"256","volume":"3","author":"S Natarajan","year":"1996","unstructured":"Natarajan, S., Sprague, A.P.: Disjoint paths in circular arc graphs. Nord. J. Comput. 3(3), 256\u2013270 (1996)","journal-title":"Nord. J. Comput."},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-540-28639-4_13","volume-title":"Parameterized and Exact Computation","author":"E Prieto","year":"2004","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 138\u2013148. Springer, Heidelberg (2004)"},{"issue":"2","key":"23_CR18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00453-007-9148-9","volume":"52","author":"V Raman","year":"2008","unstructured":"Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52(2), 203\u2013225 (2008)","journal-title":"Algorithmica"},{"key":"23_CR19","first-page":"267","volume-title":"Paths, Flows, and VLSI-Layout","author":"N Robertson","year":"1990","unstructured":"Robertson, N., Seymour, P.D.: An outline of a disjoint path algorithm. In: Korte, B., Lov\u00e1sz, L., Pr\u00f6mel, H.J., Schrijver, A. (eds.) Paths, Flows, and VLSI-Layout, pp. 267\u2013292. Springer, Berlin (1990)"},{"issue":"1","key":"23_CR20","doi-asserted-by":"crossref","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. Theor. Ser. B 63(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"5","key":"23_CR21","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.jcss.2012.08.001","volume":"79","author":"J Wang","year":"2013","unstructured":"Wang, J., Yang, Y., Guo, J., Chen, J.: Planar graph vertex partition for linear problem kernels. J. Comput. Syst. Sci. 79(5), 609\u2013621 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"23_CR22","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.ipl.2014.02.003","volume":"114","author":"Y Yang","year":"2014","unstructured":"Yang, Y.: Towards optimal kernel for edge-disjoint triangle packing. Inf. Process. Lett. 114(7), 344\u2013348 (2014)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39817-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:06:01Z","timestamp":1498316761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39817-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319398167","9783319398174"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39817-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}