{"id":"https://openalex.org/W7164006097","doi":"https://doi.org/10.1145/3798129.3800829","title":"Efficient Reversal of Transductions of Sparse Graph Classes","display_name":"Efficient Reversal of Transductions of Sparse Graph Classes","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164006097","doi":"https://doi.org/10.1145/3798129.3800829"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800829","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800829","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800829","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059825938","display_name":"Jan Dreier","orcid":"https://orcid.org/0000-0002-2662-5303"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Jan Dreier","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0002-2662-5303","affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123574421","display_name":"Jakub Gajarsk\u00fd","orcid":null},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["CZ","PL"],"is_corresponding":false,"raw_author_name":"Jakub Gajarsk\u00fd","raw_affiliation_strings":["Masaryk University, Faculty of Informatics, Brno, Czech Republic","University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0002-4761-3432","affiliations":[{"raw_affiliation_string":"Masaryk University, Faculty of Informatics, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-7891-1988","affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.93138625,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1180","last_page":"1191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.28610000014305115,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.28610000014305115,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.193900004029274,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.15230000019073486,"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/graph","display_name":"Graph","score":0.4050999879837036},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.35199999809265137},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.2827000021934509},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.27730000019073486},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.2770000100135803}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46619999408721924},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4075999855995178},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4050999879837036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3828999996185303},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.35199999809265137},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34850001335144043},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3257000148296356},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3041999936103821},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.2827000021934509},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.260699987411499},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800829","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800829","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800829","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800829","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4575084882","display_name":null,"funder_award_id":"948057","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G8276178086","display_name":null,"funder_award_id":"2022/47/D/ST6/03421","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1978747958","https://openalex.org/W2058239479","https://openalex.org/W2068718955","https://openalex.org/W2112212574","https://openalex.org/W2648245838","https://openalex.org/W2798339057","https://openalex.org/W2799268901","https://openalex.org/W2898841741","https://openalex.org/W3029345588","https://openalex.org/W3040059890","https://openalex.org/W3040102297","https://openalex.org/W3080820494","https://openalex.org/W3117647057","https://openalex.org/W3178718674","https://openalex.org/W3181611173","https://openalex.org/W4253175698","https://openalex.org/W4289800084","https://openalex.org/W4376639592","https://openalex.org/W4379537724","https://openalex.org/W4384337892","https://openalex.org/W4400761567","https://openalex.org/W4404849645","https://openalex.org/W4406231079","https://openalex.org/W4407225092","https://openalex.org/W4411319908","https://openalex.org/W4415110003","https://openalex.org/W4417257963","https://openalex.org/W7125416973"],"related_works":[],"abstract_inverted_index":{"(First-order)":[0],"transductions":[1],"are":[2],"a":[3,31,55,67,72,85,92],"basic":[4],"notion":[5],"capturing":[6],"graph":[7,36,42,68,74,93,152,163],"modifications":[8],"that":[9,45,65,77,124,161],"can":[10,51,79],"be":[11,52,80],"described":[12],"in":[13,150],"first-order":[14,86],"logic.":[15],"In":[16,112],"this":[17],"work,":[18],"we":[19,60,119],"propose":[20],"an":[21,62,101],"efficient":[22],"algorithmic":[23],"method":[24],"to":[25,91,117,122],"approximately":[26],"reverse":[27],"the":[28,34,133,145,159,162],"application":[29],"of":[30,57,96,135,172],"transduction,":[32],"assuming":[33],"source":[35],"is":[37,126,148],"sparse.":[38],"Precisely,":[39],"for":[40,114],"any":[41],"class":[43,56,94,134],"C":[44,125],"has":[46,139],"structurally":[47,173],"bounded":[48,58,97,174],"expansion":[49],"(i.e.,":[50,129,144],"transduced":[53],"from":[54,82,155],"expansion),":[59],"give":[61],"O(n4)-time":[63],"algorithm":[64],"given":[66],"G\u2208":[69],"C,":[70],"computes":[71],"vertex-colored":[73],"H":[75,83,89],"such":[76],"G":[78],"recovered":[81],"using":[84],"interpretation":[87],"and":[88,138],"belongs":[90],"D":[95],"expansion.":[98,175],"This":[99,157],"answers":[100],"open":[102],"problem":[103],"raised":[104],"by":[105],"Gajarsk\u00fd":[106],"et":[107],"al.":[108],"[ACM":[109],"TOCL,":[110],"\u201920].":[111],"fact,":[113],"our":[115],"procedure":[116],"work":[118],"only":[120],"need":[121],"assume":[123],"monadically":[127],"stable":[128],"does":[130],"not":[131],"transduce":[132],"all":[136,151],"half-graphs)":[137],"inherently":[140],"linear":[141,149],"neighborhood":[142,146],"complexity":[143,147],"classes":[153,164,171],"transducible":[154],"C).":[156],"renders":[158],"conclusion":[160],"satisfying":[165],"these":[166],"two":[167],"properties":[168],"coincide":[169],"with":[170]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}