{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:58Z","timestamp":1725740518857},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_18","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"207-218","source":"Crossref","is-referenced-by-count":0,"title":["On Explaining Integer Vectors by Few Homogenous Segments"],"prefix":"10.1007","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[]},{"given":"Jiehua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Sepp","family":"Hartung","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, D., Barman, D., Gunopulos, D., Young, N., Korn, F., Srivastava, D.: Efficient and effective explanation of change in hierarchical summaries. In: Proc. 13th KDD, pp. 6\u201315. ACM (2007)","DOI":"10.1145\/1281192.1281197"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s11139-007-9022-z","volume":"18","author":"W. Azevedo Pribitkin de","year":"2009","unstructured":"de Azevedo Pribitkin, W.: Simple upper bounds for partition functions. The Ramanujan Journal\u00a018, 113\u2013119 (2009)","journal-title":"The Ramanujan Journal"},{"issue":"1-3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2005.04.008","volume":"152","author":"D. Baatar","year":"2005","unstructured":"Baatar, D., Hamacher, H.W., Ehrgott, M., Woeginger, G.J.: Decomposition of integer matrices and multileaf collimator sequencing. Discrete Appl. Math.\u00a0152(1-3), 6\u201334 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00453-009-9354-8","volume":"60","author":"N. Bansal","year":"2011","unstructured":"Bansal, N., Chen, D.Z., Coppersmith, D., Hu, X.S., Luan, S., Misiolek, E., Schieber, B., Wang, C.: Shape rectangularization problems in intensity-modulated radiation therapy. Algorithmica\u00a060(2), 421\u2013450 (2011)","journal-title":"Algorithmica"},{"issue":"7","key":"18_CR5","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.ipl.2010.12.011","volume":"111","author":"T.C. Biedl","year":"2011","unstructured":"Biedl, T.C., Durocher, S., Hoos, H.H., Luan, S., Saia, J., Young, M.: A note on improving the performance of approximation algorithms for radiation therapy. Inf. Process. Lett.\u00a0111(7), 326\u2013333 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.dam.2012.09.011","volume":"161","author":"T.C. Biedl","year":"2013","unstructured":"Biedl, T.C., Durocher, S., Engelbeen, C., Fiorini, S., Young, M.: Faster optimal algorithms for segment minimization with small maximal value. Discrete Appl. Math.\u00a0161(3), 317\u2013329 (2013)","journal-title":"Discrete Appl. Math."},{"key":"18_CR7","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: A new technique for kernelization lower bounds. In: Proc. 28th STACS. LIPIcs, vol.\u00a09, pp. 165\u2013176. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2011)"},{"issue":"1-2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2011.09.008","volume":"160","author":"H. Cambazard","year":"2012","unstructured":"Cambazard, H., O\u2019Mahony, E., O\u2019Sullivan, B.: A shortest path-based approach to the multileaf collimator sequencing problem. Discrete Appl. Math.\u00a0160(1-2), 81\u201399 (2012)","journal-title":"Discrete Appl. Math."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Drucker, A.: New limits to classical and quantum instance compression. In: Proc. 53rd IEEE FOCS, pp. 609\u2013618. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.71"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10479-009-0659-4","volume":"175","author":"M. Ehrgott","year":"2010","unstructured":"Ehrgott, M., G\u00fcler, C., Hamacher, H., Shao, L.: Mathematical optimization in intensity modulated radiation therapy. Ann. Oper. Res.\u00a0175, 309\u2013365 (2010)","journal-title":"Ann. Oper. Res."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-56686-4_38","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"M.R. Fellows","year":"1993","unstructured":"Fellows, M.R., Koblitz, N.: Fixed-parameter complexity and cryptography. In: Moreno, O., Cohen, G., Mora, T. (eds.) AAECC 1993. LNCS, vol.\u00a0673, pp. 121\u2013131. Springer, Heidelberg (1993)"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s00224-011-9367-y","volume":"50","author":"M.R. Fellows","year":"2012","unstructured":"Fellows, M.R., Gaspers, S., Rosamond, F.A.: Parameterizing by the number of numbers. Theory Comput. Syst.\u00a050(4), 675\u2013693 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"M.R. Fellows","year":"2013","unstructured":"Fellows, M.R., Jansen, B.M.P., Rosamond, F.A.: Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. European J. Combin.\u00a034(3), 541\u2013566 (2013)","journal-title":"European J. Combin."},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica\u00a07(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"18_CR15","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J. Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: Distance from triviality. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 162\u2013173. Springer, Heidelberg (2004)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res.\u00a012, 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"18_CR18","unstructured":"Karloff, H., Korn, F., Makarychev, K., Rabani, Y.: On parsimonious explanations for 2-d tree- and linearly-ordered data. In: Proc.\u00a028th STACS. LIPIcs, vol.\u00a09, pp. 332\u2013343. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2011)"},{"issue":"6","key":"18_CR19","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ipl.2006.10.003","volume":"101","author":"S. Luan","year":"2007","unstructured":"Luan, S., Saia, J., Young, M.: Approximation algorithms for minimizing segments in radiation therapy. Inf. Process. Lett.\u00a0101(6), 239\u2013244 (2007)","journal-title":"Inf. Process. Lett."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"18_CR21","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS. LIPIcs, vol.\u00a05, pp. 17\u201332. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:40:50Z","timestamp":1557945650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}