{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:24:51Z","timestamp":1743150291807,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031231001"},{"type":"electronic","value":"9783031231018"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-23101-8_12","type":"book-chapter","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:18:53Z","timestamp":1671481133000},"page":"177-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Balanced Substructures in\u00a0Bicolored Graphs"],"prefix":"10.1007","author":[{"given":"P. S.","family":"Ardra","sequence":"first","affiliation":[]},{"given":"R.","family":"Krithika","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Roohani","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995). https:\/\/doi.org\/10.1145\/210332.210337. https:\/\/doi.org\/10.1145\/210332.210337","DOI":"10.1145\/210332.210337"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-11509-8_17","volume-title":"Algorithms and Discrete Applied Mathematics","author":"S Bhore","year":"2019","unstructured":"Bhore, S., Chakraborty, S., Jana, S., Mitchell, J.S.B., Pandit, S., Roy, S.: The balanced connected subgraph problem. In: Pal, S.P., Vijayakumar, A. (eds.) CALDAM 2019. LNCS, vol. 11394, pp. 201\u2013215. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11509-8_17"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-030-36412-0_5","volume-title":"Combinatorial Optimization and Applications","author":"S Bhore","year":"2019","unstructured":"Bhore, S., Jana, S., Pandit, S., Roy, S.: Balanced connected subgraph problem in geometric intersection graphs. In: Li, Y., Cardei, M., Huang, Y. (eds.) COCOA 2019. LNCS, vol. 11949, pp. 56\u201368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36412-0_5"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009). https:\/\/doi.org\/10.1016\/j.jcss.2009.04.001. https:\/\/doi.org\/10.1016\/j.jcss.2009.04.001","DOI":"10.1016\/j.jcss.2009.04.001"},{"issue":"3\u20134","key":"12_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B Bollob\u00e1s","year":"1965","unstructured":"Bollob\u00e1s, B.: On generalized graphs. Acta Math. Hungar. 16(3\u20134), 447\u2013452 (1965)","journal-title":"Acta Math. Hungar."},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Brewster, R.C., Dedic, R., Huard, F., Queen, J.: The recognition of bound quivers using edge-coloured homomorphisms. Discret. Math. 297(1-3), 13\u201325 (2005). https:\/\/doi.org\/10.1016\/j.disc.2004.10.026. https:\/\/doi.org\/10.1016\/j.disc.2004.10.026","DOI":"10.1016\/j.disc.2004.10.026"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Caro, Y., Hansberg, A., Lauri, J., Zarb, C.: On zero-sum spanning trees and zero-sum connectivity. Electron. J. Comb. 29(1), P1.9 (2022). https:\/\/doi.org\/10.37236\/10289. https:\/\/doi.org\/10.37236\/10289","DOI":"10.37236\/10289"},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-030-36412-0_36","volume-title":"Combinatorial Optimization and Applications","author":"B Darties","year":"2019","unstructured":"Darties, B., Giroudeau, R., Jean-Claude, K., Pollet, V.: The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs. In: Li, Y., Cardei, M., Huang, Y. (eds.) COCOA 2019. LNCS, vol. 11949, pp. 449\u2013460. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36412-0_36"},{"key":"12_CR10","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and ids. ACM Trans. Algorithms 11(2), 1\u201320 (2014). https:\/\/doi.org\/10.1145\/2650261. https:\/\/doi.org\/10.1145\/2650261","DOI":"10.1145\/2650261"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 1\u201360 (2016). https:\/\/doi.org\/10.1145\/2886094. https:\/\/doi.org\/10.1145\/2886094","DOI":"10.1145\/2886094"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem in NP complete. J. SIAM Appl. Math. 32, 826\u2013834 (1977)","journal-title":"J. SIAM Appl. Math."},{"key":"12_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-030-36412-0_24","volume-title":"Combinatorial Optimization and Applications","author":"Y Kobayashi","year":"2019","unstructured":"Kobayashi, Y., Kojima, K., Matsubara, N., Sone, T., Yamamoto, A.: Algorithms and hardness results for the maximum balanced connected subgraph problem. In: Li, Y., Cardei, M., Huang, Y. (eds.) COCOA 2019. LNCS, vol. 11949, pp. 303\u2013315. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36412-0_24"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Automata, Languages and Programming","author":"I Koutis","year":"2008","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 575\u2013586. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_47"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Koutis, I., Williams, R.: LIMITS and applications of group algebras for parameterized problems. ACM Trans. Algorithms 12(3), 1\u201318 (2016). https:\/\/doi.org\/10.1145\/2885499. https:\/\/doi.org\/10.1145\/2885499","DOI":"10.1145\/2885499"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Martinod, T., Pollet, V., Darties, B., Giroudeau, R., K\u00f6nig, J.: Complexity and inapproximability results for balanced connected subgraph problem. Theor. Comput. Sci. 886, 69\u201383 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.07.010. https:\/\/doi.org\/10.1016\/j.tcs.2021.07.010","DOI":"10.1016\/j.tcs.2021.07.010"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23\u201325 October 1995, pp. 182\u2013191 IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492475. https:\/\/doi.org\/10.1109\/SFCS.1995.492475","DOI":"10.1109\/SFCS.1995.492475"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using inclusion-exclusion. Algorithmica 65(4), 868\u2013884 (2013). https:\/\/doi.org\/10.1007\/s00453-012-9630-x. https:\/\/doi.org\/10.1007\/s00453-012-9630-x","DOI":"10.1007\/s00453-012-9630-x"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Shachnai, H., Zehavi, M.: Representative families: a unified tradeoff-based approach. J. Comput. Syst. Sci. 82(3), 488\u2013502 (2016). https:\/\/doi.org\/10.1016\/j.jcss.2015.11.008. https:\/\/doi.org\/10.1016\/j.jcss.2015.11.008","DOI":"10.1016\/j.jcss.2015.11.008"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"White, K., Farber, M., Pulleyblank, W.R.: Steiner trees, connected domination and strongly chordal graphs. Networks 15(1), 109\u2013124 (1985). https:\/\/doi.org\/10.1002\/net.3230150109. https:\/\/doi.org\/10.1002\/net.3230150109","DOI":"10.1002\/net.3230150109"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Williams, R.: Finding paths of length $$k$$ in $$O^*(2^k)$$ time. Inf. Process. Lett. 109(6), 315\u2013318 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2008.11.004. https:\/\/doi.org\/10.1016\/j.ipl.2008.11.004","DOI":"10.1016\/j.ipl.2008.11.004"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2023: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23101-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:05:38Z","timestamp":1673049938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23101-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031231001","9783031231018"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23101-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics.science.upjs.sk\/sofsem2023\/","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":"43","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":"26","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":"60% - 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+","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":"6-7","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)"}}]}}