{"id":"https://openalex.org/W1603458698","doi":"https://doi.org/10.1007/978-3-642-13073-1_31","title":"Capacitated Confluent Flows: Complexity and Algorithms","display_name":"Capacitated Confluent Flows: Complexity and Algorithms","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1603458698","doi":"https://doi.org/10.1007/978-3-642-13073-1_31","mag":"1603458698"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13073-1_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13073-1_31","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/A5080574328","display_name":"Daniel D. Dressler","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":"Daniel Dressler","raw_affiliation_strings":["TU Berlin, Inst. f. Mathematik, MA 5-2, Str. des 17. Juni 136, 10623, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin, Inst. f. Mathematik, MA 5-2, Str. des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002855059","display_name":"Martin Strehler","orcid":"https://orcid.org/0000-0003-4241-6584"},"institutions":[{"id":"https://openalex.org/I51783024","display_name":"Brandenburg University of Technology Cottbus-Senftenberg","ror":"https://ror.org/02wxx3e24","country_code":"DE","type":"education","lineage":["https://openalex.org/I51783024"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Strehler","raw_affiliation_strings":["BTU Cottbus, Mathematisches Institut, Postfach 10 13 44, 03013, Cottbus, Germany"],"affiliations":[{"raw_affiliation_string":"BTU Cottbus, Mathematisches Institut, Postfach 10 13 44, 03013, Cottbus, Germany","institution_ids":["https://openalex.org/I51783024"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080574328"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3662,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.61967213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"347","last_page":"358"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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/treewidth","display_name":"Treewidth","score":0.7721052169799805},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6482114791870117},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5826953649520874},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.568373441696167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.469791054725647},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4527367651462555},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4304269552230835},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.41841840744018555},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3918783366680145},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3407936692237854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3119348883628845},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24637749791145325},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24409723281860352},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14068174362182617}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7721052169799805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6482114791870117},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5826953649520874},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.568373441696167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.469791054725647},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4527367651462555},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4304269552230835},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.41841840744018555},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3918783366680145},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3407936692237854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3119348883628845},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24637749791145325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24409723281860352},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14068174362182617},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-13073-1_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13073-1_31","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/6","score":0.8700000047683716,"display_name":"Clean water and sanitation"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1537449969","https://openalex.org/W1538293711","https://openalex.org/W1977545325","https://openalex.org/W1995031698","https://openalex.org/W2002531683","https://openalex.org/W2011039300","https://openalex.org/W2054167510","https://openalex.org/W2060085144","https://openalex.org/W2100699015","https://openalex.org/W2107526127","https://openalex.org/W2132027267","https://openalex.org/W2300165980","https://openalex.org/W2397914854","https://openalex.org/W2498316819","https://openalex.org/W2569646339","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2949617446","https://openalex.org/W4294299870","https://openalex.org/W2748664888","https://openalex.org/W1582492864","https://openalex.org/W35387897","https://openalex.org/W2745231626","https://openalex.org/W1810116456","https://openalex.org/W4300619607","https://openalex.org/W2964174631","https://openalex.org/W2170725231"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}