{"id":"https://openalex.org/W7165731732","doi":"https://doi.org/10.4230/lipics.sand.2026.22","title":"Brief Announcement: Time-Travel Planning with Tenet Turnstiles","display_name":"Brief Announcement: Time-Travel Planning with Tenet Turnstiles","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165731732","doi":"https://doi.org/10.4230/lipics.sand.2026.22"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26256","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.22","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.22/LIPIcs.SAND.2026.22.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.22/LIPIcs.SAND.2026.22.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015685991","display_name":"Thibaut Blanc","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Blanc, Thibaut","raw_affiliation_strings":["ENS Lyon, France"],"raw_orcid":"https://orcid.org/0009-0004-7462-9909","affiliations":[{"raw_affiliation_string":"ENS Lyon, France","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054863398","display_name":"Quentin Bramas","orcid":"https://orcid.org/0000-0003-0612-5616"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210100283","display_name":"Laboratoire des Sciences de l'Ing\u00e9nieur, de l'Informatique et de l'Imagerie","ror":"https://ror.org/00k4e5n71","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2801509770","https://openalex.org/I4210095849","https://openalex.org/I4210100283","https://openalex.org/I4210159245","https://openalex.org/I68947357"]},{"id":"https://openalex.org/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Bramas, Quentin","raw_affiliation_strings":["Strasbourg University, CNRS, ICUBE, France"],"raw_orcid":"https://orcid.org/0000-0003-0612-5616","affiliations":[{"raw_affiliation_string":"Strasbourg University, CNRS, ICUBE, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210100283","https://openalex.org/I68947357"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049232220","display_name":"Jean-Romain Luttringer","orcid":"https://orcid.org/0000-0002-1809-7723"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210100283","display_name":"Laboratoire des Sciences de l'Ing\u00e9nieur, de l'Informatique et de l'Imagerie","ror":"https://ror.org/00k4e5n71","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2801509770","https://openalex.org/I4210095849","https://openalex.org/I4210100283","https://openalex.org/I4210159245","https://openalex.org/I68947357"]},{"id":"https://openalex.org/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Luttringer, Jean-Romain","raw_affiliation_strings":["Strasbourg University, CNRS, ICUBE, France"],"raw_orcid":"https://orcid.org/0000-0002-1809-7723","affiliations":[{"raw_affiliation_string":"Strasbourg University, CNRS, ICUBE, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210100283","https://openalex.org/I68947357"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073883755","display_name":"S\u00e9bastien Tixeuil","orcid":"https://orcid.org/0000-0002-0948-7172"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Tixeuil, S\u00e9bastien","raw_affiliation_strings":["Sorbonne University, CNRS, LIP6, IUF, France"],"raw_orcid":"https://orcid.org/0000-0002-0948-7172","affiliations":[{"raw_affiliation_string":"Sorbonne University, CNRS, LIP6, IUF, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I39804081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67360009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.618399977684021,"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/T12288","display_name":"Optimization and Search Problems","score":0.618399977684021,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.06440000236034393,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.05790000036358833,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/competitive-analysis","display_name":"Competitive analysis","score":0.6901999711990356},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5382999777793884},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5095999836921692},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.436599999666214},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.3303000032901764},{"id":"https://openalex.org/keywords/turnstile","display_name":"Turnstile","score":0.32440000772476196},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3172000050544739}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6901999711990356},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5382999777793884},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5095999836921692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4754999876022339},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4480000138282776},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.436599999666214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3919999897480011},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3305000066757202},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C31370731","wikidata":"https://www.wikidata.org/wiki/Q7856108","display_name":"Turnstile","level":2,"score":0.32440000772476196},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31690001487731934},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.2802000045776367},{"id":"https://openalex.org/C58546491","wikidata":"https://www.wikidata.org/wiki/Q1150207","display_name":"Competitive advantage","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26256","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.22","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.22/LIPIcs.SAND.2026.22.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.22","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.22","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26256","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.22","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.22/LIPIcs.SAND.2026.22.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4655880630016327,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165731732.pdf","grobid_xml":"https://content.openalex.org/works/W7165731732.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,75],"study":[1],"routing":[2],"in":[3],"dynamic":[4],"graphs":[5],"when":[6],"an":[7],"agent":[8],"may":[9],"use":[10],"backward":[11],"time":[12,19,30,73],"travel":[13],"(BTT)":[14],"devices.":[15],"Minimizing":[16],"delay":[17],"(arrival":[18],"minus":[20],"departure":[21],"time)":[22],"is":[23,32,62],"the":[24,27,33,38,57,70,85],"primary":[25],"objective;":[26],"number":[28],"of":[29,40,72],"inversions":[31],"secondary":[34],"cost.":[35],"Building":[36],"on":[37],"framework":[39],"Bramas":[41],"et":[42],"al.,":[43],"we":[44,98],"introduce":[45],"two":[46],"space-time":[47],"online":[48],"settings":[49],"-":[50,54],"ST-online-easy":[51],"and":[52,55,87,97],"ST-online-hard":[53],"analyze":[56],"Tenet":[58],"model,":[59],"where":[60],"BTT":[61],"performed":[63],"by":[64],"entering":[65],"a":[66,77,90],"turnstile":[67],"that":[68,100],"reverses":[69],"direction":[71],"flow.":[74],"obtain":[76],"polynomial-time":[78],"offline":[79],"algorithm,":[80],"tight":[81,91],"competitive":[82,93,103],"ratios":[83],"for":[84,95,106],"T-online":[86],"S-online":[88],"settings,":[89],"quadratic":[92],"ratio":[94,104],"ST-online-easy,":[96],"prove":[99],"no":[101],"finite":[102],"exists":[105],"ST-online-hard.":[107]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2026-06-25T00:00:00"}