{"id":"https://openalex.org/W2100048208","doi":"https://doi.org/10.1007/978-3-642-31594-7_21","title":"Max-Cut Parameterized above the Edwards-Erd\u0151s Bound","display_name":"Max-Cut Parameterized above the Edwards-Erd\u0151s Bound","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2100048208","doi":"https://doi.org/10.1007/978-3-642-31594-7_21","mag":"2100048208"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-31594-7_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-31594-7_21","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":"book-chapter","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":true,"raw_author_name":"Robert Crowston","raw_affiliation_strings":["Royal Holloway, University of London, UK","Royal Holloway University of London, UK"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, UK","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"Royal Holloway University of London, 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":["Royal Holloway, University of London, UK","Royal Holloway University of London, UK"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, UK","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"Royal Holloway University of London, 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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthias Mnich","raw_affiliation_strings":["Cluster of Excellence, Saarbr\u00fccken, Germany","Cluster of Excellence, Saarbr\u00fccken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Cluster of Excellence, Saarbr\u00fccken, Germany","institution_ids":[]},{"raw_affiliation_string":"Cluster of Excellence, Saarbr\u00fccken, Germany#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006255622"],"corresponding_institution_ids":["https://openalex.org/I184558857"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.0,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.96095403,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"242","last_page":"253"},"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.9987999796867371,"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.9937999844551086,"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.8956826329231262},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7463769912719727},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5986390113830566},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5872877240180969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5628340840339661},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.516997218132019},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49000898003578186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4724205732345581},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4719592332839966},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4507390260696411},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21152576804161072},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.056324124336242676}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8956826329231262},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7463769912719727},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5986390113830566},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5872877240180969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5628340840339661},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.516997218132019},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49000898003578186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4724205732345581},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4719592332839966},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4507390260696411},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21152576804161072},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.056324124336242676}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/978-3-642-31594-7_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-31594-7_21","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:cris.maastrichtuniversity.nl:openaire_cris_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/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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Crowston , R , Jones , M & Mnich , M 2015 , ' Max-Cut parameterized above the Edwards-Erd\u0151s bound ' , Algorithmica , vol. 72 , no. 3 , pp. 734-757 . https://doi.org/10.1007/s00453-014-9870-z","raw_type":"article"},{"id":"pmh:oai:escidoc.org:escidoc:2076267","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0024-4683-2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:tore.tuhh.de:11420/4054","is_oa":false,"landing_page_url":"http://hdl.handle.net/11420/4054","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:tore.tuhh.de:11420/4554","is_oa":false,"landing_page_url":"http://hdl.handle.net/11420/4554","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:um:oai:cris.maastrichtuniversity.nl:publications/12ce6050-3ac4-40e7-b97c-5a703452dc29","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/12ce6050-3ac4-40e7-b97c-5a703452dc29","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":"Automata, Languages and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, July 2012, Proceedings, Part I, 242 - 253","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W96881573","https://openalex.org/W1538767552","https://openalex.org/W1548765768","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/W2002958365","https://openalex.org/W2008444606","https://openalex.org/W2027999353","https://openalex.org/W2033447978","https://openalex.org/W2038562737","https://openalex.org/W2097277086","https://openalex.org/W2107284348","https://openalex.org/W2167681887","https://openalex.org/W2182211929","https://openalex.org/W2183312547","https://openalex.org/W2312821511","https://openalex.org/W2401610261","https://openalex.org/W2913688336","https://openalex.org/W2964120731","https://openalex.org/W4238018361","https://openalex.org/W4246647751","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W4399522433","https://openalex.org/W2803460775","https://openalex.org/W4389156785","https://openalex.org/W2492498253","https://openalex.org/W2087638517","https://openalex.org/W2113885662","https://openalex.org/W4214889528","https://openalex.org/W2800485060","https://openalex.org/W1777044164","https://openalex.org/W4298060463"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}