{"id":"https://openalex.org/W1541438895","doi":"https://doi.org/10.1007/978-3-642-16926-7_5","title":"The Longest Path Problem is Polynomial on Cocomparability Graphs","display_name":"The Longest Path Problem is Polynomial on Cocomparability Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1541438895","doi":"https://doi.org/10.1007/978-3-642-16926-7_5","mag":"1541438895"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16926-7_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16926-7_5","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/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, GR-45110, Ioannina, Greece","Dept. of Computer Science, Univ. of Ioannina, Ioannina, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Ioannina, GR-45110, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]},{"raw_affiliation_string":"Dept. of Computer Science, Univ. of Ioannina, Ioannina, Greece","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, GR-45110, Ioannina, Greece","Dept. of Computer Science, Univ. of Ioannina, Ioannina, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Ioannina, GR-45110, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]},{"raw_affiliation_string":"Dept. of Computer Science, Univ. of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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":1.0906,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76289336,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"27","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9955999851226807,"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.9914000034332275,"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/longest-path-problem","display_name":"Longest path problem","score":0.8604532480239868},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7456402778625488},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.7345436811447144},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6806912422180176},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6281216144561768},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5656994581222534},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.5611546635627747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5255233645439148},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5216825008392334},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5200538039207458},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.5183630585670471},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.49636203050613403},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4633050560951233},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4432113766670227},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2805122435092926},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24929478764533997},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12762880325317383}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.8604532480239868},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7456402778625488},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.7345436811447144},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6806912422180176},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6281216144561768},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5656994581222534},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.5611546635627747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5255233645439148},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5216825008392334},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5200538039207458},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.5183630585670471},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.49636203050613403},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4633050560951233},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4432113766670227},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2805122435092926},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24929478764533997},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12762880325317383}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-16926-7_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16926-7_5","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.415.9785","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.9785","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/J-Papers/J-2012-ALGO.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.9996","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.9996","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/C-Papers/C-2010-WG.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":33,"referenced_works":["https://openalex.org/W112858196","https://openalex.org/W144954708","https://openalex.org/W1548700236","https://openalex.org/W1553648594","https://openalex.org/W1579049696","https://openalex.org/W1580484824","https://openalex.org/W1708444016","https://openalex.org/W1976157781","https://openalex.org/W1978041641","https://openalex.org/W1985773538","https://openalex.org/W1987647154","https://openalex.org/W1994680554","https://openalex.org/W2004084580","https://openalex.org/W2011039300","https://openalex.org/W2023957019","https://openalex.org/W2045021308","https://openalex.org/W2052982152","https://openalex.org/W2054496228","https://openalex.org/W2055336889","https://openalex.org/W2056992461","https://openalex.org/W2057303484","https://openalex.org/W2069133957","https://openalex.org/W2077143033","https://openalex.org/W2087818742","https://openalex.org/W2088579252","https://openalex.org/W2089894925","https://openalex.org/W2093577684","https://openalex.org/W2119014043","https://openalex.org/W2127206007","https://openalex.org/W2132624129","https://openalex.org/W2143474538","https://openalex.org/W4242336842","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2530575142","https://openalex.org/W2031276298","https://openalex.org/W2083238533","https://openalex.org/W2106934213","https://openalex.org/W110470963","https://openalex.org/W1541438895","https://openalex.org/W2033622225","https://openalex.org/W2950872944","https://openalex.org/W2063494850","https://openalex.org/W2003671143"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}