{"id":"https://openalex.org/W2901238302","doi":"https://doi.org/10.1007/978-3-030-04651-4_15","title":"Removing Undesirable Flows by Edge Deletion","display_name":"Removing Undesirable Flows by Edge Deletion","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2901238302","doi":"https://doi.org/10.1007/978-3-030-04651-4_15","mag":"2901238302"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-04651-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_15","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://handle.uba.uva.nl/personal/pure/en/publications/removing-undesirable-flows-by-edge-deletion(f507a791-4db5-4e65-b5b2-8afd57ab4d2e).html","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013433800","display_name":"Gleb Polevoy","orcid":"https://orcid.org/0000-0002-5260-7811"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Gleb Polevoy","raw_affiliation_strings":["University of Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058846494","display_name":"Stojan Trajanovski","orcid":"https://orcid.org/0000-0003-0892-9263"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]},{"id":"https://openalex.org/I4210122849","display_name":"Philips (Netherlands)","ror":"https://ror.org/02p2bgp27","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210122849"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Stojan Trajanovski","raw_affiliation_strings":["Philips Research, Eindhoven, The Netherlands","University of Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Philips Research, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210122849"]},{"raw_affiliation_string":"University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007029875","display_name":"Paola Grosso","orcid":"https://orcid.org/0000-0003-4600-9812"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Paola Grosso","raw_affiliation_strings":["University of Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039787606","display_name":"Cees de Laat","orcid":"https://orcid.org/0009-0009-3025-2974"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Cees de Laat","raw_affiliation_strings":["University of Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5013433800"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.9896,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.79390844,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"217","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.9970999956130981,"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/computer-science","display_name":"Computer science","score":0.6629064083099365},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5891553163528442},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5815405249595642},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.564629077911377},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5096104145050049},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5085495710372925},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4950026869773865},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46885308623313904},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4647613763809204},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4592115879058838},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45103535056114197},{"id":"https://openalex.org/keywords/denial-of-service-attack","display_name":"Denial-of-service attack","score":0.43261879682540894},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.4234270751476288},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3529924750328064},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33182117342948914},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28541356325149536}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6629064083099365},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5891553163528442},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5815405249595642},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.564629077911377},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5096104145050049},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5085495710372925},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4950026869773865},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46885308623313904},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4647613763809204},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4592115879058838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45103535056114197},{"id":"https://openalex.org/C38822068","wikidata":"https://www.wikidata.org/wiki/Q131406","display_name":"Denial-of-service attack","level":3,"score":0.43261879682540894},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.4234270751476288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3529924750328064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33182117342948914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28541356325149536},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-030-04651-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_15","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:dare.uva.nl:openaire_cris_publications/f507a791-4db5-4e65-b5b2-8afd57ab4d2e","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/removing-undesirable-flows-by-edge-deletion(f507a791-4db5-4e65-b5b2-8afd57ab4d2e).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polevoy, G, Trajanovski, S, Grosso, P & de Laat, C 2018, Removing Undesirable Flows by Edge Deletion. in D Kim, R N Uma & A Zelikovsky (eds), Combinatorial Optimization and Applications : 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018 : proceedings. Lecture Notes in Computer Science, vol. 11346, Cham, pp. 217-232, 12th International Conference on Combinatorial Optimization and Applications, Atlanta, United States, 15/12/18. https://doi.org/10.1007/978-3-030-04651-4_15","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/f507a791-4db5-4e65-b5b2-8afd57ab4d2e","is_oa":false,"landing_page_url":"http://hdl.handle.net/11245.1/f507a791-4db5-4e65-b5b2-8afd57ab4d2e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:dare.uva.nl:publications/f507a791-4db5-4e65-b5b2-8afd57ab4d2e","is_oa":true,"landing_page_url":"https://hdl.handle.net/11245.1/f507a791-4db5-4e65-b5b2-8afd57ab4d2e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"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":"Polevoy, G, Trajanovski, S, Grosso, P & de Laat, C 2018, Removing Undesirable Flows by Edge Deletion. in D Kim, R N Uma & A Zelikovsky (eds), Combinatorial Optimization and Applications : 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018 : proceedings. Lecture Notes in Computer Science, vol. 11346, Cham, pp. 217-232, 12th International Conference on Combinatorial Optimization and Applications, Atlanta, United States, 15/12/18. https://doi.org/10.1007/978-3-030-04651-4_15","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/f507a791-4db5-4e65-b5b2-8afd57ab4d2e","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/removing-undesirable-flows-by-edge-deletion(f507a791-4db5-4e65-b5b2-8afd57ab4d2e).html","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":"Combinatorial Optimization and Applications: 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018 : proceedings, 217 - 232","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/f507a791-4db5-4e65-b5b2-8afd57ab4d2e","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/removing-undesirable-flows-by-edge-deletion(f507a791-4db5-4e65-b5b2-8afd57ab4d2e).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polevoy, G, Trajanovski, S, Grosso, P & de Laat, C 2018, Removing Undesirable Flows by Edge Deletion. in D Kim, R N Uma & A Zelikovsky (eds), Combinatorial Optimization and Applications : 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018 : proceedings. Lecture Notes in Computer Science, vol. 11346, Cham, pp. 217-232, 12th International Conference on Combinatorial Optimization and Applications, Atlanta, United States, 15/12/18. https://doi.org/10.1007/978-3-030-04651-4_15","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1249592992","https://openalex.org/W1484040084","https://openalex.org/W1572332593","https://openalex.org/W1981873012","https://openalex.org/W2002452451","https://openalex.org/W2011039300","https://openalex.org/W2019062750","https://openalex.org/W2022841964","https://openalex.org/W2024505010","https://openalex.org/W2024517697","https://openalex.org/W2045027193","https://openalex.org/W2061513598","https://openalex.org/W2065067474","https://openalex.org/W2089573024","https://openalex.org/W2104692292","https://openalex.org/W2162969618","https://openalex.org/W2461121432","https://openalex.org/W2611804663","https://openalex.org/W2914414140","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W102815760","https://openalex.org/W3161514703","https://openalex.org/W2764325809","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
