{"id":"https://openalex.org/W1498403965","doi":"https://doi.org/10.1007/3-540-44693-1_30","title":"Space Efficient Algorithms for Series-Parallel Graphs","display_name":"Space Efficient Algorithms for Series-Parallel Graphs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1498403965","doi":"https://doi.org/10.1007/3-540-44693-1_30","mag":"1498403965"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44693-1_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44693-1_30","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":"conference-paper","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/A5053904278","display_name":"Andreas Jakoby","orcid":null},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Jakoby","raw_affiliation_strings":["Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Wallstr. 40, D-23560, L\u00fcbeck, Germany","Universit\u00e4t zu L\u00fcbeck"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Wallstr. 40, D-23560, L\u00fcbeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Universit\u00e4t zu L\u00fcbeck","institution_ids":["https://openalex.org/I9341345"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001544783","display_name":"Maciej Li\u015bkiewicz","orcid":"https://orcid.org/0000-0003-0059-5086"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maciej L\u00edskiewicz","raw_affiliation_strings":["Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Wallstr. 40, D-23560, L\u00fcbeck, Germany","Universit\u00e4t zu L\u00fcbeck"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Wallstr. 40, D-23560, L\u00fcbeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Universit\u00e4t zu L\u00fcbeck","institution_ids":["https://openalex.org/I9341345"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089868014","display_name":"R\u00fcdiger Reischuk","orcid":"https://orcid.org/0000-0003-2031-3664"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"R\u00fcdiger Reischuk","raw_affiliation_strings":["Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Wallstr. 40, D-23560, L\u00fcbeck, Germany","Universit\u00e4t zu L\u00fcbeck"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Wallstr. 40, D-23560, L\u00fcbeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Universit\u00e4t zu L\u00fcbeck","institution_ids":["https://openalex.org/I9341345"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9341345"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7469,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.63687412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"339","last_page":"352"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.6061142086982727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5826404094696045},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5677411556243896},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5270357728004456},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5130778551101685},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5097057819366455},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5050683617591858},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5009281635284424},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4968011677265167},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.45317772030830383},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43678557872772217},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41174596548080444},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35896068811416626},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34667694568634033},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34501004219055176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32571154832839966},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2757745683193207},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1339946985244751}],"concepts":[{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.6061142086982727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5826404094696045},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5677411556243896},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5270357728004456},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5130778551101685},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5097057819366455},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5050683617591858},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5009281635284424},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4968011677265167},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.45317772030830383},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43678557872772217},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41174596548080444},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35896068811416626},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34667694568634033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34501004219055176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32571154832839966},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2757745683193207},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1339946985244751},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44693-1_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44693-1_30","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":[{"score":0.6600000262260437,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1569759365","https://openalex.org/W1579049696","https://openalex.org/W1584086289","https://openalex.org/W1984509356","https://openalex.org/W1985495277","https://openalex.org/W1990870868","https://openalex.org/W2015676876","https://openalex.org/W2030429378","https://openalex.org/W2054260295","https://openalex.org/W2068638452","https://openalex.org/W2073840571","https://openalex.org/W2104397737","https://openalex.org/W2156184725"],"related_works":["https://openalex.org/W2031276298","https://openalex.org/W2061237693","https://openalex.org/W1977862280","https://openalex.org/W2362011785","https://openalex.org/W1919313975","https://openalex.org/W110470963","https://openalex.org/W3130332934","https://openalex.org/W1770696880","https://openalex.org/W2288749733","https://openalex.org/W2978658200"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}