{"id":"https://openalex.org/W4396808721","doi":"https://doi.org/10.1007/s00224-024-10176-w","title":"Preface of STACS 2021 Special Issue","display_name":"Preface of STACS 2021 Special Issue","publication_year":2024,"publication_date":"2024-05-10","ids":{"openalex":"https://openalex.org/W4396808721","doi":"https://doi.org/10.1007/s00224-024-10176-w"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-024-10176-w","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00224-024-10176-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-024-10176-w.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-024-10176-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097356499","display_name":"Markus Bl\u00e4ser","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus Bl\u00e4ser","raw_affiliation_strings":["Department of Computer Science, Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","Saarland University [Saarbr\u00fccken] (66123 Saarbr\u00fccken - Germany)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Saarland University [Saarbr\u00fccken] (66123 Saarbr\u00fccken - Germany)","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066787748","display_name":"Benjamin Monmege","orcid":"https://orcid.org/0000-0002-4717-9955"},"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/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I4210114274","display_name":"Laboratoire d\u2019Informatique et Syst\u00e8mes","ror":"https://ror.org/0257sgk90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I143002897","https://openalex.org/I21491767","https://openalex.org/I4210114274"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Benjamin Monmege","raw_affiliation_strings":["Aix Marseille University, CNRS, LIS, Marseille, France","MOVE - Mod\u00e9lisation et V\u00e9rification (Luminy - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aix Marseille University, CNRS, LIS, Marseille, France","institution_ids":["https://openalex.org/I21491767","https://openalex.org/I4210114274","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"MOVE - Mod\u00e9lisation et V\u00e9rification (Luminy - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5097356499"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08045941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"68","issue":"4","first_page":"835","last_page":"837"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9549999833106995,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9549999833106995,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9541000127792358,"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/T12288","display_name":"Optimization and Search Problems","score":0.9458000063896179,"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/computer-science","display_name":"Computer science","score":0.665624737739563},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6612453460693359},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6575828790664673},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5769305229187012},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4966481328010559},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4755908250808716},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.45092058181762695},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4412478506565094},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37508171796798706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2640591263771057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26363682746887207},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2457464337348938}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.665624737739563},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6612453460693359},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6575828790664673},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5769305229187012},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4966481328010559},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4755908250808716},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.45092058181762695},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4412478506565094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37508171796798706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2640591263771057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26363682746887207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2457464337348938},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00224-024-10176-w","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00224-024-10176-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-024-10176-w.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04740617v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04740617","pdf_url":"https://hal.science/hal-04740617v1/file/s00224-024-10176-w.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Theory of Computing Systems, 68, 2024, ⟨10.1007/s00224-024-10176-w⟩","raw_type":"Special issue"}],"best_oa_location":{"id":"doi:10.1007/s00224-024-10176-w","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00224-024-10176-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-024-10176-w.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323322","display_name":"Universit\u00e4t des Saarlandes","ror":"https://ror.org/01jdpyv68"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4396808721.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W2767174160","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W2953291322","https://openalex.org/W4296116869","https://openalex.org/W4286853492","https://openalex.org/W3215145351","https://openalex.org/W2152809035"],"abstract_inverted_index":{"Aspects":[0],"of":[1,34,53,82,106,110,117,149,161,176,190,210,216,233,240],"Computer":[2,67,119],"Science":[3],"(STACS).The":[4],"conference":[5,72],"was":[6],"held":[7],"online,":[8],"due":[9],"to":[10,22,225],"Covid":[11],"pandemic,":[12],"organised":[13],"in":[14,41,65,198,253],"Saarbrcken":[15],"by":[16,154],"Saarland":[17],"University":[18],"from":[19,102,186],"March":[20,23],"16":[21],"19,":[24],"2021.The":[25,108],"extended":[26,78],"abstracts":[27],"were":[28,37,56],"chosen":[29,112],"among":[30,60],"the":[31,61,70,74,83,96,103,111,147,150,157,162,173,177,194,205,231,236],"top":[32],"papers":[33,51,113],"those":[35],"which":[36,48],"selected":[38],"for":[39],"presentation":[40],"a":[42,80,91,182,187,208,241],"highly":[43],"competitive":[44,63],"peer-review":[45],"process":[46,105],"(after":[47],"only":[49,203],"56":[50],"out":[52],"228":[54],"submissions":[55],"accepted,":[57],"putting":[58],"STACS":[59,107],"most":[62,250],"conferences":[64],"Theoretical":[66,118],"Science).Compared":[68],"with":[69,79],"original":[71],"papers,":[73,151],"articles":[75],"have":[76],"been":[77],"description":[81],"context,":[84],"full":[85],"proofs,":[86],"and":[87,139,169,202],"additional":[88],"results.They":[89],"underwent":[90],"rigorous":[92],"reviewing":[93],"process,":[94],"following":[95],"TOCS":[97],"journal":[98],"standards,":[99],"completely":[100],"independent":[101],"selection":[104],"topics":[109],"cover":[114],"various":[115],"areas":[116],"Science,":[120],"that":[121,193],"is,":[122],"algorithmic":[123,136],"graph":[124],"theory,":[125,133,135,138],"linear":[126],"dynamical":[127],"systems,":[128],"parameterized":[129],"complexity":[130,134,188],"analysis,":[131],"automata":[132],"group":[137],"distributed":[140,174],"algorithms.In":[141],"what":[142],"follows,":[143],"we":[144],"briefly":[145],"describe":[146],"contributions":[148],"ordered":[152],"alphabetically":[153],"author":[155],"names.In":[156],"article":[158],"\"The":[159],"Complexity":[160],"Distributed":[163],"Constraint":[164],"Satisfaction":[165],"Problem\",":[166],"Silvia":[167],"Butti":[168],"Vctor":[170],"Dalmau":[171],"study":[172],"variant":[175],"constraint":[178],"satisfaction":[179],"problem":[180,195,232],"on":[181,245],"synchronous,":[183],"anonymous":[184],"network":[185],"point":[189],"view.They":[191],"show":[192],"is":[196,207,230,248],"decidable":[197],"polynomial":[199],"time":[200],"if":[201,204],"template":[206],"set":[209],"relations":[211],"invariant":[212],"under":[213],"symmetric":[214],"polymorphisms":[215],"all":[217],"arities.The":[218],"Minimum":[219],"Circuit":[220],"Size":[221],"Problem":[222],"MCSP":[223],"w.r.t.":[224],"some":[226],"size":[227,239],"bound":[228],"s":[229],"deciding":[234],"whether":[235],"minimum":[237],"circuit":[238],"given":[242],"Boolean":[243],"function":[244],"n":[246],"inputs":[247],"at":[249],"s(n).Recent":[251],"works":[252],"meta-complexity":[254],"exhibited":[255],"\"hardness":[256],"magnifi-":[257]},"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}