{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T20:31:17Z","timestamp":1692736277382},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,21]],"date-time":"2011-04-21T00:00:00Z","timestamp":1303344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00186-011-0356-3","type":"journal-article","created":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T23:48:34Z","timestamp":1303256914000},"page":"381-400","source":"Crossref","is-referenced-by-count":2,"title":["Graph problems arising from parameter identification of discrete dynamical systems"],"prefix":"10.1007","volume":"73","author":[{"given":"Steffen","family":"Borchers","sequence":"first","affiliation":[]},{"given":"Sandro","family":"Bosio","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Findeisen","sequence":"additional","affiliation":[]},{"given":"Utz-Uwe","family":"Haus","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Rumschinski","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,21]]},"reference":[{"key":"356_CR1","volume-title":"Optimum experimental designs. Oxford statistical science series","author":"AC Atkinson","year":"1992","unstructured":"Atkinson AC, Donev AN (1992) Optimum experimental designs. Oxford statistical science series. Oxford University Press, Oxford"},{"issue":"1\u20132","key":"356_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-0427(00)00300-9","volume":"120","author":"I Bauer","year":"2000","unstructured":"Bauer I, Bock HG, K\u00f6rkel S, Schl\u00f6der JP (2000) Numerical methods for optimum experimental design in DAE systems. J Comput Appl Math 120(1\u20132): 1\u201325","journal-title":"J Comput Appl Math"},{"key":"356_CR3","doi-asserted-by":"crossref","unstructured":"Borchers S, Rumschinski P, Bosio S, Weismantel R, Findeisen R (2009) Model discrimination and parameter estimation for dynamical biochemical reaction networks. In: 15th IFAC symposium on system identification","DOI":"10.3182\/20090706-3-FR-2004.00041"},{"key":"356_CR4","unstructured":"Chazelle B (1980) Computational geometry and convexity. Ph.D. thesis, Yale University"},{"issue":"3","key":"356_CR5","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0213031","volume":"13","author":"B Chazelle","year":"1984","unstructured":"Chazelle B (1984) Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J Comput 13(3): 488\u2013507","journal-title":"SIAM J Comput"},{"issue":"3","key":"356_CR6","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B Chazelle","year":"1986","unstructured":"Chazelle B (1986) Filtering search: a new approach to query-answering. SIAM J Comput 15(3): 703\u2013724","journal-title":"SIAM J Comput"},{"issue":"3","key":"356_CR7","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B Chazelle","year":"1988","unstructured":"Chazelle B (1988) A functional approach to data structures and its use in multidimensional searching. SIAM J Comput 17(3): 427\u2013462","journal-title":"SIAM J Comput"},{"key":"356_CR8","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02573985","volume":"10","author":"B Chazelle","year":"1993","unstructured":"Chazelle B (1993) An optimal convex hull algorithm in any fixed dimension. Discret Comput Geom 10: 377\u2013409","journal-title":"Discret Comput Geom"},{"key":"356_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/B978-0-444-87806-9.50009-8","volume-title":"Computational Geometry","author":"B Chazelle","year":"1985","unstructured":"Chazelle B, Dobkin DP. (1985) Optimal convex decompositions. In: Toussaint GT (eds) Computational Geometry. North-Holland, Amsterdam, pp 63\u2013133"},{"issue":"2","key":"356_CR10","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(89)90043-3","volume":"39","author":"JC Culberson","year":"1989","unstructured":"Culberson JC, Reckhow RA (1989) Orthogonally convex coverings of orthogonal polygons without holes. J Comput Syst Sci 39(2): 166\u2013204","journal-title":"J Comput Syst Sci"},{"key":"356_CR11","doi-asserted-by":"crossref","unstructured":"Edelsbrunner H (1983) A new approach to rectangle intersections. I, II Int J Comput Math 13(3\u20134):209\u2013219, 221\u2013229","DOI":"10.1080\/00207168308803365"},{"issue":"1","key":"356_CR12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/comjnl\/29.1.76","volume":"29","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner H, Haring G, Hilbert D (1986) Rectangular point location in d dimensions with applications. Comput J 29(1): 76\u201382","journal-title":"Comput J"},{"issue":"2","key":"356_CR13","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner H, O\u2019Rourke J, Seidel R (1986) Constructing arrangements of lines and hyperplanes with applications. SIAM J Comput 15(2): 341\u2013363","journal-title":"SIAM J Comput"},{"key":"356_CR14","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/j.automatica.2004.06.002","volume":"40","author":"ND Evans","year":"2004","unstructured":"Evans ND, Chappell MJ, Chapman MJ, Godfrey KR (2004) Structural indistinguishability between uncontrolled (autonomous) nonlinear analytic systems. Automatica 40: 1947\u20131953","journal-title":"Automatica"},{"issue":"1","key":"356_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J (1999) Clique is hard to approximate within n 1-\u03b5 . Acta Math 182(1): 105\u2013142","journal-title":"Acta Math"},{"key":"356_CR16","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/1471-2105-8-12","volume":"8","author":"L Kuepfer","year":"2007","unstructured":"Kuepfer L, Sauer U, Parrilo PA (2007) Efficient classification of complete parameter regions based on semidefinite programming. BMC Bioinf 8: 12","journal-title":"BMC Bioinf"},{"key":"356_CR17","doi-asserted-by":"crossref","unstructured":"Lingas A (1982) The power of non-rectilinear holes. In: 9th colloquium on automata, languages and programming, Lecture notes in computer science, vol 140. pp 369\u2013383","DOI":"10.1007\/BFb0012784"},{"key":"356_CR18","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"DW Marquardt","year":"1963","unstructured":"Marquardt DW (1963) An algorithm for least-squares of nonlinear parameters. SIAM J Appl Math 11: 431\u2013441","journal-title":"SIAM J Appl Math"},{"key":"356_CR19","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen P (1970) The maximum numbers of faces of a convex polytope. Mathematika 17: 179\u2013184","journal-title":"Mathematika"},{"issue":"2","key":"356_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"29","author":"J O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke J, Supowit KJ (1983) Some NP-hard polygon decomposition problems. IEEE Trans Inf Theory 29(2): 181\u2013190","journal-title":"IEEE Trans Inf Theory"},{"key":"356_CR21","volume-title":"Foundations of optimum experimental design","author":"A P\u00e1zman","year":"1986","unstructured":"P\u00e1zman A (1986) Foundations of optimum experimental design. Reidel, Dordrecht"},{"key":"356_CR22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.automatica.2005.08.007","volume":"42","author":"S Prajna","year":"2006","unstructured":"Prajna S (2006) Barrier certificates for nonlinear model validation. Automatica 42: 117\u2013126","journal-title":"Automatica"},{"key":"356_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry","author":"F Preparata","year":"1985","unstructured":"Preparata F, Shamos MI (1985) Computational geometry. Spinger, New York"},{"issue":"5","key":"356_CR24","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1111\/j.1467-9868.2007.00610.x","volume":"69","author":"JO Ramsay","year":"2007","unstructured":"Ramsay JO, Hooker G, Campbell D, Cao J (2007) Parameter estimation for differential equations: a generalized smoothing approach. J R Stat Soc Ser B 69(5): 741\u2013796","journal-title":"J R Stat Soc Ser B"},{"key":"356_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4145-2","volume-title":"Monte Carlo statistical methods","author":"CP Robert","year":"2004","unstructured":"Robert CP, Casella G (2004) Monte Carlo statistical methods. Springer, Berlin"},{"issue":"26","key":"356_CR26","doi-asserted-by":"crossref","first-page":"9137","DOI":"10.1021\/ie0703742","volume":"46","author":"K Schittkowski","year":"2007","unstructured":"Schittkowski K (2007) Experimental design tools for ordinary and algebraic differential equations. Ind Eng Chem Res 46(26): 9137\u20139147","journal-title":"Ind Eng Chem Res"},{"key":"356_CR27","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.crvi.2005.09.005","volume":"329","author":"S Schnell","year":"2006","unstructured":"Schnell S, Chappell MJ, Evans ND, Roussel MR (2006) The mechanism distinguishability problem in biochemical kinetics: the single-enzyme, single-substrate reaction as a case study. CR Biol 329: 51\u201361","journal-title":"CR Biol"},{"key":"356_CR28","unstructured":"Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency. Algorithms and combinatorics, vol 24. Springer-Verlag, Berlin"},{"issue":"3","key":"356_CR29","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TC.1982.1675973","volume":"31","author":"HW Six","year":"1982","unstructured":"Six HW, Wood D (1982) Counting and reporting intersections of d-ranges. IEEE Trans Comput 31(3): 181\u2013187","journal-title":"IEEE Trans Comput"},{"issue":"7","key":"356_CR30","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/9.148346","volume":"37","author":"RS Smith","year":"1992","unstructured":"Smith RS, Doyle JC (1992) Model validation: a connection between robust control and identification. IEEE Trans Autom Control 37(7): 942\u2013952","journal-title":"IEEE Trans Autom Control"},{"issue":"1","key":"356_CR31","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0167-6377(86)90093-3","volume":"5","author":"JA Tomlin","year":"1986","unstructured":"Tomlin JA, Welch JS (1986) Finding duplicate rows in a linear programming model. Oper Res Lett 5(1): 7\u201311","journal-title":"Oper Res Lett"},{"key":"356_CR32","unstructured":"Valiant LG, Vazirani VV (1985) NP is as easy as detecting unique solutions. In: 17th ACM symposium on theory of computing. pp 458\u2013463"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-011-0356-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-011-0356-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-011-0356-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T04:53:04Z","timestamp":1560142384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-011-0356-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,21]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1007\/s00186-011-0356-3","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,21]]}}}