{"id":"https://openalex.org/W2144199330","doi":"https://doi.org/10.1007/978-3-319-08404-6_28","title":"Linear Time LexDFS on Cocomparability Graphs.","display_name":"Linear Time LexDFS on Cocomparability Graphs.","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2144199330","doi":"https://doi.org/10.1007/978-3-319-08404-6_28","mag":"2144199330"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-08404-6_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-08404-6_28","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":"conference-paper","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/A5111471446","display_name":"Ekkehard K\u00f6hler","orcid":null},"institutions":[{"id":"https://openalex.org/I51783024","display_name":"Brandenburg University of Technology Cottbus-Senftenberg","ror":"https://ror.org/02wxx3e24","country_code":"DE","type":"education","lineage":["https://openalex.org/I51783024"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ekkehard K\u00f6hler","raw_affiliation_strings":["Brandenburg University of Technology, 03044, Cottbus, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brandenburg University of Technology, 03044, Cottbus, Germany","institution_ids":["https://openalex.org/I51783024"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089020530","display_name":"Lalla Mouatadid","orcid":"https://orcid.org/0000-0002-2274-6773"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lalla Mouatadid","raw_affiliation_strings":["University of Toronto, Toronto, ON, M5S 2J7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, ON, M5S 2J7, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4095,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.80021235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"319","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9922000169754028,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6743372678756714},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.6269853115081787},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.611173689365387},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5318878293037415},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5313383340835571},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5190225839614868},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4838801622390747},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4803153872489929},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4670763313770294},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4563252925872803},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41056400537490845},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3949434161186218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38711118698120117},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3453402519226074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2936655282974243},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1453566551208496},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11966440081596375}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6743372678756714},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.6269853115081787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.611173689365387},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5318878293037415},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5313383340835571},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5190225839614868},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4838801622390747},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4803153872489929},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4670763313770294},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4563252925872803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41056400537490845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3949434161186218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38711118698120117},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3453402519226074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2936655282974243},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1453566551208496},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11966440081596375}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-08404-6_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-08404-6_28","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.751.6046","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.751.6046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1404.5996.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":11,"referenced_works":["https://openalex.org/W1813313303","https://openalex.org/W1986137691","https://openalex.org/W1998389851","https://openalex.org/W2033410225","https://openalex.org/W2062584330","https://openalex.org/W2064717780","https://openalex.org/W2080222130","https://openalex.org/W2143474538","https://openalex.org/W2161426837","https://openalex.org/W2170633983","https://openalex.org/W2584881854"],"related_works":["https://openalex.org/W2052760902","https://openalex.org/W4283803822","https://openalex.org/W77483341","https://openalex.org/W2109292317","https://openalex.org/W2004663694","https://openalex.org/W2949556766","https://openalex.org/W2599254863","https://openalex.org/W4300330793","https://openalex.org/W2045135589","https://openalex.org/W4248583102"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}