{"id":"https://openalex.org/W2071362870","doi":"https://doi.org/10.1007/s004530010016","title":"Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms","display_name":"Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W2071362870","doi":"https://doi.org/10.1007/s004530010016","mag":"2071362870"},"language":"en","primary_location":{"id":"doi:10.1007/s004530010016","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010016","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":"http://hdl.handle.net/11858/00-001M-0000-0014-A428-F","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038037154","display_name":"Surajit Chaudhuri","orcid":"https://orcid.org/0000-0001-8252-5270"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"S. Chaudhuri","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik,  Im Stadtwald, D-66123 Saarbr\u00fccken, Germany.  shiva@mpi-sb.mpg.de, zaro@mpi-sb.mpg.de., , , , , , DE","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik,  Im Stadtwald, D-66123 Saarbr\u00fccken, Germany.  shiva@mpi-sb.mpg.de, zaro@mpi-sb.mpg.de., , , , , , DE","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"C. D. Zaroliagis","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik,  Im Stadtwald, D-66123 Saarbr\u00fccken, Germany.  shiva@mpi-sb.mpg.de, zaro@mpi-sb.mpg.de., , , , , , DE","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik,  Im Stadtwald, D-66123 Saarbr\u00fccken, Germany.  shiva@mpi-sb.mpg.de, zaro@mpi-sb.mpg.de., , , , , , DE","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038037154"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.6241,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.96359205,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"27","issue":"3","first_page":"212","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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.9976999759674072,"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/treewidth","display_name":"Treewidth","score":0.8374452590942383},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6371370553970337},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6352036595344543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5330309867858887},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5096035003662109},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5068967938423157},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4966638684272766},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48187121748924255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4464058578014374},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4444786012172699},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4136827886104584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38982507586479187},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3855382204055786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35627278685569763},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.23621758818626404},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09937086701393127}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8374452590942383},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6371370553970337},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6352036595344543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5330309867858887},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5096035003662109},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5068967938423157},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4966638684272766},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48187121748924255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4464058578014374},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4444786012172699},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4136827886104584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38982507586479187},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3855382204055786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35627278685569763},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.23621758818626404},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09937086701393127},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/s004530010016","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010016","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.29.5454","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5454","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.mpi-sb.mpg.de/pub/papers/reports/MPI-I-95-1-020.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.9404","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.9404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~zaro/publications/Zaro-SP-I.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.423.3407","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.3407","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ceid.upatras.gr/faculty/zaro/pub/jou/J13-algo-spi-10016.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.5268","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~shiva/publications/sp.ps.gz","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:518152","is_oa":false,"landing_page_url":"http://edoc.mpg.de/518152","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, v.27, 212-226 (2000)","raw_type":"Article"},{"id":"pmh:oai:escidoc.org:escidoc:1833339","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-A428-F","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:pure.mpg.de:item_1330890","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-33FD-6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:escidoc.org:escidoc:1833339","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-A428-F","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W267514296","https://openalex.org/W1516511690","https://openalex.org/W1541820931","https://openalex.org/W1595621389","https://openalex.org/W1655990431","https://openalex.org/W1859866712","https://openalex.org/W1979750070","https://openalex.org/W1980347321","https://openalex.org/W2024291212","https://openalex.org/W2029448190","https://openalex.org/W2034501206","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2065759448","https://openalex.org/W2069001533","https://openalex.org/W2075188242","https://openalex.org/W2077996575","https://openalex.org/W2084224084","https://openalex.org/W2120424341","https://openalex.org/W2159003936","https://openalex.org/W2160098350","https://openalex.org/W2338905098","https://openalex.org/W2752885492","https://openalex.org/W2986773320","https://openalex.org/W4399554296"],"related_works":["https://openalex.org/W1515656813","https://openalex.org/W1576158606","https://openalex.org/W1836127928","https://openalex.org/W1490290385","https://openalex.org/W1972515959","https://openalex.org/W1572255008","https://openalex.org/W2027388354","https://openalex.org/W2289764920","https://openalex.org/W2583710543","https://openalex.org/W2914617426"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}