{"id":"https://openalex.org/W2799037470","doi":"https://doi.org/10.1007/s00453-014-9870-z","title":"Max-Cut Parameterized Above the Edwards-Erd\u0151s Bound","display_name":"Max-Cut Parameterized Above the Edwards-Erd\u0151s Bound","publication_year":2014,"publication_date":"2014-01-23","ids":{"openalex":"https://openalex.org/W2799037470","doi":"https://doi.org/10.1007/s00453-014-9870-z","mag":"2799037470"},"language":"hu","primary_location":{"id":"doi:10.1007/s00453-014-9870-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9870-z","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5006255622","display_name":"Robert Crowston","orcid":null},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Robert Crowston","raw_affiliation_strings":["Department of Computer Science, Royal Holloway, Egham, Surrey, TW20 0EX, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway, Egham, Surrey, TW20 0EX, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091128796","display_name":"Mark Jones","orcid":"https://orcid.org/0000-0002-4091-7089"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark Jones","raw_affiliation_strings":["Department of Computer Science, Royal Holloway, Egham, Surrey, TW20 0EX, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway, Egham, Surrey, TW20 0EX, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"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/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Matthias Mnich","raw_affiliation_strings":["Cluster of Excellence MMCI, Campus E1-7, 66123, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Cluster of Excellence MMCI, Campus E1-7, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053266341"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.94,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.91647773,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"72","issue":"3","first_page":"734","last_page":"757"},"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.9986000061035156,"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.9968000054359436,"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.9155253767967224},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7955349683761597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7805325984954834},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.6787933111190796},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5864042043685913},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5579506754875183},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5534515380859375},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5441684126853943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5029911398887634},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45399507880210876},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43050575256347656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15670812129974365}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9155253767967224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7955349683761597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7805325984954834},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.6787933111190796},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5864042043685913},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5579506754875183},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5534515380859375},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5441684126853943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5029911398887634},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45399507880210876},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43050575256347656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15670812129974365},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-014-9870-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9870-z","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:um:oai:cris.maastrichtuniversity.nl:publications/d581f9d2-7f13-45cb-a701-933d9bcce0d1","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/d581f9d2-7f13-45cb-a701-933d9bcce0d1","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":"Algorithmica, 72(3), 734 - 757. Springer Verlag","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W92894981","https://openalex.org/W96881573","https://openalex.org/W155769578","https://openalex.org/W1538767552","https://openalex.org/W1548765768","https://openalex.org/W1554986726","https://openalex.org/W1570425181","https://openalex.org/W1591762700","https://openalex.org/W1969189142","https://openalex.org/W1985572324","https://openalex.org/W1990108069","https://openalex.org/W1996811231","https://openalex.org/W1999270628","https://openalex.org/W2002055996","https://openalex.org/W2002958365","https://openalex.org/W2008444606","https://openalex.org/W2027999353","https://openalex.org/W2033447978","https://openalex.org/W2038562737","https://openalex.org/W2041910029","https://openalex.org/W2087066564","https://openalex.org/W2097277086","https://openalex.org/W2100048208","https://openalex.org/W2107284348","https://openalex.org/W2114720692","https://openalex.org/W2121641644","https://openalex.org/W2167681887","https://openalex.org/W2183312547","https://openalex.org/W2312821511","https://openalex.org/W2401610261","https://openalex.org/W2570457167","https://openalex.org/W2789958406","https://openalex.org/W2798588639","https://openalex.org/W2913688336","https://openalex.org/W2963264341","https://openalex.org/W2964120731","https://openalex.org/W3149604617","https://openalex.org/W4213311856","https://openalex.org/W4238018361","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1986447712","https://openalex.org/W2110193191","https://openalex.org/W4389156785","https://openalex.org/W2087638517","https://openalex.org/W2113885662","https://openalex.org/W2800485060","https://openalex.org/W2492498253","https://openalex.org/W2953073202","https://openalex.org/W1759995226","https://openalex.org/W3135299686"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}