{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:54:55Z","timestamp":1725573295805},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_34","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T06:34:15Z","timestamp":1149230055000},"page":"356-367","source":"Crossref","is-referenced-by-count":2,"title":["The Linear Arrangement Problem Parameterized Above Guaranteed Value"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Rafiey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Cesati, M.: Compendium of parameterized problems (September 2005), \n                    \n                      http:\/\/bravo.ce.uniroma2.it\/home\/cesati\/research\/compendium.pdf"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","volume":"10","author":"F.R.K. Chung","year":"1984","unstructured":"Chung, F.R.K.: On optimal linear arrangements of trees. Comp. & Maths. with Appls.\u00a010, 43\u201360 (1984)","journal-title":"Comp. & Maths. with Appls."},{"key":"34_CR3","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Springer, New York (2000)","edition":"2"},{"key":"34_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"34_CR5","unstructured":"Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-Time extremal structure I. In: Broersma, H., Johnson, M., Szeider, S. (eds.) Algorithms and Complexity in Durham 2005, Proceedings of the first ACiD Workshop. Texts in Algorithmics, vol.\u00a04, pp. 1\u201341. King\u2019s College Publications (2005)"},{"key":"34_CR6","unstructured":"Fernau, H.: Parameterized Algorithmics: A Graph-theoretic Approach. Habilitation thesis, U. T\u00fcbingen (2005)"},{"key":"34_CR7","unstructured":"Fernau, H.: Parameterized Algorithmics for Linear Arrangement Problems. Talk at Dagstuhl (July 2005), slides at: \n                    \n                      http:\/\/www.dagstuhl.de\/files\/Materials\/05\/05301\/05301.FernauHenning.Slides.pdf"},{"key":"34_CR8","unstructured":"Fernau, H.: Parameterized Algorithmics for Linear Arrangement Problems (manscript) (July 2005), \n                    \n                      http:\/\/homepages.feis.herts.ac.uk\/~comrhf\/papers\/ola.pdf"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0890-5401(03)00161-5","volume":"187","author":"J. Flum","year":"2003","unstructured":"Flum, J., Grohe, M.: Describing parameterized complexity classes. Information and Computation\u00a0187, 291\u2013319 (2003)","journal-title":"Information and Computation"},{"key":"34_CR10","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"34_CR11","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.R.: Computers and Intractability. W.H. Freeman & Comp., New York (1979)"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR13","unstructured":"Goldberg, M.K., Klipker, I.A.: Minimal placing pf trees on a line. Tech. Report, Physico-Technical Institute of Low Temperatures, Ukranian SSR Acad. of Sciences, USSR (1976) (in Russian)"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L.H. Harper","year":"1964","unstructured":"Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Indust. Appl. Math.\u00a012, 131\u2013135 (1964)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms\u00a031, 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (forthcoming, 2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1137\/0208002","volume":"8","author":"Y. Shiloach","year":"1979","unstructured":"Shiloach, Y.: A minimum linear arrangement algorithm for undirected trees. SIAM J. Comp.\u00a08, 15\u201332 (1979)","journal-title":"SIAM J. Comp."},{"key":"34_CR18","first-page":"41","volume":"86","author":"M. Serna","year":"2005","unstructured":"Serna, M., Thilikos, D.M.: Parameterized complexity for graph layout problems. EATCS Bulletin\u00a086, 41\u201365 (2005)","journal-title":"EATCS Bulletin"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM J. Comput.\u00a01, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:04:29Z","timestamp":1619492669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11758471_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}