{"id":"https://openalex.org/W3000432478","doi":"https://doi.org/10.37236/1905","title":"The Edmonds-Gallai Decomposition for the $k$-Piece Packing Problem","display_name":"The Edmonds-Gallai Decomposition for the $k$-Piece Packing Problem","publication_year":2005,"publication_date":"2005-02-14","ids":{"openalex":"https://openalex.org/W3000432478","doi":"https://doi.org/10.37236/1905","mag":"3000432478"},"language":"en","primary_location":{"id":"doi:10.37236/1905","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1905","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r8/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r8/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069118928","display_name":"Marek Janata","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["CZ","HU"],"is_corresponding":true,"raw_author_name":"Marek Janata","raw_affiliation_strings":["Dept. of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranske n. 25, 118 00 Praha 1, Czech Republic","Dept. of Operations Research, E\u00f6tv\u00f6s University,","P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C, Budapest, Hungary H-1117"],"affiliations":[{"raw_affiliation_string":"Dept. of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranske n. 25, 118 00 Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Dept. of Operations Research, E\u00f6tv\u00f6s University,","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C, Budapest, Hungary H-1117","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038875605","display_name":"Martin Loebl","orcid":"https://orcid.org/0000-0001-7968-0376"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]},{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ","HU"],"is_corresponding":false,"raw_author_name":"Martin Loebl","raw_affiliation_strings":["Dept. of Operations Research, E\u00f6tv\u00f6s University,","Dept. of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranske n. 25, 118 00 Praha 1, Czech Republic","P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C, Budapest, Hungary H-1117"],"affiliations":[{"raw_affiliation_string":"Dept. of Operations Research, E\u00f6tv\u00f6s University,","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"Dept. of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranske n. 25, 118 00 Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C, Budapest, Hungary H-1117","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109584874","display_name":"J\u00e1cint Szab\u00f3","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["CZ","HU"],"is_corresponding":false,"raw_author_name":"J\u00e1cint Szab\u00f3","raw_affiliation_strings":["Dept. of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranske n. 25, 118 00 Praha 1, Czech Republic","Dept. of Operations Research, E\u00f6tv\u00f6s University,","P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C, Budapest, Hungary H-1117"],"affiliations":[{"raw_affiliation_string":"Dept. of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranske n. 25, 118 00 Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Dept. of Operations Research, E\u00f6tv\u00f6s University,","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1/C, Budapest, Hungary H-1117","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069118928"],"corresponding_institution_ids":["https://openalex.org/I106118109","https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":1.3467,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83228532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9984999895095825,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9855999946594238,"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/combinatorics","display_name":"Combinatorics","score":0.8431575894355774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7822471857070923},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.6059707403182983},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5435202121734619},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5024597644805908},{"id":"https://openalex.org/keywords/decomposition-theorem","display_name":"Decomposition theorem","score":0.4806765019893646},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.47286128997802734},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4675772488117218},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4349665641784668},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43305426836013794},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41694942116737366},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3740917444229126},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.08211097121238708}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8431575894355774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7822471857070923},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.6059707403182983},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5435202121734619},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5024597644805908},{"id":"https://openalex.org/C2779182943","wikidata":"https://www.wikidata.org/wiki/Q25345219","display_name":"Decomposition theorem","level":2,"score":0.4806765019893646},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.47286128997802734},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4675772488117218},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4349665641784668},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43305426836013794},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41694942116737366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3740917444229126},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.08211097121238708},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/1905","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1905","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r8/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.6258","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.6258","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/EJC/Volume_12/PDF/v12i1r8.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1905","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1905","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r8/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1336546750","display_name":null,"funder_award_id":"504438","funder_id":"https://openalex.org/F4320322192","funder_display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia"},{"id":"https://openalex.org/G6585766704","display_name":null,"funder_award_id":"504438","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"}],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320322192","display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","ror":"https://ror.org/02ks8qq67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3000432478.pdf","grobid_xml":"https://content.openalex.org/works/W3000432478.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W140130170","https://openalex.org/W1963596676","https://openalex.org/W2020723104","https://openalex.org/W2037953913","https://openalex.org/W2038558760","https://openalex.org/W2053711501","https://openalex.org/W2067665587","https://openalex.org/W2086077818","https://openalex.org/W2092664455","https://openalex.org/W4205827141"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2077383796","https://openalex.org/W2016058626","https://openalex.org/W2953461625","https://openalex.org/W2474724840","https://openalex.org/W2895916002","https://openalex.org/W2080136900","https://openalex.org/W2950628401","https://openalex.org/W1981479258","https://openalex.org/W103840660"],"abstract_inverted_index":{"Generalizing":[0],"Kaneko's":[1],"long":[2],"path":[3],"packing":[4,17,22,63],"problem,":[5,18],"Hartvigsen,":[6],"Hell":[7],"and":[8,55],"Szab\u00f3":[9],"consider":[10],"a":[11,27,49,52,56,84,98],"new":[12],"type":[13,74],"of":[14,71],"undirected":[15],"graph":[16,30],"called":[19],"the":[20,38,43,61,69,90],"$k$-piece":[21,25,62,95],"problem.":[23,46,64],"A":[24],"is":[26],"simple,":[28],"connected":[29],"with":[31],"highest":[32],"degree":[33],"exactly":[34],"$k$":[35],"so":[36],"in":[37],"case":[39],"$k=1$":[40],"we":[41],"get":[42],"classical":[44],"matching":[45],"They":[47],"give":[48],"polynomial":[50],"algorithm,":[51],"Tutte-type":[53],"characterization":[54],"Berge-type":[57],"minimax":[58],"formula":[59],"for":[60],"However,":[65],"they":[66],"leave":[67],"open":[68],"question":[70],"an":[72],"Edmonds-Gallai":[73],"decomposition.":[75,85],"This":[76],"paper":[77],"fills":[78],"this":[79],"gap":[80],"by":[81,94],"describing":[82],"such":[83],"We":[86],"also":[87],"prove":[88],"that":[89],"vertex":[91],"sets":[92],"coverable":[93],"packings":[96],"have":[97],"certain":[99],"matroidal":[100],"structure.":[101]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}