{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:36:05Z","timestamp":1760524565577,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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-49190-0_8","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"115-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear Time Algorithms for\u00a0NP-Hard Problems Restricted to\u00a0GaTEx Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1620-5508","authenticated-orcid":false,"given":"Marc","family":"Hellmuth","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5033-8040","authenticated-orcid":false,"given":"Guillaume E.","family":"Scholz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"3\u20134","key":"8_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J. Comput. Biol. 6(3\u20134), 281\u2013297 (1999). https:\/\/doi.org\/10.1089\/106652799318274. pMID: 10582567","journal-title":"J. Comput. Biol."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/TCBB.2007.70270","volume":"6","author":"G Cardona","year":"2007","unstructured":"Cardona, G., Rossell\u00f3, F., Valiente, G.: Comparison of tree-child phylogenetic networks. IEEE\/ACM Trans. Comput. Biol. Bioinf. 6, 552\u2013569 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Chv\u00e1tal, V.: Perfectly ordered graphs. In: Berge, C., Chv\u00e1tal, V. (eds.) Topics on Perfect Graphs. North-Holland Mathematics Studies, vol. 88, pp. 63\u201365. North-Holland (1984). https:\/\/doi.org\/10.1016\/S0304-0208(08)72923-2. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304020808729232","DOI":"10.1016\/S0304-0208(08)72923-2"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.K.: Complement reducible graphs. Discr. Appl. Math. 3, 163\u2013174 (1981)","journal-title":"Discr. Appl. Math."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926\u2013934 (1985). https:\/\/doi.org\/10.1137\/0214065","journal-title":"SIAM J. Comput."},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. J. Algorithms 41(2), 360\u2013387 (2001)","journal-title":"J. Algorithms"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(90)90129-6","volume":"70","author":"A Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, part I: clans, basic subclasses, and morphisms. Theor. Comp. Sci. 70, 277\u2013303 (1990)","journal-title":"Theor. Comp. Sci."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(90)90130-A","volume":"70","author":"A Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, part II: representation through labeled tree families. Theor. Comp. Sci. 70, 305\u2013342 (1990)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1006\/jagm.1994.1013","volume":"16","author":"A Ehrenfeucht","year":"1994","unstructured":"Ehrenfeucht, A., Gabow, H.N., Mcconnell, R.M., Sullivan, S.J.: An O($$n^2$$) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs. J. Algorithms 16(2), 283\u2013294 (1994)","journal-title":"J. Algorithms"},{"key":"8_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"key":"8_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s12064-023-00398-w","author":"M Hellmuth","year":"2023","unstructured":"Hellmuth, M., Schaller, D., Stadler, P.F.: Clustering systems of phylogenetic networks. Theory Biosci. (2023). https:\/\/doi.org\/10.1007\/s12064-023-00398-w","journal-title":"Theory Biosci."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.dam.2022.06.042","volume":"321","author":"M Hellmuth","year":"2022","unstructured":"Hellmuth, M., Scholz, G.E.: From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats. Discret. Appl. Math. 321, 179\u2013219 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.06.042","journal-title":"Discret. Appl. Math."},{"key":"8_CR14","unstructured":"Hellmuth, M., Scholz, G.E.: Linear time algorithms for NP-hard problems restricted to GaTEx graphs (2023). arXiv:2306.04367"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Hellmuth, M., Scholz, G.E.: Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (2023). arXiv:2211.16854","DOI":"10.2139\/ssrn.4334388"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s00285-016-1084-3","volume":"75","author":"M Hellmuth","year":"2017","unstructured":"Hellmuth, M., Stadler, P.F., Wieseke, N.: The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations. J. Math. Biol. 75(1), 199\u2013237 (2017). https:\/\/doi.org\/10.1007\/s00285-016-1084-3","journal-title":"J. Math. Biol."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00453-016-0241-9","volume":"80","author":"KT Huber","year":"2018","unstructured":"Huber, K.T., Scholz, G.E.: Beyond representing orthology relations with trees. Algorithmica 80(1), 73\u2013103 (2018)","journal-title":"Algorithmica"},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14(2), 95\u2013116 (1949). https:\/\/doi.org\/10.1007\/BF02289146","journal-title":"Psychometrika"},{"key":"8_CR19","first-page":"11","volume":"48","author":"D Marx","year":"2004","unstructured":"Marx, D.: Graph colouring problems and their applications in scheduling. Periodica Polytechnica Electr. Eng. 48, 11\u201316 (2004)","journal-title":"Periodica Polytechnica Electr. Eng."},{"issue":"1\u20133","key":"8_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discret. Math. 201(1\u20133), 189\u2013241 (1999)","journal-title":"Discret. Math."},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Middendorf, M., Pfeiffer, F.: On the complexity of recognizing perfectly orderable graphs. Discret. Math. 80(3), 327\u2013333 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90251-C. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X9090251C","DOI":"10.1016\/0012-365X(90)90251-C"},{"issue":"21","key":"8_CR22","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V Spirin","year":"2003","unstructured":"Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. 100(21), 12123\u201312128 (2003). https:\/\/doi.org\/10.1073\/pnas.2032324100","journal-title":"Proc. Natl. Acad. Sci."},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. 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. 634\u2013645. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_52"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Turau, V., Weyer, C.: Algorithmische Graphentheorie. De Gruyter, Berlin, M\u00fcnchen, Boston (2015). https:\/\/doi.org\/10.1515\/9783110417326","DOI":"10.1515\/9783110417326"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:08:47Z","timestamp":1702026527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}