{"id":"https://openalex.org/W2766740319","doi":"https://doi.org/10.1007/s00453-017-0388-z","title":"Linear Kernels and Linear-Time Algorithms for Finding Large Cuts","display_name":"Linear Kernels and Linear-Time Algorithms for Finding Large Cuts","publication_year":2017,"publication_date":"2017-10-25","ids":{"openalex":"https://openalex.org/W2766740319","doi":"https://doi.org/10.1007/s00453-017-0388-z","mag":"2766740319"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-017-0388-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0388-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-017-0388-z.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-017-0388-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053313826","display_name":"Michael Etscheid","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Etscheid","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053266341","display_name":"Matthias Mnich","orcid":"https://orcid.org/0000-0002-4721-5354"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]},{"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":["DE","NL"],"is_corresponding":false,"raw_author_name":"Matthias Mnich","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","Institut f\u00fcr Informatik, Universit\u00e4t Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053313826"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.6591,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86023645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"80","issue":"9","first_page":"2574","last_page":"2615"},"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.9987000226974487,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9977999925613403,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.867480993270874},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6852509379386902},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6625873446464539},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6448473930358887},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5088613033294678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49965429306030273},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.49178770184516907},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46408674120903015},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4327484965324402},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42768335342407227},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41622278094291687}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.867480993270874},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6852509379386902},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6625873446464539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6448473930358887},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5088613033294678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49965429306030273},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.49178770184516907},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46408674120903015},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4327484965324402},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42768335342407227},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41622278094291687},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-017-0388-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0388-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-017-0388-z.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/adb2fa5f-1241-43bc-bc3e-1c412dc659e6","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/adb2fa5f-1241-43bc-bc3e-1c412dc659e6","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Etscheid, M & Mnich, M 2018, 'Linear Kernels and Linear-Time Algorithms for Finding Large Cuts', Algorithmica, vol. 80, no. 9, pp. 2574-2615. https://doi.org/10.1007/s00453-017-0388-z","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:null:11420/4611","is_oa":true,"landing_page_url":"http://hdl.handle.net/11420/4611","pdf_url":null,"source":{"id":"https://openalex.org/S4306401751","display_name":"tub.dok (Hamburg University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I884043246","host_organization_name":"Hamburg University of Technology","host_organization_lineage":["https://openalex.org/I884043246"],"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":"","raw_type":"Conference Paper"},{"id":"pmh:oai:null:11420/4693","is_oa":true,"landing_page_url":"http://hdl.handle.net/11420/4693","pdf_url":null,"source":{"id":"https://openalex.org/S4306401751","display_name":"tub.dok (Hamburg University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I884043246","host_organization_name":"Hamburg University of Technology","host_organization_lineage":["https://openalex.org/I884043246"],"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":"","raw_type":"Journal Article"},{"id":"doi:10.15480/882.2617","is_oa":true,"landing_page_url":"https://doi.org/10.15480/882.2617","pdf_url":null,"source":{"id":"https://openalex.org/S7407052987","display_name":"TUHH Open Research","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"doi:10.15480/882.2624","is_oa":true,"landing_page_url":"https://doi.org/10.15480/882.2624","pdf_url":null,"source":{"id":"https://openalex.org/S7407052987","display_name":"TUHH Open Research","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1007/s00453-017-0388-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0388-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-017-0388-z.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3696254083","display_name":null,"funder_award_id":"306465","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2766740319.pdf"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W96881573","https://openalex.org/W1512232443","https://openalex.org/W1554986726","https://openalex.org/W1668487681","https://openalex.org/W1878224396","https://openalex.org/W1980769375","https://openalex.org/W1992976178","https://openalex.org/W1995725694","https://openalex.org/W1996672997","https://openalex.org/W1996811231","https://openalex.org/W1999270628","https://openalex.org/W2008444606","https://openalex.org/W2008881234","https://openalex.org/W2013520638","https://openalex.org/W2020545181","https://openalex.org/W2030737920","https://openalex.org/W2038562737","https://openalex.org/W2053050060","https://openalex.org/W2071629762","https://openalex.org/W2083759184","https://openalex.org/W2087066564","https://openalex.org/W2091022743","https://openalex.org/W2135419229","https://openalex.org/W2161806016","https://openalex.org/W2186158012","https://openalex.org/W2289413225","https://openalex.org/W2397439386","https://openalex.org/W2401610261","https://openalex.org/W2570081448","https://openalex.org/W2576432037","https://openalex.org/W2799037470","https://openalex.org/W2963264341","https://openalex.org/W2963759319","https://openalex.org/W3137355438","https://openalex.org/W4238018361","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W41549461","https://openalex.org/W2767174160","https://openalex.org/W1986447712","https://openalex.org/W4297689169","https://openalex.org/W2110193191","https://openalex.org/W2295534309","https://openalex.org/W2953291322","https://openalex.org/W4286853492"],"abstract_inverted_index":{"The":[0],"maximum":[1],"cut":[2,16],"problem":[3],"in":[4,67],"graphs":[5],"and":[6,25,40,54],"its":[7],"generalizations":[8],"are":[9],"fundamental":[10],"combinatorial":[11],"problems.":[12],"Several":[13],"of":[14,42,52,58],"these":[15],"problems":[17],"were":[18],"recently":[19],"shown":[20],"to":[21],"be":[22,65],"fixed-parameter":[23],"tractable":[24],"admit":[26],"polynomial":[27],"kernels":[28,63],"when":[29],"parameterized":[30],"above":[31],"the":[32,38,43],"tight":[33],"lower":[34],"bound":[35],"measured":[36],"by":[37],"size":[39],"order":[41],"graph.":[44],"In":[45],"this":[46,50],"paper":[47],"we":[48],"continue":[49],"line":[51],"research":[53],"considerably":[55],"improve":[56],"several":[57],"those":[59],"results:":[60],"All":[61],"presented":[62],"can":[64],"computed":[66],"time":[68],"O(km).":[69]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}