{"id":"https://openalex.org/W1522811074","doi":"https://doi.org/10.1007/3-540-45066-1_13","title":"Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems","display_name":"Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1522811074","doi":"https://doi.org/10.1007/3-540-45066-1_13","mag":"1522811074"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45066-1_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45066-1_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033523950","display_name":"Fr\u00e9d\u00e9ric Gardi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115196","display_name":"Laboratoire d\u2019Informatique Fondamentale de Marseille","ror":"https://ror.org/022my8t07","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I21491767","https://openalex.org/I4210115196","https://openalex.org/I4210142724","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Fr\u00e9d\u00e9ric Gardi","raw_affiliation_strings":["Laboratoire d\u2019Informatique Fondamentale, Parc Scientifique et Technologique de Luminy, Case 901 - 163, Avenue de Luminy, 13288, Marseille Cedex 9, France","Laboratoire d'Informatique Fondamentale, Parc Scientifique et Technologique de Luminy, Case 901 - 163, Avenue de Luminy, 13288, Marseille Cedex 9, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Fondamentale, Parc Scientifique et Technologique de Luminy, Case 901 - 163, Avenue de Luminy, 13288, Marseille Cedex 9, France","institution_ids":["https://openalex.org/I4210115196"]},{"raw_affiliation_string":"Laboratoire d'Informatique Fondamentale, Parc Scientifique et Technologique de Luminy, Case 901 - 163, Avenue de Luminy, 13288, Marseille Cedex 9, France","institution_ids":["https://openalex.org/I4210115196"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033523950"],"corresponding_institution_ids":["https://openalex.org/I4210115196"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3539,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60547604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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.9980999827384949,"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/T12288","display_name":"Optimization and Search Problems","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9927999973297119,"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/disjoint-sets","display_name":"Disjoint sets","score":0.949369490146637},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7366116046905518},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6543543934822083},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5779397487640381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5344950556755066},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5216758251190186},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.519721269607544},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5161001086235046},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46901220083236694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38276559114456177},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3355996012687683},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33033111691474915},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05810123682022095}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.949369490146637},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7366116046905518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6543543934822083},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5779397487640381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5344950556755066},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5216758251190186},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.519721269607544},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5161001086235046},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46901220083236694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38276559114456177},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3355996012687683},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33033111691474915},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05810123682022095},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-45066-1_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45066-1_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.95.6274","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.6274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pageperso.lif.univ-mrs.fr/~frederic.gardi/downloads/Gardi_DMTCS_03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1513353427","https://openalex.org/W1983148611","https://openalex.org/W1988081733","https://openalex.org/W1996028864","https://openalex.org/W2003813631","https://openalex.org/W2008908074","https://openalex.org/W2011039300","https://openalex.org/W2015475193","https://openalex.org/W2028503265","https://openalex.org/W2031966632","https://openalex.org/W2036194085","https://openalex.org/W2043765170","https://openalex.org/W2049181186","https://openalex.org/W2049520215","https://openalex.org/W2068928748","https://openalex.org/W2120490947","https://openalex.org/W2143474538","https://openalex.org/W2161426837","https://openalex.org/W2327315803","https://openalex.org/W2484473493","https://openalex.org/W4256113130","https://openalex.org/W6680812728"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843","https://openalex.org/W1581805909"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}