{"id":"https://openalex.org/W1753901987","doi":"https://doi.org/10.1007/978-3-642-20877-5_20","title":"How to Cut a Graph into Many Pieces","display_name":"How to Cut a Graph into Many Pieces","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1753901987","doi":"https://doi.org/10.1007/978-3-642-20877-5_20","mag":"1753901987"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-20877-5_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20877-5_20","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":"conference-paper","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/A5041229131","display_name":"Ruben van der Zwaan","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ruben van der Zwaan","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","Dept. of Quantitative Economics, Maastricht University Maastricht, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Dept. of Quantitative Economics, Maastricht University Maastricht, the Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075001728","display_name":"Andr\u00e9 Berger","orcid":"https://orcid.org/0000-0002-6409-1963"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Berger","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","Dept. of Quantitative Economics, Maastricht University Maastricht, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Dept. of Quantitative Economics, Maastricht University Maastricht, the Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052039079","display_name":"Alexander Grigoriev","orcid":"https://orcid.org/0000-0002-8391-235X"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alexander Grigoriev","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","Dept. of Quantitative Economics, Maastricht University Maastricht, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Dept. of Quantitative Economics, Maastricht University Maastricht, the Netherlands","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I34352273"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"184","last_page":"194"},"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.9997000098228455,"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.996999979019165,"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/treewidth","display_name":"Treewidth","score":0.8055181503295898},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6624209880828857},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6537230014801025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.605375349521637},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5880431532859802},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5609921813011169},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5434910655021667},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5265436768531799},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5181794762611389},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.5104195475578308},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.49731162190437317},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.46988654136657715},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.44232478737831116},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4264795184135437},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4164392352104187},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4109504222869873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3674846291542053},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.26419633626937866}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8055181503295898},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6624209880828857},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6537230014801025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.605375349521637},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5880431532859802},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5609921813011169},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5434910655021667},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5265436768531799},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5181794762611389},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.5104195475578308},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.49731162190437317},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.46988654136657715},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.44232478737831116},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4264795184135437},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4164392352104187},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4109504222869873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3674846291542053},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.26419633626937866},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-20877-5_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20877-5_20","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:pure.tue.nl:openaire_cris_publications/e60fffba-4669-4b10-a245-d356474a1b60","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e60fffba-4669-4b10-a245-d356474a1b60","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zwaan, van der, G R J, Berger, A & Grigoriev, A 2011, How to cut a graph into many pieces. in M Ogihara & J Tarui (eds), Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Lecture Notes in Computer Science, vol. 6648, Springer, Berlin, pp. 184-194. https://doi.org/10.1007/978-3-642-20877-5_20","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/e60fffba-4669-4b10-a245-d356474a1b60","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/e60fffba-4669-4b10-a245-d356474a1b60","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings, 184 - 194","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W1539191226","https://openalex.org/W1598407864","https://openalex.org/W1987374783","https://openalex.org/W2005309613","https://openalex.org/W2010004564","https://openalex.org/W2011039300","https://openalex.org/W2019062750","https://openalex.org/W2024491681","https://openalex.org/W2027048490","https://openalex.org/W2038225707","https://openalex.org/W2039375254","https://openalex.org/W2050285203","https://openalex.org/W2059372025","https://openalex.org/W2077571023","https://openalex.org/W2081846387","https://openalex.org/W2086565575","https://openalex.org/W2086937160","https://openalex.org/W2087083200","https://openalex.org/W2091602684","https://openalex.org/W2097499563","https://openalex.org/W2106515361","https://openalex.org/W2121641644","https://openalex.org/W2122270705","https://openalex.org/W2122466336","https://openalex.org/W2152986618","https://openalex.org/W2153724959","https://openalex.org/W2156760067","https://openalex.org/W2610183793","https://openalex.org/W3009415557","https://openalex.org/W4213368513","https://openalex.org/W4285719527","https://openalex.org/W4385397173"],"related_works":["https://openalex.org/W2607123191","https://openalex.org/W2029854525","https://openalex.org/W4286287454","https://openalex.org/W2497554862","https://openalex.org/W4293002939","https://openalex.org/W2599254863","https://openalex.org/W2949556766","https://openalex.org/W4300330793","https://openalex.org/W1976806052","https://openalex.org/W2154914679"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2016-06-24T00:00:00"}