{"id":"https://openalex.org/W2066130346","doi":"https://doi.org/10.1007/s11786-009-0011-z","title":"Partitioning Bispanning Graphs into Spanning Trees","display_name":"Partitioning Bispanning Graphs into Spanning Trees","publication_year":2009,"publication_date":"2009-11-27","ids":{"openalex":"https://openalex.org/W2066130346","doi":"https://doi.org/10.1007/s11786-009-0011-z","mag":"2066130346"},"language":"en","primary_location":{"id":"doi:10.1007/s11786-009-0011-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11786-009-0011-z","pdf_url":null,"source":{"id":"https://openalex.org/S136038430","display_name":"Mathematics in Computer Science","issn_l":"1661-8270","issn":["1661-8270","1661-8289"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics in Computer Science","raw_type":"journal-article"},"type":"article","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/A5053412311","display_name":"Matthias Baumgart","orcid":"https://orcid.org/0000-0002-0195-5234"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Matthias Baumgart","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, 85748, Garching bei M\u00fcnchen, Germany","[Technische Universit\u00e4t, M\u00fcnchen]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, 85748, Garching bei M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"[Technische Universit\u00e4t, M\u00fcnchen]","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053412311"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12877709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":"1","first_page":"3","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8834995031356812},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.856795072555542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7617602348327637},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6928808689117432},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4976959526538849},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.49489468336105347},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4838394224643707},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4552026391029358}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8834995031356812},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.856795072555542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7617602348327637},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6928808689117432},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4976959526538849},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.49489468336105347},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4838394224643707},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4552026391029358},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11786-009-0011-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11786-009-0011-z","pdf_url":null,"source":{"id":"https://openalex.org/S136038430","display_name":"Mathematics in Computer Science","issn_l":"1661-8270","issn":["1661-8270","1661-8289"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics in Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1975659026","https://openalex.org/W1990620352","https://openalex.org/W2017927472","https://openalex.org/W2042401648","https://openalex.org/W2069230977","https://openalex.org/W2074250264","https://openalex.org/W2118947995","https://openalex.org/W2171463055","https://openalex.org/W2340149117","https://openalex.org/W2404320054","https://openalex.org/W4255905723"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}