{"id":"https://openalex.org/W1564787476","doi":"https://doi.org/10.1007/3-540-46784-x_16","title":"Efficient Analy sis of Graphs with Small Minimal Separators","display_name":"Efficient Analy sis of Graphs with Small Minimal Separators","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1564787476","doi":"https://doi.org/10.1007/3-540-46784-x_16","mag":"1564787476"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-46784-x_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46784-x_16","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/A5021261521","display_name":"K. Skodinis","orcid":null},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"K. Skodinis","raw_affiliation_strings":["University of Passau, 94030, Passau, Germany"],"affiliations":[{"raw_affiliation_string":"University of Passau, 94030, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021261521"],"corresponding_institution_ids":["https://openalex.org/I186354981"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4358,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.64117881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"155","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6177347302436829},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5432584881782532},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5369576811790466},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5200019478797913},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.510814905166626},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48247030377388},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47896578907966614},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4428291916847229},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.44188985228538513},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44076424837112427},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.43399670720100403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.354286253452301},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0936804711818695},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05577898025512695}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6177347302436829},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5432584881782532},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5369576811790466},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5200019478797913},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.510814905166626},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48247030377388},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47896578907966614},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4428291916847229},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.44188985228538513},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44076424837112427},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.43399670720100403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.354286253452301},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0936804711818695},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05577898025512695},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-46784-x_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46784-x_16","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.8391","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://brahms.fmi.uni-passau.de/~skodinis/WG99minsep.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W57441444","https://openalex.org/W148106857","https://openalex.org/W1533693718","https://openalex.org/W1578113210","https://openalex.org/W1983860528","https://openalex.org/W1991755800","https://openalex.org/W2012154006","https://openalex.org/W2013949481","https://openalex.org/W2027388354","https://openalex.org/W2047871605","https://openalex.org/W2055336889","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2085550081","https://openalex.org/W2088441646","https://openalex.org/W2091208300","https://openalex.org/W2118348286","https://openalex.org/W2139404577","https://openalex.org/W2143406303","https://openalex.org/W2143474538","https://openalex.org/W4213368513","https://openalex.org/W4299866835","https://openalex.org/W6680812728"],"related_works":["https://openalex.org/W2985636744","https://openalex.org/W1587078595","https://openalex.org/W2125058377","https://openalex.org/W1511821218","https://openalex.org/W2027388354","https://openalex.org/W1586184743","https://openalex.org/W1485639265","https://openalex.org/W2059372025","https://openalex.org/W1973972417","https://openalex.org/W2060933875"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}