{"id":"https://openalex.org/W2888882694","doi":"https://doi.org/10.4230/lipics.esa.2018.50","title":"Generalized Coloring of Permutations","display_name":"Generalized Coloring of Permutations","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2888882694","doi":"https://doi.org/10.4230/lipics.esa.2018.50","mag":"2888882694"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:9513","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.50","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol112-esa2018/LIPIcs.ESA.2018.50/LIPIcs.ESA.2018.50.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":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol112-esa2018/LIPIcs.ESA.2018.50/LIPIcs.ESA.2018.50.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005488534","display_name":"V\u00edt Jel\u00ednek","orcid":"https://orcid.org/0000-0003-4831-4079"},"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":true,"raw_author_name":"Jel\u00ednek, V\u00edt","raw_affiliation_strings":["Computer Science Institute, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, Praha 1, 11800, Czechia","Charles University, Prague, Czechia"],"affiliations":[{"raw_affiliation_string":"Computer Science Institute, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, Praha 1, 11800, Czechia","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006649123","display_name":"Michal Opler","orcid":"https://orcid.org/0000-0002-4389-5807"},"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":"Opler, Michal","raw_affiliation_strings":["Computer Science Institute, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, Praha 1, 11800, Czechia","Charles University, Prague, Czechia"],"affiliations":[{"raw_affiliation_string":"Computer Science Institute, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, Praha 1, 11800, Czechia","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072926305","display_name":"P\u00e1vel Valtr","orcid":"https://orcid.org/0000-0002-3102-4166"},"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":"Valtr, Pavel","raw_affiliation_strings":["Department of Applied Mathematics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, Praha 1, 11800, Czechia","Charles University, Prague, Czechia"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, Praha 1, 11800, Czechia","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005488534"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.1308,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.48776323,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"14","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9453999996185303,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9284999966621399,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.7316113114356995},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7206611037254333},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.6850744485855103},{"id":"https://openalex.org/keywords/cyclic-permutation","display_name":"Cyclic permutation","score":0.6364841461181641},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.56830233335495},{"id":"https://openalex.org/keywords/bit-reversal-permutation","display_name":"Bit-reversal permutation","score":0.5480442643165588},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.5428095459938049},{"id":"https://openalex.org/keywords/sigma","display_name":"Sigma","score":0.5163644552230835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48790284991264343},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.48150643706321716},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4803229868412018},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.4178687334060669},{"id":"https://openalex.org/keywords/parity-of-a-permutation","display_name":"Parity of a permutation","score":0.41151174902915955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2863420844078064},{"id":"https://openalex.org/keywords/symmetric-group","display_name":"Symmetric group","score":0.12096554040908813}],"concepts":[{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.7316113114356995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7206611037254333},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.6850744485855103},{"id":"https://openalex.org/C77670614","wikidata":"https://www.wikidata.org/wiki/Q212130","display_name":"Cyclic permutation","level":3,"score":0.6364841461181641},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.56830233335495},{"id":"https://openalex.org/C175473596","wikidata":"https://www.wikidata.org/wiki/Q4918660","display_name":"Bit-reversal permutation","level":4,"score":0.5480442643165588},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.5428095459938049},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.5163644552230835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48790284991264343},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.48150643706321716},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4803229868412018},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.4178687334060669},{"id":"https://openalex.org/C64137656","wikidata":"https://www.wikidata.org/wiki/Q1064405","display_name":"Parity of a permutation","level":4,"score":0.41151174902915955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2863420844078064},{"id":"https://openalex.org/C128622974","wikidata":"https://www.wikidata.org/wiki/Q849512","display_name":"Symmetric group","level":2,"score":0.12096554040908813},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:9513","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.50","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol112-esa2018/LIPIcs.ESA.2018.50/LIPIcs.ESA.2018.50.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":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.esa.2018.50","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2018.50","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"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":""},{"id":"mag:2888882694","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2018/9513/pdf/LIPIcs-ESA-2018-50.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418381","display_name":"European Symposium on Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"European Symposium on Algorithms","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:9513","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.50","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol112-esa2018/LIPIcs.ESA.2018.50/LIPIcs.ESA.2018.50.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":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5509705973","display_name":null,"funder_award_id":"18-19158S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320328152","display_name":"Neuron Nada\u010dn\u00ed Fond Na Podporu V\u011bdy","ror":"https://ror.org/01szwa973"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2888882694.pdf","grobid_xml":"https://content.openalex.org/works/W2888882694.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2521141112","https://openalex.org/W2143220560","https://openalex.org/W2163837436","https://openalex.org/W2123475137","https://openalex.org/W2964309395","https://openalex.org/W2950400917","https://openalex.org/W2059924808","https://openalex.org/W46309646","https://openalex.org/W2952662568","https://openalex.org/W2144407541","https://openalex.org/W2290798374","https://openalex.org/W2772961567","https://openalex.org/W2937974789","https://openalex.org/W2040539833","https://openalex.org/W1759328148","https://openalex.org/W2613407656","https://openalex.org/W2925661864","https://openalex.org/W1964652076","https://openalex.org/W3038043012","https://openalex.org/W2949350338"],"abstract_inverted_index":{"A":[0],"permutation":[1,8,12,48,60,132,137],"pi":[2,21,61],"is":[3,62,180],"a":[4,7,11,58,63,91,104,119,157,161,170],"merge":[5,64,86],"of":[6,20,55,65,68,73,85,93,98,106,114,121,130,143,148,154,160],"sigma":[9,36],"and":[10,23,37,51,103,116],"tau,":[13],"if":[14],"we":[15,101,125,168],"can":[16,126,187],"color":[17],"the":[18,27,31,38,53,112,122,141,146,152,165,184,194],"elements":[19,29],"red":[22,28],"blue":[24,39],"so":[25],"that":[26,178,186],"have":[30],"same":[32],"relative":[33],"order":[34],"as":[35,41,140],"ones":[40],"tau.":[42],"We":[43,75],"consider,":[44],"for":[45,80,176],"fixed":[46],"hereditary":[47],"classes":[49],"C":[50,69],"D,":[52],"complexity":[54],"determining":[56],"whether":[57],"given":[59,162],"an":[66,71],"element":[67,72],"with":[70],"D.":[74],"develop":[76],"general":[77,123,171],"algorithmic":[78],"approaches":[79],"identifying":[81],"polynomially":[82],"tractable":[83,131],"cases":[84],"recognition.":[87],"Our":[88],"tools":[89],"include":[90],"version":[92],"nondeterministic":[94],"logspace":[95],"streaming":[96],"recognizability":[97],"permutations,":[99,145,150],"which":[100,174],"introduce,":[102],"concept":[105],"bounded":[107],"width":[108],"decomposition,":[109],"inspired":[110],"by":[111],"work":[113],"Ahal":[115],"Rabinovich.":[117],"As":[118],"consequence":[120],"results,":[124],"provide":[127],"nontrivial":[128],"examples":[129],"merges":[133],"involving":[134],"commonly":[135],"studied":[136],"classes,":[138],"such":[139],"class":[142,147,153],"layered":[144],"separable":[149],"or":[151],"permutations":[155,185],"avoiding":[156,193],"decreasing":[158],"sequence":[159],"length.":[163],"On":[164],"negative":[166],"side,":[167],"obtain":[169],"hardness":[172],"result":[173],"implies,":[175],"example,":[177],"it":[179],"NP-complete":[181],"to":[182],"recognize":[183],"be":[188],"merged":[189],"from":[190],"two":[191],"subpermutations":[192],"pattern":[195],"2413.":[196]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}