{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:58Z","timestamp":1759637998857},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_13","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"138-148","source":"Crossref","is-referenced-by-count":9,"title":["Looking at the Stars"],"prefix":"10.1007","author":[{"given":"Elena","family":"Prieto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Sloper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings ALENEX 2004","author":"F. Abu-Khzam","year":"2004","unstructured":"Abu-Khzam, F., Collins, R., Fellows, M., Langston, M.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Proceedings ALENEX 2004. LNCS, Springer, Heidelberg (2004) (to appear)"},{"key":"13_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"key":"13_CR3","unstructured":"Bar-Yehuda, R., Halldrsson, M., Naor, J., Shachnai, H., Shapira, I.: Scheduling Split Intervals. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 732\u2013741 (2002)"},{"key":"13_CR4","unstructured":"Bejar, R., Krishnamachari, B., Gomes, C., Selman, B.: Distributed constraint satisfaction in a wireless sensor tracking system. In: Workshop on Distributed Constraint Reasoning, International Joint Conference on Artificial Intelligence (2001)"},{"key":"13_CR5","unstructured":"Chor, B., Fellows, M., Juedes, D.: An Efficient FPT Algorithm for Saving k colors (2003) (manuscript)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M., Stege, U.: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability. AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a049, pp. 49\u201399 (1999)","DOI":"10.1090\/dimacs\/049\/04"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Fellows, M.: Blow-Ups, Win\/Win\u2019s, and Crown Rules: Some new Directions in FPT. In: Proceedings 29th Workshop on Graph Theoretic Concepts in Computer Science (2003)","DOI":"10.1007\/978-3-540-39890-5_1"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-30559-0_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Fellows","year":"2004","unstructured":"Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A.: Exact algorithms for finding k disjoint triangles in an arbitrary graph. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 235\u2013244. Springer, Heidelberg (2004)"},{"key":"13_CR9","unstructured":"Fellows, M.R., McCartin, C., Rosamond, F., Stege, U.: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. Foundations of Software Technology and Theoretical Computer Science (2000)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An n 5=2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Hell, P., Kirkpatrick, D.: On the complexity of a generalized matching problem. In: Proceedings of 10th ACM Symposium on theory of computing, pp. 309\u2013318 (1978)","DOI":"10.1145\/800133.804353"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/0607024","volume":"7","author":"P. Hell","year":"1986","unstructured":"Hell, P., Kirkpatrick, D.: Packings by complete bipartite graphs. SIAM Journal of Algebraic Discrete Methods\u00a07, 199\u2013209 (1986)","journal-title":"SIAM Journal of Algebraic Discrete Methods"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C. Hurkens","year":"1989","unstructured":"Hurkens, C., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with application to worst case ratio of Heuristics for packing problems. SIAMJournal of Discrete Mathematics\u00a02, 68\u201372 (1989)","journal-title":"SIAMJournal of Discrete Mathematics"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(94)90105-8","volume":"49","author":"V. Kann","year":"1994","unstructured":"Kann, V.: Maximum bounded H-matching is MAX-SNP-complete. Information Processing Letters\u00a049, 309\u2013318 (1994)","journal-title":"Information Processing Letters"},{"key":"13_CR15","unstructured":"Prieto, E., Sloper, C.: Creating Crown Structure \u2014 The case of Max Internal Spanning Tree (submitted)"},{"key":"13_CR16","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors XX. Wagner\u2019s conjecture (to appear)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:26:45Z","timestamp":1605760005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}