{"id":"https://openalex.org/W2045123275","doi":"https://doi.org/10.1137/09077638x","title":"Obnoxious Centers in Graphs","display_name":"Obnoxious Centers in Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2045123275","doi":"https://doi.org/10.1137/09077638x","mag":"2045123275"},"language":"en","primary_location":{"id":"doi:10.1137/09077638x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/09077638x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5034923438","display_name":"Sergio Cabello","orcid":"https://orcid.org/0000-0002-3183-4126"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sergio Cabello","raw_affiliation_strings":["sergio.cabello@fmf.uni-lj.si#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"sergio.cabello@fmf.uni-lj.si#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083387191","display_name":"G\u00fcnter Rote","orcid":"https://orcid.org/0000-0002-0351-5945"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G\u00fcnter Rote","raw_affiliation_strings":["rote@inf.fu-berlin.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"rote@inf.fu-berlin.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9539,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75948057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"4","first_page":"1713","last_page":"1730"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.8227514028549194},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8208757638931274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7901644706726074},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.7162992358207703},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6251306533813477},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6014173030853271},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5699571371078491},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.568168044090271},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5680912733078003},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5352815985679626},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5304462313652039},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4818324148654938},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.47259530425071716},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.291226863861084},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08109256625175476}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8227514028549194},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8208757638931274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7901644706726074},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.7162992358207703},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6251306533813477},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6014173030853271},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5699571371078491},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.568168044090271},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5680912733078003},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5352815985679626},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5304462313652039},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4818324148654938},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.47259530425071716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.291226863861084},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08109256625175476},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/09077638x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/09077638x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.185.1894","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.1894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.fu-berlin.de/%7Erote/Papers/pdf/Obnoxious%2Bcenters%2Bfor%2Bgraphs.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.324.458","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.fmf.uni-lj.si/~cabello/publications/cabello+rote+obnoxiouscenters.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.330.1947","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.1947","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.imfm.si/preprinti/PDF/01048.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.5925","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.5925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://page.inf.fu-berlin.de/~rote/Papers/postscript-gzipped/Obnoxious+centers+in+graphs.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1983456117","https://openalex.org/W1988013311","https://openalex.org/W1991657767","https://openalex.org/W2013382394","https://openalex.org/W2017492235","https://openalex.org/W2020868174","https://openalex.org/W2027029507","https://openalex.org/W2038643780","https://openalex.org/W2048362350","https://openalex.org/W2049413646","https://openalex.org/W2050340070","https://openalex.org/W2059372025","https://openalex.org/W2066453010","https://openalex.org/W2071362870","https://openalex.org/W2073623633","https://openalex.org/W2087083200","https://openalex.org/W2097004206","https://openalex.org/W2139594840","https://openalex.org/W2139919335","https://openalex.org/W2762935521","https://openalex.org/W2768149714"],"related_works":["https://openalex.org/W2029854525","https://openalex.org/W2012687409","https://openalex.org/W4312121942","https://openalex.org/W2766499403","https://openalex.org/W1554245510","https://openalex.org/W4362699105","https://openalex.org/W4287274161","https://openalex.org/W2066311716","https://openalex.org/W2045123275","https://openalex.org/W1978588354"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2],"problem":[3],"of":[4,62,73],"finding":[5],"obnoxious":[6],"centers":[7],"in":[8],"graphs.":[9,78],"For":[10,29,44],"arbitrary":[11],"graphs":[12,45,72],"with":[13,24,35,46],"n":[14],"vertices":[15],"and":[16,40,65,76],"m":[17],"edges,":[18],"we":[19,32,49],"give":[20,33,50],"a":[21],"randomized":[22],"algorithm":[23,52],"$O(n\\log^{2}n+m\\log":[25],"n)$":[26,37,55],"expected":[27,38],"time.":[28,43,57],"planar":[30,77],"graphs,":[31],"algorithms":[34,59],"$O(n\\log":[36,54],"time":[39],"$O(n\\log^{3}n)$":[41],"worst-case":[42,56],"bounded":[47,74],"treewidth,":[48],"an":[51],"taking":[53],"The":[58],"make":[60],"use":[61],"parametric":[63],"search":[64],"several":[66],"results":[67],"for":[68],"computing":[69],"distances":[70],"on":[71],"treewidth":[75]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}