{"id":"https://openalex.org/W2113678384","doi":"https://doi.org/10.1109/time.2003.1214898","title":"A new effcient algorithm for solving the simple temporal problem","display_name":"A new effcient algorithm for solving the simple temporal problem","publication_year":2005,"publication_date":"2005-04-12","ids":{"openalex":"https://openalex.org/W2113678384","doi":"https://doi.org/10.1109/time.2003.1214898","mag":"2113678384"},"language":"en","primary_location":{"id":"doi:10.1109/time.2003.1214898","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2003.1214898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.","raw_type":"proceedings-article"},"type":"article","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/A5029945012","display_name":"Xu Lin","orcid":"https://orcid.org/0000-0003-4770-6310"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lin Xu","raw_affiliation_strings":["Constraint Systems Laboratory, Department of Computer Science and Engineering, University of Nebraska, Lincoln, USA"],"affiliations":[{"raw_affiliation_string":"Constraint Systems Laboratory, Department of Computer Science and Engineering, University of Nebraska, Lincoln, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084469975","display_name":"Berthe Y. Choueiry","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B.Y. Choueiry","raw_affiliation_strings":["Constraint Systems Laboratory, Department of Computer Science and Engineering, University of Nebraska, Lincoln, USA"],"affiliations":[{"raw_affiliation_string":"Constraint Systems Laboratory, Department of Computer Science and Engineering, University of Nebraska, Lincoln, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029945012"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":2.5954,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.91122782,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"210","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9728999733924866,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6800999641418457},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6797926425933838},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5115453004837036},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4392070174217224}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6800999641418457},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6797926425933838},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5115453004837036},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4392070174217224},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/time.2003.1214898","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2003.1214898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.","raw_type":"proceedings-article"}],"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/W185770369","https://openalex.org/W1866349670","https://openalex.org/W2049819684","https://openalex.org/W2080192364","https://openalex.org/W2119456262","https://openalex.org/W2130182605","https://openalex.org/W2135432705","https://openalex.org/W2255409074","https://openalex.org/W2337098149","https://openalex.org/W2752885492","https://openalex.org/W3137299218","https://openalex.org/W4250871362","https://openalex.org/W6607406990","https://openalex.org/W6692081523"],"related_works":["https://openalex.org/W2393888177","https://openalex.org/W2544423928","https://openalex.org/W2115794623","https://openalex.org/W2360264381","https://openalex.org/W2067173559","https://openalex.org/W2148738811","https://openalex.org/W1613730747","https://openalex.org/W2541389358","https://openalex.org/W4318948887","https://openalex.org/W1994204274"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}