{"id":"https://openalex.org/W2048322630","doi":"https://doi.org/10.1007/s00453-012-9695-6","title":"On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion","display_name":"On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion","publication_year":2012,"publication_date":"2012-10-11","ids":{"openalex":"https://openalex.org/W2048322630","doi":"https://doi.org/10.1007/s00453-012-9695-6","mag":"2048322630"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9695-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9695-6","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/A5045890144","display_name":"Nadja Betzler","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Nadja Betzler","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany","[TU- Berlin]"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"[TU- Berlin]","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","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":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands","Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077431744","display_name":"Robert Bredereck","orcid":"https://orcid.org/0000-0002-6303-6276"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Robert Bredereck","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany","[TU- Berlin]"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"[TU- Berlin]","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany","[TU- Berlin]"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"[TU- Berlin]","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023505790","display_name":"Johannes Uhlmann","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Johannes Uhlmann","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany","[TU- Berlin]"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"[TU- Berlin]","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5045890144"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3479,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.62481331,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"68","issue":"3","first_page":"715","last_page":"738"},"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.9976999759674072,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9650999903678894,"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/feedback-vertex-set","display_name":"Feedback vertex set","score":0.8555347323417664},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7954535484313965},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7347596883773804},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6576153039932251},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6532349586486816},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.6482251882553101},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6219620704650879},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5558812022209167},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.53014075756073},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.47849932312965393},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.4632061719894409},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45290854573249817},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4412462115287781},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43543022871017456},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3166799545288086},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2936137318611145},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09981182217597961}],"concepts":[{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.8555347323417664},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7954535484313965},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7347596883773804},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6576153039932251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6532349586486816},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.6482251882553101},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6219620704650879},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5558812022209167},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.53014075756073},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.47849932312965393},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.4632061719894409},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45290854573249817},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4412462115287781},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43543022871017456},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3166799545288086},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2936137318611145},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09981182217597961},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-012-9695-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9695-6","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:oai:pure.tue.nl:openaire_cris_publications/2147a53f-0950-46cd-a41b-e5fdccd7cd77","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2147a53f-0950-46cd-a41b-e5fdccd7cd77","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":"Betzler, N, Bodlaender, H L, Bredereck, R, Niedermeier, R & Uhlmann, J 2014, 'On making a distinguished vertex of minimum degree by vertex deletion', Algorithmica, vol. 68, no. 3, pp. 715-738. https://doi.org/10.1007/s00453-012-9695-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/2147a53f-0950-46cd-a41b-e5fdccd7cd77","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84897669208&partnerID=8YFLogxK","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Betzler, N, Bodlaender, H L, Bredereck, R, Niedermeier, R & Uhlmann, J 2014, 'On making a distinguished vertex of minimum degree by vertex deletion', Algorithmica, vol. 68, no. 3, pp. 715-738. https://doi.org/10.1007/s00453-012-9695-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/2147a53f-0950-46cd-a41b-e5fdccd7cd77","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/2147a53f-0950-46cd-a41b-e5fdccd7cd77","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, 68(3), 715 - 738. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W78721095","https://openalex.org/W127421644","https://openalex.org/W143512583","https://openalex.org/W950821216","https://openalex.org/W1511638527","https://openalex.org/W1517036688","https://openalex.org/W1527254034","https://openalex.org/W1544829330","https://openalex.org/W1570425181","https://openalex.org/W1606657688","https://openalex.org/W1974810008","https://openalex.org/W1976430052","https://openalex.org/W1990761146","https://openalex.org/W1992752571","https://openalex.org/W1998964055","https://openalex.org/W2011039300","https://openalex.org/W2015905456","https://openalex.org/W2017109153","https://openalex.org/W2024517697","https://openalex.org/W2043193111","https://openalex.org/W2050952499","https://openalex.org/W2059372025","https://openalex.org/W2061901927","https://openalex.org/W2077594988","https://openalex.org/W2081880478","https://openalex.org/W2083748805","https://openalex.org/W2087083200","https://openalex.org/W2107284348","https://openalex.org/W2112162387","https://openalex.org/W2124562173","https://openalex.org/W2125455032","https://openalex.org/W2139656371","https://openalex.org/W2169088933","https://openalex.org/W2490706771","https://openalex.org/W2561675875","https://openalex.org/W2913688336","https://openalex.org/W3101258912","https://openalex.org/W3122139608","https://openalex.org/W4213368513","https://openalex.org/W4249637581","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2043560626","https://openalex.org/W2168711306","https://openalex.org/W1597649928","https://openalex.org/W2077654620","https://openalex.org/W1604371039","https://openalex.org/W3038050706","https://openalex.org/W2024517697","https://openalex.org/W4301201996","https://openalex.org/W3002469317","https://openalex.org/W2293317078"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}