{"id":"https://openalex.org/W2050498298","doi":"https://doi.org/10.1145/1363686.1363729","title":"Nested temporal networks with alternatives","display_name":"Nested temporal networks with alternatives","publication_year":2008,"publication_date":"2008-03-16","ids":{"openalex":"https://openalex.org/W2050498298","doi":"https://doi.org/10.1145/1363686.1363729","mag":"2050498298"},"language":"en","primary_location":{"id":"doi:10.1145/1363686.1363729","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1363686.1363729","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM symposium on Applied computing","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/A5048241440","display_name":"Roman Bart\u00e1k","orcid":"https://orcid.org/0000-0002-6717-8175"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Roman Bart\u00e1k","raw_affiliation_strings":["Charles University, Prague, Czech Republic","Charles University, Prague (Czech Republic)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University, Prague (Czech Republic)","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059158185","display_name":"Ond\u0159ej \u010cepek","orcid":"https://orcid.org/0000-0002-6325-0897"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ond\u0159ej \u010cepek","raw_affiliation_strings":["Charles University, Prague, Czech Republic","Charles University, Prague (Czech Republic)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University, Prague (Czech Republic)","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9069,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87168827,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"156","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"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.9993000030517578,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9976999759674072,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6989721655845642},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5618048906326294},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5383390784263611},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5285448431968689},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47382959723472595},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.46787071228027344},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4275556802749634},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42350250482559204},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26176580786705017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25446373224258423},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23591455817222595}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6989721655845642},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5618048906326294},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5383390784263611},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5285448431968689},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47382959723472595},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46787071228027344},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4275556802749634},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42350250482559204},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26176580786705017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25446373224258423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23591455817222595},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1363686.1363729","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1363686.1363729","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM symposium on Applied computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.332.8562","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.8562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/Workshops/2007/WS-07-12/WS07-12-001.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.5684","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.5684","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://kti.ms.mff.cuni.cz/~bartak/downloads/AAAI2007ws.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W73185600","https://openalex.org/W105028502","https://openalex.org/W2038576084","https://openalex.org/W2615497679"],"related_works":["https://openalex.org/W2368454205","https://openalex.org/W2370467235","https://openalex.org/W2989824750","https://openalex.org/W2347925354","https://openalex.org/W2374502283","https://openalex.org/W2359737466","https://openalex.org/W2800924481","https://openalex.org/W2048701728","https://openalex.org/W2110671666","https://openalex.org/W2170725231"],"abstract_inverted_index":{"Temporal":[0,34,71],"networks":[1,20,59],"play":[2],"a":[3,67,79,107],"crucial":[4],"role":[5],"in":[6,10,57,94],"modeling":[7],"temporal":[8,19],"relations":[9],"planning":[11],"and":[12,43],"scheduling":[13],"applications.":[14],"Recently,":[15],"several":[16],"extensions":[17],"of":[18,49,70,82,88],"were":[21,38],"proposed":[22,39,113],"to":[23,40,111],"integrate":[24],"non-temporal":[25],"information":[26],"such":[27,58],"as":[28],"resource":[29],"consumption":[30],"or":[31],"logical":[32],"dependencies.":[33],"Networks":[35,72],"with":[36,73],"Alternatives":[37,74],"model":[41],"alternative":[42],"parallel":[44],"processes,":[45,84],"however":[46],"the":[47,86,112],"problem":[48,87],"deciding":[50,89],"which":[51],"nodes":[52],"can":[53,76,103],"be":[54],"consistently":[55],"included":[56],"is":[60,92],"NPcomplete.":[61],"In":[62],"this":[63],"paper":[64],"we":[65],"propose":[66],"tractable":[68],"subclass":[69],"that":[75,102],"still":[77],"cover":[78],"wide":[80],"range":[81],"real-life":[83],"while":[85],"node":[90],"validity":[91],"solvable":[93],"polynomial":[95],"time.":[96],"We":[97],"also":[98],"present":[99],"an":[100],"algorithm":[101],"effectively":[104],"recognize":[105],"whether":[106],"given":[108],"network":[109],"belongs":[110],"sub-class.":[114]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}