{"id":"https://openalex.org/W1580484824","doi":"https://doi.org/10.1007/978-3-642-03816-7_35","title":"The Longest Path Problem Is Polynomial on Interval Graphs","display_name":"The Longest Path Problem Is Polynomial on Interval Graphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1580484824","doi":"https://doi.org/10.1007/978-3-642-03816-7_35","mag":"1580484824"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03816-7_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03816-7_35","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":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1157550","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, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of 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, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Germany","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, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of 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":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.9457,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.94285125,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"403","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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.9879999756813049,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9768000245094299,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8251013159751892},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6465240716934204},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5597704648971558},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5421901345252991},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.518821656703949},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4997110366821289},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4971175491809845},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.47813880443573},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.45806366205215454},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44099533557891846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4391365647315979},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43718183040618896},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3826955556869507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37433338165283203},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10798558592796326}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.8251013159751892},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6465240716934204},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5597704648971558},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5421901345252991},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.518821656703949},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4997110366821289},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4971175491809845},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.47813880443573},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.45806366205215454},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44099533557891846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4391365647315979},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43718183040618896},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3826955556869507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37433338165283203},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10798558592796326},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/978-3-642-03816-7_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03816-7_35","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:dro.dur.ac.uk.OAI2:9296","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/9296/","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":"Kr\u00e1lovic , Rastislav  &amp; Niwinski, Damian  (Eds.). (2009). Mathematical foundations of computer science 2009 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009 : proceedings. Berlin, Heidelberg: Springer, pp. 403-414, Lecture notes in computer science(5734)","raw_type":"Book chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.150.2982","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.2982","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/C-MFCS09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.175.8410","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.8410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://aib.informatik.rwth-aachen.de/2009/2009-11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.224.1491","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.1491","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/Conf/Conf_Longest-Interval.pdf","raw_type":"text"},{"id":"pmh:oai:durham-repository.worktribe.com:1157550","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1157550","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:83780","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/83780","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":"Mathematical foundations of computer science 2009 : 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009 ; proceedings / Rastislav Kr\u00e1lovic\u0306; Damian Niwi\u0144ski (eds.)<br/>Mathematical foundations of computer science 2009 : 34. international symposium, MFCS 2009, Novy Smokovec, Slovakia, 2009-08-24 - 2009-08-28","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1157550","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1157550","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"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/W1994680554","https://openalex.org/W2004084580","https://openalex.org/W2011039300","https://openalex.org/W2021568739","https://openalex.org/W2031332216","https://openalex.org/W2045021308","https://openalex.org/W2046496468","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/W2132624129","https://openalex.org/W2143474538","https://openalex.org/W2157110847","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/W2046852387","https://openalex.org/W2036803675","https://openalex.org/W2127206007","https://openalex.org/W2028363955","https://openalex.org/W2969955840"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}