{"id":"https://openalex.org/W4308502377","doi":"https://doi.org/10.1007/s10957-022-02091-2","title":"On Recognizing Staircase Compatibility","display_name":"On Recognizing Staircase Compatibility","publication_year":2022,"publication_date":"2022-10-29","ids":{"openalex":"https://openalex.org/W4308502377","doi":"https://doi.org/10.1007/s10957-022-02091-2"},"language":"en","primary_location":{"id":"doi:10.1007/s10957-022-02091-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-022-02091-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-022-02091-2.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory and Applications","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/s10957-022-02091-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083532284","display_name":"Andreas B\u00e4rmann","orcid":null},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas B\u00e4rmann","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany"],"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009175650","display_name":"Patrick Gemander","orcid":"https://orcid.org/0000-0002-0784-6696"},"institutions":[{"id":"https://openalex.org/I4210124274","display_name":"Fraunhofer Institute for Integrated Circuits","ror":"https://ror.org/024ape423","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210124274","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Patrick Gemander","raw_affiliation_strings":["Fraunhofer-Institut f\u00fcr Integrierte Schaltungen IIS, Nuremberg, Germany"],"affiliations":[{"raw_affiliation_string":"Fraunhofer-Institut f\u00fcr Integrierte Schaltungen IIS, Nuremberg, Germany","institution_ids":["https://openalex.org/I4210124274"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006197528","display_name":"Alexander Mart\u00edn","orcid":"https://orcid.org/0000-0001-7602-3653"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Martin","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany"],"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033079299","display_name":"Maximilian Merkert","orcid":"https://orcid.org/0000-0002-7838-445X"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maximilian Merkert","raw_affiliation_strings":["Technische Universit\u00e4t Braunschweig, Brunswick, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Braunschweig, Brunswick, Germany","institution_ids":["https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083532284"],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.1509,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51833127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"195","issue":"2","first_page":"449","last_page":"479"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.984499990940094,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unimodular-matrix","display_name":"Unimodular matrix","score":0.7016200423240662},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6870319247245789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6666750311851501},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6046273708343506},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5855071544647217},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4838899075984955},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48226267099380493},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.45754382014274597},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41129767894744873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.332429975271225},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2846907675266266}],"concepts":[{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.7016200423240662},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6870319247245789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6666750311851501},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6046273708343506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5855071544647217},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4838899075984955},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48226267099380493},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.45754382014274597},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41129767894744873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.332429975271225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2846907675266266}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10957-022-02091-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-022-02091-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-022-02091-2.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:joptap:v:195:y:2022:i:2:d:10.1007_s10957-022-02091-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10957-022-02091-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:publica.fraunhofer.de:publica/442467","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/442467","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"journal article"}],"best_oa_location":{"id":"doi:10.1007/s10957-022-02091-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-022-02091-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-022-02091-2.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2862657677","display_name":null,"funder_award_id":"CRC TRR 154","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G475298373","display_name":null,"funder_award_id":"GRK 2297 MathCoRe","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5106512922","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5328560043","display_name":null,"funder_award_id":"GRK 2297","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7967516821","display_name":null,"funder_award_id":"ADA-Center","funder_id":"https://openalex.org/F4320323061","funder_display_name":"Bayerisches Staatsministerium f\u00fcr Wirtschaft, Infrastruktur, Verkehr und Technologie"},{"id":"https://openalex.org/G8330397625","display_name":null,"funder_award_id":"Funding","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8928656450","display_name":null,"funder_award_id":"Projekt DEAL","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320323061","display_name":"Bayerisches Staatsministerium f\u00fcr Wirtschaft, Infrastruktur, Verkehr und Technologie","ror":"https://ror.org/00rspzk45"},{"id":"https://openalex.org/F4320330033","display_name":"ADA Lovelace Center for Analytics, Data, Applications","ror":null},{"id":"https://openalex.org/F4320331012","display_name":"Bayerische Staatsministerium f\u00fcr Wirtschaft, Landesentwicklung und Energie","ror":null},{"id":"https://openalex.org/F4320335829","display_name":"Otto von Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4308502377.pdf","grobid_xml":"https://content.openalex.org/works/W4308502377.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1964678328","https://openalex.org/W1965915143","https://openalex.org/W1987381484","https://openalex.org/W2011039300","https://openalex.org/W2078092147","https://openalex.org/W2082603400","https://openalex.org/W2401610261","https://openalex.org/W2563164663","https://openalex.org/W2605820859","https://openalex.org/W2883706988","https://openalex.org/W2964124125","https://openalex.org/W2970385781","https://openalex.org/W3001605797","https://openalex.org/W3133372098","https://openalex.org/W4241276410","https://openalex.org/W6833262434"],"related_works":["https://openalex.org/W2005641010","https://openalex.org/W4287668802","https://openalex.org/W2030668571","https://openalex.org/W2741543745","https://openalex.org/W2905129508","https://openalex.org/W2587433615","https://openalex.org/W1779359754","https://openalex.org/W1988771411","https://openalex.org/W3005925191","https://openalex.org/W4221160330"],"abstract_inverted_index":{"Abstract":[0],"For":[1,136],"the":[2,39,49,89,95,98,102,169,175,192,198,229,233,239,242],"problem":[3,171,240],"to":[4,75,111,144,157,190,232],"find":[5],"an":[6,10,35],"m":[7,11,36,55,58,99,165,205],"-clique":[8],"in":[9,57,94,121,133,174],"-partite":[12,59,166,206],"graph,":[13],"staircase":[14,146,151,256],"compatibility":[15,147],"has":[16],"recently":[17],"been":[18],"introduced":[19],"as":[20,61,214,216],"a":[21,28,31,62,141,158,180,187,209,220,249],"polynomial-time":[22,142],"solvable":[23,182],"special":[24],"case.":[25],"It":[26,224],"is":[27,104,119,172],"property":[29,93],"of":[30,38,48,91,101,161,200,211],"graph":[32,103],"together":[33],"with":[34],"-partition":[37,100],"vertex":[40],"set":[41,160,210],"and":[42,148,184,236],"total":[43,108,117,152,193],"orders":[44,109,118,153],"on":[45,208],"each":[46],"subset":[47],"partition.":[50],"In":[51,82],"optimization":[52],"problems":[53,78],"involving":[54],"-cliques":[56],"graphs":[60,207],"subproblem,":[63],"it":[64,129],"allows":[65],"for":[66,204],"totally":[67,244],"unimodular":[68,245],"linear":[69],"programming":[70],"formulations,":[71],"which":[72,128,252],"have":[73],"shown":[74],"efficiently":[76],"solve":[77],"from":[79,219],"different":[80],"applications.":[81],"this":[83,92],"work,":[84],"we":[85,123,139,178,196],"address":[86],"questions":[87],"concerning":[88],"recognizability":[90],"case":[96],"where":[97,168],"given,":[105],"but":[106],"suitable":[107],"are":[110,154],"be":[112,131],"determined.":[113],"While":[114],"finding":[115],"these":[116],"NP-hard":[120],"general,":[122],"give":[124],"several":[125],"conditions":[126],"under":[127],"can":[130],"done":[132],"polynomial":[134],"time.":[135],"bipartite":[137],"graphs,":[138,167],"present":[140],"algorithm":[143,189,203,231],"recognize":[145],"show":[149],"that":[150,227],"unique":[155],"up":[156],"small":[159],"reordering":[162],"operations.":[163],"On":[164],"recognition":[170],"NP-complete":[173],"general":[176],"case,":[177],"identify":[179],"polynomially":[181],"subcase":[183],"also":[185],"provide":[186],"corresponding":[188],"compute":[191],"orders.":[194],"Finally,":[195],"evaluate":[197],"performance":[199],"our":[201],"ordering":[202,230],"artificial":[212],"instances":[213,218,235],"well":[215],"real-world":[217,234],"railway":[221],"timetabling":[222],"application.":[223],"turns":[225],"out":[226],"applying":[228],"subsequently":[237],"solving":[238],"via":[241],"aforementioned":[243],"reformulations":[246],"indeed":[247],"outperforms":[248],"generic":[250],"formulation":[251],"does":[253],"not":[254],"exploit":[255],"compatibility.":[257]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}