{"id":"https://openalex.org/W7128300256","doi":"https://doi.org/10.1007/s00453-025-01363-3","title":"Block Crossings in One-Sided Tanglegrams","display_name":"Block Crossings in One-Sided Tanglegrams","publication_year":2026,"publication_date":"2026-02-07","ids":{"openalex":"https://openalex.org/W7128300256","doi":"https://doi.org/10.1007/s00453-025-01363-3"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01363-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01363-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01363-3.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/s00453-025-01363-3.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017457382","display_name":"Alexander Dobler","orcid":"https://orcid.org/0000-0002-0712-9726"},"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":true,"raw_author_name":"Alexander Dobler","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":null,"display_name":"Martin N\u00f6llenburg","orcid":null},"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":"Martin N\u00f6llenburg","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017457382"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"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.33322148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.27559998631477356,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.27559998631477356,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.133200004696846,"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"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.11990000307559967,"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/block","display_name":"Block (permutation group theory)","score":0.6672000288963318},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6251999735832214},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5823000073432922},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5471000075340271},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.534500002861023},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5303999781608582},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5077999830245972},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4887000024318695},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4041000008583069}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7120000123977661},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6855999827384949},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6672000288963318},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6251999735832214},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5823000073432922},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5471000075340271},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.534500002861023},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5303999781608582},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5077999830245972},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4887000024318695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.453000009059906},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.40230000019073486},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3939000070095062},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35679998993873596},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.35359999537467957},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3359000086784363},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.30869999527931213},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.3025999963283539},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.29750001430511475},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.28780001401901245},{"id":"https://openalex.org/C55919133","wikidata":"https://www.wikidata.org/wiki/Q7644297","display_name":"Supertree","level":4,"score":0.25920000672340393},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-025-01363-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01363-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01363-3.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-025-01363-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01363-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01363-3.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5259471551","display_name":null,"funder_award_id":"10.47379/ICT19035","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320322839","display_name":"Technische Universit\u00e4t Wien","ror":"https://ror.org/04d836q62"},{"id":"https://openalex.org/F4320335937","display_name":"Technische Universit\u00e4t Wien Bibliothek","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7128300256.pdf","grobid_xml":"https://content.openalex.org/works/W7128300256.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1596218290","https://openalex.org/W1600949489","https://openalex.org/W1643794750","https://openalex.org/W2014945905","https://openalex.org/W2023749136","https://openalex.org/W2024491681","https://openalex.org/W2027210027","https://openalex.org/W2047742824","https://openalex.org/W2050701304","https://openalex.org/W2064854394","https://openalex.org/W2077946037","https://openalex.org/W2091774190","https://openalex.org/W2103333868","https://openalex.org/W2103991913","https://openalex.org/W2114148987","https://openalex.org/W2123192541","https://openalex.org/W2145803764","https://openalex.org/W2157884850","https://openalex.org/W2170746407","https://openalex.org/W2496778025","https://openalex.org/W2763373928","https://openalex.org/W2963972000","https://openalex.org/W3015086194","https://openalex.org/W3089802901","https://openalex.org/W3103000343","https://openalex.org/W3207982345","https://openalex.org/W3210690626"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Tanglegrams":[1],"are":[2,19],"drawings":[3],"of":[4,37,41,49,53,61,73,90,94,115,118],"two":[5,33,59],"rooted":[6],"binary":[7],"phylogenetic":[8],"trees":[9,18],"and":[10,105],"a":[11,87,106],"matching":[12],"between":[13],"their":[14,26],"leaf":[15,27],"sets.":[16],"The":[17],"drawn":[20],"crossing-free":[21],"on":[22,32],"opposite":[23],"sides":[24],"with":[25,109],"sets":[28],"facing":[29],"each":[30,64],"other":[31,65],"vertical":[34],"lines.":[35],"Instead":[36],"minimizing":[38,50,95],"the":[39,47,51,71,74,91,110,113,119],"number":[40,52,114],"pairwise":[42],"edge":[43],"crossings,":[44],"we":[45],"consider":[46],"problem":[48],"block":[54,96,116],"crossings":[55,97,117],",":[56],"that":[57],"is,":[58],"bundles":[60],"edges":[62],"crossing":[63],"locally.":[66],"With":[67],"one":[68],"tree":[69,76,83],"fixed,":[70],"leaves":[72],"second":[75],"can":[77],"be":[78],"permuted":[79],"according":[80],"to":[81],"its":[82],"structure.":[84],"We":[85,122],"give":[86],"complete":[88],"picture":[89],"algorithmic":[92],"complexity":[93],"in":[98],"one-sided":[99],"tanglegrams":[100],"by":[101],"showing":[102],"-completeness,":[103],"2.25-approximations,":[104],"fixed-parameter":[107],"algorithm":[108],"parameter":[111],"being":[112],"computed":[120],"tanglegram.":[121],"also":[123],"state":[124],"results":[125],"for":[126],"non-binary":[127],"trees.":[128]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2026-02-08T00:00:00"}