{"id":"https://openalex.org/W21966713","doi":"https://doi.org/10.1007/978-3-662-44465-8_43","title":"Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs","display_name":"Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W21966713","doi":"https://doi.org/10.1007/978-3-662-44465-8_43","mag":"21966713"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-44465-8_43","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44465-8_43","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009569829","display_name":"Nils M. Kriege","orcid":"https://orcid.org/0000-0003-2645-947X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Nils Kriege","raw_affiliation_strings":["Dept. of Computer Science, Technische Universit\u00e4t Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012801992","display_name":"Petra Mutzel","orcid":"https://orcid.org/0000-0001-7621-971X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Petra Mutzel","raw_affiliation_strings":["Dept. of Computer Science, Technische Universit\u00e4t Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009569829"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.902,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.83021044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"505","last_page":"516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.6389809250831604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6056036353111267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.558708667755127},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.49748852849006653},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4788746237754822},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.47440385818481445},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4520905911922455},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.42834246158599854},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4269922971725464},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.42698925733566284},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4173095226287842},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4148520827293396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41424545645713806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40342363715171814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3936242461204529},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.23877859115600586},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1143326461315155}],"concepts":[{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.6389809250831604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6056036353111267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.558708667755127},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.49748852849006653},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4788746237754822},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.47440385818481445},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4520905911922455},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.42834246158599854},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4269922971725464},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.42698925733566284},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4173095226287842},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4148520827293396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41424545645713806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40342363715171814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3936242461204529},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.23877859115600586},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1143326461315155},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-44465-8_43","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44465-8_43","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W96186885","https://openalex.org/W108777047","https://openalex.org/W202023760","https://openalex.org/W820461064","https://openalex.org/W1514401476","https://openalex.org/W1515227792","https://openalex.org/W1999414674","https://openalex.org/W2000945011","https://openalex.org/W2046820662","https://openalex.org/W2047667460","https://openalex.org/W2073919081","https://openalex.org/W2076043677","https://openalex.org/W2164155173","https://openalex.org/W2172037773","https://openalex.org/W2486062818"],"related_works":["https://openalex.org/W2135382359","https://openalex.org/W2113292309","https://openalex.org/W4286287454","https://openalex.org/W4311654148","https://openalex.org/W3105899476","https://openalex.org/W2766499403","https://openalex.org/W1978588354","https://openalex.org/W186753374","https://openalex.org/W2951811902","https://openalex.org/W3011668974"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}