{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:13:27Z","timestamp":1743138807871,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112683"},{"type":"electronic","value":"9783642112690"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_16","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"198-209","source":"Crossref","is-referenced-by-count":8,"title":["The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension"],"prefix":"10.1007","author":[{"given":"Panos","family":"Giannopoulos","sequence":"first","affiliation":[]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","volume":"147","author":"E. Armaldi","year":"1995","unstructured":"Armaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoretical Computer Science\u00a0147, 181\u2013210 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B. Aronov","year":"2008","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM J. Comput.\u00a038(3), 899\u2013921 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S. Arora","year":"1997","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci.\u00a054(2), 317\u2013331 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11222-008-9054-2","volume":"18","author":"D. Bremner","year":"2008","unstructured":"Bremner, D., Chen, D., Iacono, J., Langerman, S., Morin, P.: Output-sensitive algorithms for tukey depth and related problems. Statistics and Computing\u00a018(3), 259\u2013266 (2008)","journal-title":"Statistics and Computing"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"B\u0103doiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proc. 34th Annual ACM Symposium on Theory of Computing, pp. 250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"key":"16_CR6","unstructured":"Cabello, S., Giannopoulos, P., Knauer, C., Marx, D., Rote, G.: Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. ACM Transactions on Algorithms (to appear, 2009)"},{"key":"16_CR7","unstructured":"Cabello, S., Giannopoulos, P., Knauer, C., Rote, G.: Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. In: Proc. 19th Ann. ACM-SIAM Sympos. Discrete Algorithms, pp. 836\u2013843 (2008)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: A (slightly) faster algorithm for Klee\u2019s measure problem. In: Proc. 24th Annual Symposium on Computational Geometry, pp. 94\u2013100 (2008)","DOI":"10.1145\/1377676.1377693"},{"key":"16_CR9","series-title":"Monographs in Computer Science","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. Monographs in Computer Science. Springer, Heidelberg (1999)"},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1093\/comjnl\/bxm053","volume":"51","author":"P. Giannopoulos","year":"2008","unstructured":"Giannopoulos, P., Knauer, C., Whitesides, S.: Parameterized complexity of geometric problems. Computer Journal\u00a051(3), 372\u2013384 (2008)","journal-title":"Computer Journal"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci.\u00a062(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00454-004-1108-4","volume":"33","author":"S. Langerman","year":"2005","unstructured":"Langerman, S., Morin, P.: Covering things with things. Discrete & Computational Geometry\u00a033(4), 717\u2013729 (2005)","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02187916","volume":"3","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N.: On the complexity of polyhedral separability. Discrete & Computational Geometry\u00a03, 325\u2013337 (1988)","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0747-7171(08)80067-3","volume":"10","author":"N. Megiddo","year":"1990","unstructured":"Megiddo, N.: On the complexity of some geometric problems in unbounded dimension. J. Symb. Comput.\u00a010, 327\u2013334 (1990)","journal-title":"J. Symb. Comput."},{"issue":"6","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/050627472","volume":"36","author":"K. Varadarajan","year":"2007","unstructured":"Varadarajan, K., Venkatesh, S., Ye, Y., Zhang, J.: Approximating the radii of point sets. SIAM J. Comput.\u00a036(6), 1764\u20131776 (2007)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:34:50Z","timestamp":1676680490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}