{"id":"https://openalex.org/W2023957019","doi":"https://doi.org/10.1007/s00453-009-9292-5","title":"The 1-Fixed-Endpoint Path Cover Problem is\u00a0Polynomial on Interval Graphs","display_name":"The 1-Fixed-Endpoint Path Cover Problem is\u00a0Polynomial on Interval Graphs","publication_year":2009,"publication_date":"2009-03-03","ids":{"openalex":"https://openalex.org/W2023957019","doi":"https://doi.org/10.1007/s00453-009-9292-5","mag":"2023957019"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-009-9292-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9292-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5042673538","display_name":"Katerina Asdre","orcid":null},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Katerina Asdre","raw_affiliation_strings":["Department of Computer Science, University of Ioannina, P.O. Box 1186, 45110, Ioannina, Greece","University of Ioannina"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Ioannina, P.O. Box 1186, 45110, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]},{"raw_affiliation_string":"University of Ioannina","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080071481","display_name":"Stavros D. Nikolopoulos","orcid":"https://orcid.org/0000-0001-6684-8459"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Stavros D. Nikolopoulos","raw_affiliation_strings":["Department of Computer Science, University of Ioannina, P.O. Box 1186, 45110, Ioannina, Greece","University of Ioannina"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Ioannina, P.O. Box 1186, 45110, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]},{"raw_affiliation_string":"University of Ioannina","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042673538"],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.1204,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.86567565,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"58","issue":"3","first_page":"679","last_page":"710"},"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.9984999895095825,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.7744851112365723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7376923561096191},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5666199922561646},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5549663305282593},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5230423212051392},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5034603476524353},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4942152798175812},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4790157675743103},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4768413305282593},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4754078984260559},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.46866166591644287},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4496217966079712},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4282882809638977},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4163699448108673},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.36708372831344604},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34776225686073303},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11759600043296814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11389973759651184}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7744851112365723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7376923561096191},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5666199922561646},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5549663305282593},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5230423212051392},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5034603476524353},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4942152798175812},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4790157675743103},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4768413305282593},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4754078984260559},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.46866166591644287},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4496217966079712},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4282882809638977},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4163699448108673},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.36708372831344604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34776225686073303},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11759600043296814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11389973759651184},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-009-9292-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9292-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.7769","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.7769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uoi.gr/~stavros/Papers/J-OnePC.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W202443341","https://openalex.org/W1579049696","https://openalex.org/W1968609349","https://openalex.org/W1976285925","https://openalex.org/W1976448277","https://openalex.org/W1978041641","https://openalex.org/W1989983876","https://openalex.org/W2005079828","https://openalex.org/W2011039300","https://openalex.org/W2021568739","https://openalex.org/W2027029476","https://openalex.org/W2028363955","https://openalex.org/W2028704451","https://openalex.org/W2034642511","https://openalex.org/W2036803675","https://openalex.org/W2053623386","https://openalex.org/W2054496228","https://openalex.org/W2055991650","https://openalex.org/W2058687965","https://openalex.org/W2059563583","https://openalex.org/W2060765530","https://openalex.org/W2066533631","https://openalex.org/W2077143033","https://openalex.org/W2087818742","https://openalex.org/W2132624129","https://openalex.org/W2141547852","https://openalex.org/W2143474538","https://openalex.org/W2157955289","https://openalex.org/W2569646339","https://openalex.org/W4210246355","https://openalex.org/W4212929868","https://openalex.org/W4242310348","https://openalex.org/W4252850254","https://openalex.org/W4285719527","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2157783000","https://openalex.org/W4287117052","https://openalex.org/W4206705200","https://openalex.org/W2963009577","https://openalex.org/W2028363955","https://openalex.org/W4283803822","https://openalex.org/W2016277208","https://openalex.org/W1964113132","https://openalex.org/W2183941833","https://openalex.org/W1577883397"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}