{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:42:39Z","timestamp":1743025359854,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031573194"},{"type":"electronic","value":"9783031573200"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-57320-0_16","type":"book-chapter","created":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T06:40:16Z","timestamp":1711521616000},"page":"289-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Application of\u00a0an\u00a0Inverse Dirichlet\u2019s Principle to\u00a0Discrete Recreational Problems: Bound Estimation\u2019s Optimization Using Combinatorial Probability and\u00a0Comparison of\u00a0Numerical Bound Estimation Using Various Algorithms, Including Recursive Inclusion-Exclusion Principle"],"prefix":"10.1007","author":[{"given":"Lubom\u00edr","family":"\u0160t\u011bp\u00e1nek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Habarta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Mal\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lubo\u0161","family":"Marek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefka","family":"Fidanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-38645-2","volume-title":"Diophantine Approximation","author":"WM Schmidt","year":"1980","unstructured":"Schmidt, W.M.: Diophantine Approximation. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/978-3-540-38645-2"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Loomis, L., Sternberg, S.: Advanced Calculus, pp. 474\u2013508. World Scientific (2014)","DOI":"10.1142\/9095"},{"key":"16_CR3","unstructured":"Mandyam, G.D., Ahmed, N.U., Magotra, N.: DCT-based scheme for lossless image compression. In: SPIE Proceedings. SPIE (1995)"},{"key":"16_CR4","volume-title":"Introduction to Formal Languages and Automata","author":"P Linz","year":"2006","unstructured":"Linz, P.: Introduction to Formal Languages and Automata, 4th edn. Jones and Bartlett, Sudbury (2006)","edition":"4"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1073\/pnas.1522411112","volume":"113","author":"Y Aharonov","year":"2016","unstructured":"Aharonov, Y., et al.: Quantum violation of the pigeonhole principle and the nature of quantum correlations. Proc. Natl. Acad. Sci. 113, 532\u2013535 (2016)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Rittaud, B., Heeffer, A.: The Pigeonhole principle, two centuries before Dirichlet. Math. Intell. 36, 27\u201329 (2013)","DOI":"10.1007\/s00283-013-9389-1"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1080\/0025570x.2005.11953342","volume":"78","author":"P Gorkin","year":"2005","unstructured":"Gorkin, P., Smith, J.H.: Dirichlet: his life, his principle, and his problem. Math. Maga. 78, 283\u2013296 (2005). https:\/\/doi.org\/10.1080\/0025570x.2005.11953342","journal-title":"Math. Maga."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1111\/j.1740-9713.2007.00246.x","volume":"4","author":"MC Borja","year":"2007","unstructured":"Borja, M.C., Haigh, J.: The birthday problem. Significance 4, 124\u2013127 (2007)","journal-title":"Significance"},{"key":"16_CR9","unstructured":"R Core Team. R: A Language and Environment for Statistical Computing R Foundation for Statistical Computing, Vienna, Austria (2019). https:\/\/www.R-project.org\/"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Martinkov\u00e1, P., et al. Semi-real-time analyses of item characteristics for medical school admission tests. In: Proceedings of the 2017 Federated Conference on Computer Science and Information Systems. IEEE (2017). https:\/\/doi.org\/10.15439\/2017f380","DOI":"10.15439\/2017f380"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bp\u00e1nek, L., Kasal, P., M\u011b\u0161t\u00e1k, J.: Machine-learning at the service of plastic surgery: a case study evaluating facial attractiveness and emotions using R language. In: Proceedings of the 2019 Federated Conference on Computer Science and Information Systems. IEEE (2019). https:\/\/doi.org\/10.15439\/2019f264","DOI":"10.15439\/2019f264"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bp\u00e1nek, L., Kasal, P., M\u011b\u0161t\u00e1k, J.: Evaluation of facial attractiveness after undergoing rhinoplasty using tree-based and regression methods. In: 2019 E-Health and Bioengineering Conference (EHB). IEEE (2019). https:\/\/doi.org\/10.1109\/ehb47216.2019.8969932","DOI":"10.1109\/ehb47216.2019.8969932"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bp\u00e1nek, L., Habarta, F., Mal\u00e1, I., Marek, L.: Analysis of asymptotic time complexity of an assumption-free alternative to the log-rank test. In: Proceedings of the 2020 Federated Conference on Computer Science and Information Systems. IEEE (2020). https:\/\/doi.org\/10.15439\/2020f198","DOI":"10.15439\/2020f198"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bp\u00e1nek, L., Habarta, F., Mal\u00e1, I., Marek, L.: Data Envelopment analysis models connected in time series: a case study evaluating COVID-19 pandemic management in some European countries. In: 2021 International Conference on e-Health and Bioengineering (EHB). IEEE (2021). https:\/\/doi.org\/10.1109\/ehb52898.2021.9657597","DOI":"10.1109\/ehb52898.2021.9657597"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bp\u00e1nek, L., Habarta, F., Mal\u00e1, I., Marek, L.: A random forest-based approach for survival curves comparing: principles, computational aspects and asymptotic time complexity analysis. In: Annals of Computer Science and Information Systems. IEEE (2021). https:\/\/doi.org\/10.15439\/2021f89","DOI":"10.15439\/2021f89"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bp\u00e1nek, L., Habarta, F., Mal\u00e1, I., Marek, L.: A short note on posthoc testing using random forests algorithm: principles, asymptotic time complexity analysis, and beyond. In: Annals of Computer Science and Information Systems. IEEE (2022). https:\/\/doi.org\/10.15439\/2022f265","DOI":"10.15439\/2022f265"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bp\u00e1nek, L., Habarta, F., Mal\u00e1, I., Marek, L.: When COVID-19 approaches again: early detection of an incoming new wave of COVID-19 positive cases inspired by linear breakpoint models. In: 2022 EHealth and Bioengineering Conference (EHB). IEEE (2022). https:\/\/doi.org\/10.1109\/ehb55594.2022.9991611","DOI":"10.1109\/ehb55594.2022.9991611"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"\u0160t\u011bp\u00e1nek, L., et al.: Machine learning at the service of survival analysis: predictions using time-to-event decomposition and classification applied to a decrease of blood antibodies against COVID-19. Mathematics 11, 819 (2023). https:\/\/doi.org\/10.3390\/math11040819","DOI":"10.3390\/math11040819"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: Big omicron and big omega and big theta. ACM Sigact News 8, 18\u201324 (1976)","DOI":"10.1145\/1008328.1008329"},{"key":"16_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39, 546\u2013563 (2009). https:\/\/doi.org\/10.1137\/070683933","journal-title":"SIAM J. Comput."}],"container-title":["Studies in Computational Intelligence","Recent Advances in Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57320-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T19:03:31Z","timestamp":1713467011000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57320-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031573194","9783031573200"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57320-0_16","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Workshop on Computational Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sofia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fedcsis.org\/2022\/wco","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}