{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:18Z","timestamp":1759637658393,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_13","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"166-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Polynomial Time Algorithms for Tracking Path Problems"],"prefix":"10.1007","author":[{"given":"Pratibha","family":"Choudhary","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BFb0015417","volume-title":"Algorithms and Computations","author":"V Bafna","year":"1995","unstructured":"Bafna, V., Berman, P., Fujito, T.: Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 142\u2013151. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0015417"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-57586-5_7","volume-title":"Algorithms and Complexity","author":"A Banik","year":"2017","unstructured":"Banik, A., Katz, M.J., Packer, E., Simakov, M.: Tracking paths. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 67\u201379. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_7"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-74180-2_8","volume-title":"Algorithms and Discrete Applied Mathematics","author":"A Banik","year":"2018","unstructured":"Banik, A., Choudhary, P.: Fixed-parameter tractable algorithms for tracking set problems. In: Panda, B.S., Goswami, P.P. (eds.) CALDAM 2018. LNCS, vol. 10743, pp. 93\u2013104. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74180-2_8"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00453-019-00602-8","volume":"82","author":"A Banik","year":"2020","unstructured":"Banik, A., Choudhary, P., Lokshtanov, D., Raman, V., Saurabh, S.: A polynomial sized kernel for tracking paths problem. Algorithmica 82(1), 41\u201363 (2020)","journal-title":"Algorithmica"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-030-24922-9_6","volume-title":"Structural Information and Communication Complexity","author":"D Bil\u00f2","year":"2019","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Tracking routes in communication networks. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 81\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24922-9_6"},{"key":"13_CR6","unstructured":"Choudhary, P.: Polynomial time algorithms for tracking path problems. CoRR abs\/2002.07799 (2020). https:\/\/arxiv.org\/abs\/2002.07799"},{"key":"13_CR7","unstructured":"Choudhary, P., Raman, V.: Improved kernels for tracking path problems. CoRR abs\/2001.03161 (2020). http:\/\/arxiv.org\/abs\/2001.03161"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.aim.2014.11.011","volume":"270","author":"M Chudnovsky","year":"2015","unstructured":"Chudnovsky, M., Scott, A., Seymour, P.: Disjoint paths in tournaments. Adv. Math. 270, 582\u2013597 (2015)","journal-title":"Adv. Math."},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Duraisamy, K., Dempsey, K., Ali, H., Bhowmick, S.: A noise reducing sampling approach for uncovering critical properties in large scale biological networks. In: 2011 International Conference on High Performance Computing Simulation, pp. 721\u2013728, July 2011. https:\/\/doi.org\/10.1109\/HPCSim.2011.5999898","DOI":"10.1109\/HPCSim.2011.5999898"},{"key":"13_CR10","unstructured":"Eppstein, D., Goodrich, M.T., Liu, J.A., Matias, P.: Tracking paths in planar graphs. In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, 8\u201311 December 2019, Shanghai University of Finance and Economics, Shanghai, China, pp. 54:1\u201354:17 (2019)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0024-3795(94)00066-M","volume":"217","author":"DC Fisher","year":"1995","unstructured":"Fisher, D.C., Ryan, J.: Tournament games and condorcet voting. Linear Algebra Appl. 217, 87\u2013100 (1995). Proceedings of a Conference on Graphs and Matrices in Honor of John Maybee","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Stockmeyer, L.: Some simplified np-complete graph problems. Theoret. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR13","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0103042","volume-title":"\u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XVIII - 1988","author":"D Geman","year":"1990","unstructured":"Geman, D.: Random fields and inverse problems in imaging. In: Hennequin, P.-L. (ed.) \u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XVIII - 1988. LNM, vol. 1427, pp. 115\u2013193. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0103042"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Perfect graphs (chapter 3). In: Golumbic, M.C. (ed.) Algorithmic Graph Theory and Perfect Graphs, pp. 51\u201380. Academic Press (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"K Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time. J. Comb. Theory Ser. B 102(2), 424\u2013435 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"13_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"SL Lauritzen","year":"1988","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. Roy. Stat. Soc.: Ser. B (Methodol.) 50(2), 157\u2013224 (1988)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"issue":"4","key":"13_CR17","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"DC McGarvey","year":"1953","unstructured":"McGarvey, D.C.: A theorem on the construction of voting paradoxes. Econometrica 21(4), 608\u2013610 (1953)","journal-title":"Econometrica"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/5.18626","volume":"77","author":"LR Rabiner","year":"1989","unstructured":"Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77(2), 257\u2013286 (1989). https:\/\/doi.org\/10.1109\/5.18626","journal-title":"Proc. IEEE"},{"issue":"9","key":"13_CR19","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/00029890.1959.11989405","volume":"66","author":"R Stearns","year":"1959","unstructured":"Stearns, R.: The voting problem. Am. Math. Mon. 66(9), 761\u2013763 (1959)","journal-title":"Am. Math. Mon."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T15:43:21Z","timestamp":1722959001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}