{"id":"https://openalex.org/W2119014043","doi":"https://doi.org/10.1007/s00453-010-9411-3","title":"The Longest Path Problem has a Polynomial Solution on Interval Graphs","display_name":"The Longest Path Problem has a Polynomial Solution on Interval Graphs","publication_year":2010,"publication_date":"2010-05-11","ids":{"openalex":"https://openalex.org/W2119014043","doi":"https://doi.org/10.1007/s00453-010-9411-3","mag":"2119014043"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-010-9411-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9411-3","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":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1533458","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067824666","display_name":"Kyriaki Ioannidou","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":"Kyriaki Ioannidou","raw_affiliation_strings":["Department of Computer Science, University of Ioannina, P.O. Box 1186, 45110, Ioannina, Greece","University of Ioannina, Department of Computer Science, P.O. Box 1186, 45110 Ioannina, Greece"],"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, Department of Computer Science, P.O. Box 1186, 45110 Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018078197","display_name":"George B. Mertzios","orcid":"https://orcid.org/0000-0001-7182-585X"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"George B. Mertzios","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Ahornstr. 55, 52074, Aachen, Germany","RWTH Aachen University, Department of Computer Science, Ahornstr. 55, 52074, Aachen, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Ahornstr. 55, 52074, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"RWTH Aachen University, Department of Computer Science, Ahornstr. 55, 52074, Aachen, Germany#TAB#","institution_ids":["https://openalex.org/I887968799"]}]},{"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, Department of Computer Science, P.O. Box 1186, 45110 Ioannina, Greece"],"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, Department of Computer Science, P.O. Box 1186, 45110 Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067824666"],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.1003,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.9403366,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"61","issue":"2","first_page":"320","last_page":"341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9973000288009644,"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/T11269","display_name":"Algorithms and Data Compression","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/longest-path-problem","display_name":"Longest path problem","score":0.8433286547660828},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7102502584457397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6328584551811218},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5452379584312439},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5419699549674988},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5343524217605591},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5125405788421631},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.5032884478569031},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5023622512817383},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4902103543281555},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4725268483161926},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4195629358291626},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.39443352818489075},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36922311782836914},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13776031136512756},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11710453033447266}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.8433286547660828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7102502584457397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6328584551811218},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5452379584312439},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5419699549674988},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5343524217605591},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5125405788421631},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.5032884478569031},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5023622512817383},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4902103543281555},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4725268483161926},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4195629358291626},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.39443352818489075},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36922311782836914},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13776031136512756},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11710453033447266}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-010-9411-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9411-3","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:dro.dur.ac.uk.OAI2:9047","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/9047/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Algorithmica, 2011, Vol.61(2), pp.320-341 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.224.4927","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.4927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dur.ac.uk/george.mertzios/papers/Jour/Jour_Longest-Interval.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.1075","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.1075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dur.ac.uk/george.mertzios/papers/Jour/Jour_Longest-Interval-plain.pdf","raw_type":"text"},{"id":"pmh:oai:durham-repository.worktribe.com:1533458","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1533458","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"},{"id":"pmh:oai:publications.rwth-aachen.de:192309","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-068037%22","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica 61(2), 320-341 (2011). doi:10.1007/s00453-010-9411-3","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1533458","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1533458","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W1548700236","https://openalex.org/W1708444016","https://openalex.org/W1967041330","https://openalex.org/W1976157781","https://openalex.org/W1978041641","https://openalex.org/W1987647154","https://openalex.org/W1994680554","https://openalex.org/W2004084580","https://openalex.org/W2011039300","https://openalex.org/W2021568739","https://openalex.org/W2023957019","https://openalex.org/W2031332216","https://openalex.org/W2045021308","https://openalex.org/W2049670817","https://openalex.org/W2052982152","https://openalex.org/W2053623386","https://openalex.org/W2054496228","https://openalex.org/W2055336889","https://openalex.org/W2056992461","https://openalex.org/W2057303484","https://openalex.org/W2077143033","https://openalex.org/W2087818742","https://openalex.org/W2089894925","https://openalex.org/W2127206007","https://openalex.org/W2132624129","https://openalex.org/W2143474538","https://openalex.org/W2949756012","https://openalex.org/W4242336842","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W4387272283","https://openalex.org/W2768859505","https://openalex.org/W2256329187","https://openalex.org/W2952856011","https://openalex.org/W2036803675","https://openalex.org/W2127206007","https://openalex.org/W2069133957","https://openalex.org/W2969955840","https://openalex.org/W2028363955"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}