{"id":"https://openalex.org/W1970202342","doi":"https://doi.org/10.1016/0166-218x(93)90090-b","title":"Efficient labelling algorithms for the maximum noncrossing matching problem","display_name":"Efficient labelling algorithms for the maximum noncrossing matching problem","publication_year":1993,"publication_date":"1993-11-01","ids":{"openalex":"https://openalex.org/W1970202342","doi":"https://doi.org/10.1016/0166-218x(93)90090-b","mag":"1970202342"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(93)90090-b","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(93)90090-b","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/585407","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069804919","display_name":"Federico Malucelli","orcid":"https://orcid.org/0000-0003-0034-1721"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Federico Malucelli","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, 56125 Pisa, Italy","Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, 56125 Pisa, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, 56125 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, 56125 Pisa, Italy#TAB#","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113581859","display_name":"Thomas Ottmann","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Ottmann","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, Rheinstr. 10\u201312, D-78000 Freiburg i. Br., Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, Rheinstr. 10\u201312, D-78000 Freiburg i. Br., Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070031423","display_name":"Daniele Pretolani","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniele Pretolani","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, 56125 Pisa, Italy","Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, 56125 Pisa, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, 56125 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, 56125 Pisa, Italy#TAB#","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069804919"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.08851943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"47","issue":"2","first_page":"175","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9954000115394592,"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.9954000115394592,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9952999949455261,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8372751474380493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.755037248134613},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7274219393730164},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6531616449356079},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5974379181861877},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5715433359146118},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4979133605957031},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4362519085407257},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4348636865615845},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3376370072364807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17188507318496704},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.05928319692611694}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8372751474380493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.755037248134613},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7274219393730164},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6531616449356079},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5974379181861877},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5715433359146118},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4979133605957031},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4362519085407257},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4348636865615845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3376370072364807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17188507318496704},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.05928319692611694},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0166-218x(93)90090-b","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(93)90090-b","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:iris.unimore.it:11380/585407","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/585407","pdf_url":null,"source":{"id":"https://openalex.org/S4377196326","display_name":"Iris Unimore (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"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":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/585407","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/585407","pdf_url":null,"source":{"id":"https://openalex.org/S4377196326","display_name":"Iris Unimore (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"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":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2069893028","https://openalex.org/W2079935321","https://openalex.org/W2089439745","https://openalex.org/W2125690626","https://openalex.org/W2142753649","https://openalex.org/W2152506638"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W2950751300","https://openalex.org/W4301272096","https://openalex.org/W2953390393","https://openalex.org/W2804963084","https://openalex.org/W2362975861","https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W2371352078","https://openalex.org/W2054458431"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}