{"id":"https://openalex.org/W1539367839","doi":"https://doi.org/10.1007/978-3-642-19094-0_20","title":"A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs","display_name":"A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1539367839","doi":"https://doi.org/10.1007/978-3-642-19094-0_20","mag":"1539367839"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-19094-0_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19094-0_20","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/A5053661277","display_name":"Esha Ghosh","orcid":"https://orcid.org/0009-0002-6937-9197"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Esha Ghosh","raw_affiliation_strings":["Dept. of Computer Science and Engineering, IIT Madras, Chennai, 600036, India"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, IIT Madras, Chennai, 600036, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049949046","display_name":"N. S. Narayanaswamy","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N. S. Narayanaswamy","raw_affiliation_strings":["Dept. of Computer Science and Engineering, IIT Madras, Chennai, 600036, India"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, IIT Madras, Chennai, 600036, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103487617","display_name":"C. Pandu Rangan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. Pandu Rangan","raw_affiliation_strings":["Dept. of Computer Science and Engineering, IIT Madras, Chennai, 600036, India"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, IIT Madras, Chennai, 600036, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053661277"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3891,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63313725,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"191","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.991100013256073,"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.9898999929428101,"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.7465643286705017},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6764510273933411},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6343110799789429},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.52815842628479},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4811617136001587},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4745909869670868},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43718138337135315},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4251287579536438},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32970714569091797},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2929924428462982},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28405654430389404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24807298183441162},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13684824109077454}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.7465643286705017},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6764510273933411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6343110799789429},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.52815842628479},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4811617136001587},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4745909869670868},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43718138337135315},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4251287579536438},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32970714569091797},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2929924428462982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28405654430389404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24807298183441162},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13684824109077454},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-19094-0_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19094-0_20","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W1579049696","https://openalex.org/W1580484824","https://openalex.org/W1708444016","https://openalex.org/W1988098280","https://openalex.org/W1996889656","https://openalex.org/W2054496228","https://openalex.org/W2057303484","https://openalex.org/W2058687965","https://openalex.org/W2106934213","https://openalex.org/W2143474538","https://openalex.org/W2561675875","https://openalex.org/W3105668385","https://openalex.org/W4242336842"],"related_works":["https://openalex.org/W110470963","https://openalex.org/W2132921321","https://openalex.org/W2106934213","https://openalex.org/W2056992461","https://openalex.org/W1541438895","https://openalex.org/W2031276298","https://openalex.org/W2065006817","https://openalex.org/W2016277208","https://openalex.org/W4283803822","https://openalex.org/W1539367839"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}