{"id":"https://openalex.org/W2113292309","doi":"https://doi.org/10.1007/3-540-57785-8_189","title":"On the complexity of the maximum cut problem","display_name":"On the complexity of the maximum cut problem","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2113292309","doi":"https://doi.org/10.1007/3-540-57785-8_189","mag":"2113292309"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-57785-8_189","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57785-8_189","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":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl:8080/handle/1874/2304","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Computer Science, Utrecht University, TB Utrecht, The Netherlands","Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]},{"id":"https://openalex.org/I62318514","display_name":"University of Duisburg-Essen","ror":"https://ror.org/04mz5ra38","country_code":"DE","type":"education","lineage":["https://openalex.org/I62318514"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Fachbereich 11 - Mathematik, FG Informatik, Universit\u00e4t Duisburg, Duisburg, Germany","Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstr. 40, 24098 Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich 11 - Mathematik, FG Informatik, Universit\u00e4t Duisburg, Duisburg, Germany","institution_ids":["https://openalex.org/I62318514"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Olshausenstr. 40, 24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032730524"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.23228143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"769","last_page":"780"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10829","display_name":"Interconnection Networks and Systems","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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955999851226807,"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/chordal-graph","display_name":"Chordal graph","score":0.8464380502700806},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7724237442016602},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7452948093414307},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.7242732048034668},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.695850133895874},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.6104820370674133},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5976124405860901},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5938188433647156},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.5747889280319214},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5713693499565125},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5562503337860107},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5318818688392639},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46971574425697327},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.46357327699661255},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.42956656217575073},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2649628520011902},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11227783560752869}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8464380502700806},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7724237442016602},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7452948093414307},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.7242732048034668},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.695850133895874},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.6104820370674133},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5976124405860901},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5938188433647156},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.5747889280319214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5713693499565125},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5562503337860107},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5318818688392639},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46971574425697327},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.46357327699661255},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.42956656217575073},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2649628520011902},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11227783560752869}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/3-540-57785-8_189","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57785-8_189","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:hdl:10068/178143","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/178143","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"I - Miscellaneous"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.8900","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.8900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1991/1991-39.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.25.9058","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-kiel.de/inf/Jansen/kj/stacs94_J.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.924.119","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.924.119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.library.uu.nl/bitstream/handle/1874/2304/1991-39.pdf%3Bjsessionid%3DF965D76BD388BC7638ABC91DE5523972?sequence%3D2","raw_type":"text"},{"id":"pmh:oai:dspace.library.uu.nl:1874/2304","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl:8080/handle/1874/2304","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Preprint"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/17964","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/17964","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/2304","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/2304","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/preprint"}],"best_oa_location":{"id":"pmh:oai:dspace.library.uu.nl:1874/2304","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl:8080/handle/1874/2304","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1492169292","https://openalex.org/W1563351955","https://openalex.org/W2011039300","https://openalex.org/W2015906942","https://openalex.org/W2029448190","https://openalex.org/W2030087828","https://openalex.org/W2034501206","https://openalex.org/W2035344492","https://openalex.org/W2038225707","https://openalex.org/W2056697294","https://openalex.org/W2080905757","https://openalex.org/W2088330156","https://openalex.org/W2094671757","https://openalex.org/W2112631288","https://openalex.org/W2141923701","https://openalex.org/W2148043549","https://openalex.org/W2159003936","https://openalex.org/W2160875590","https://openalex.org/W2401610261","https://openalex.org/W4232336108","https://openalex.org/W4361867857"],"related_works":["https://openalex.org/W4287179103","https://openalex.org/W2955095032","https://openalex.org/W4288294436","https://openalex.org/W1770696880","https://openalex.org/W2103512591","https://openalex.org/W2031276298","https://openalex.org/W2113292309","https://openalex.org/W1986908827","https://openalex.org/W3130332934","https://openalex.org/W2093949146"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}