Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2014993890', 'doi': 'https://doi.org/10.1007/bf02935746', 'title': 'Sequential and parallel algorithms for minimum flows', 'display_name': 'Sequential and parallel algorithms for minimum flows', 'publication_year': 2004, 'publication_date': '2004-03-01', 'ids': {'openalex': 'https://openalex.org/W2014993890', 'doi': 'https://doi.org/10.1007/bf02935746', 'mag': '2014993890'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/bf02935746', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S199913245', 'display_name': 'Journal of Applied Mathematics and Computing', 'issn_l': '1598-5865', 'issn': ['1598-5865', '1865-2085'], '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/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5028806136', 'display_name': 'Eleonor Ciurea', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I3123573182', 'display_name': 'Transylvania University of Brașov', 'ror': 'https://ror.org/01cg9ws23', 'country_code': 'RO', 'type': 'education', 'lineage': ['https://openalex.org/I3123573182']}], 'countries': ['RO'], 'is_corresponding': False, 'raw_author_name': 'Eleonor Ciurea', 'raw_affiliation_strings': ['Department of Computer Science Transilvania University 50, Iuliu Maniu, 2200, Bra§ov, Romania'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science Transilvania University 50, Iuliu Maniu, 2200, Bra§ov, Romania', 'institution_ids': ['https://openalex.org/I3123573182']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5010950189', 'display_name': 'Laura Ciupală', 'orcid': 'https://orcid.org/0009-0006-2059-3466'}, 'institutions': [{'id': 'https://openalex.org/I3123573182', 'display_name': 'Transylvania University of Brașov', 'ror': 'https://ror.org/01cg9ws23', 'country_code': 'RO', 'type': 'education', 'lineage': ['https://openalex.org/I3123573182']}], 'countries': ['RO'], 'is_corresponding': False, 'raw_author_name': 'Laura Ciupalâ', 'raw_affiliation_strings': ['Department of Computer Science Transilvania University 50, Iuliu Maniu, 2200, Bra§ov, Romania'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science Transilvania University 50, Iuliu Maniu, 2200, Bra§ov, Romania', 'institution_ids': ['https://openalex.org/I3123573182']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': {'value': 2390, 'currency': 'EUR', 'value_usd': 2990, 'provenance': 'doaj'}, 'apc_paid': None, 'fwci': 1.567, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 49, 'citation_normalized_percentile': {'value': 0.948011, 'is_in_top_1_percent': False, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 92, 'max': 93}, 'biblio': {'volume': '15', 'issue': '1-2', 'first_page': '53', 'last_page': '75'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Combinatorial Optimization and Complexity Theory', 'score': 0.9993, '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': 'Combinatorial Optimization and Complexity Theory', 'score': 0.9993, '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': 'Distributed Coordination in Online Robotics Research', 'score': 0.9978, '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/T10996', 'display_name': 'Mesh Generation Algorithms', 'score': 0.9944, '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/maximum-flow-problem', 'display_name': 'Maximum flow problem', 'score': 0.7972431}, {'id': 'https://openalex.org/keywords/minimum-cost-flow-problem', 'display_name': 'Minimum-cost flow problem', 'score': 0.7704283}, {'id': 'https://openalex.org/keywords/theory-of-computation', 'display_name': 'Theory of computation', 'score': 0.6821831}, {'id': 'https://openalex.org/keywords/approximation-algorithms', 'display_name': 'Approximation Algorithms', 'score': 0.673849}, {'id': 'https://openalex.org/keywords/out-of-kilter-algorithm', 'display_name': 'Out-of-kilter algorithm', 'score': 0.67273766}, {'id': 'https://openalex.org/keywords/combinatorial-optimization', 'display_name': 'Combinatorial Optimization', 'score': 0.656893}, {'id': 'https://openalex.org/keywords/online-algorithms', 'display_name': 'Online Algorithms', 'score': 0.644713}, {'id': 'https://openalex.org/keywords/gathering-algorithms', 'display_name': 'Gathering Algorithms', 'score': 0.634765}, {'id': 'https://openalex.org/keywords/geometric-optimization', 'display_name': 'Geometric Optimization', 'score': 0.634407}, {'id': 'https://openalex.org/keywords/multi-commodity-flow-problem', 'display_name': 'Multi-commodity flow problem', 'score': 0.5598588}], 'concepts': [{'id': 'https://openalex.org/C157469704', 'wikidata': 'https://www.wikidata.org/wiki/Q2585642', 'display_name': 'Maximum flow problem', 'level': 2, 'score': 0.7972431}, {'id': 'https://openalex.org/C99545648', 'wikidata': 'https://www.wikidata.org/wiki/Q2897180', 'display_name': 'Minimum-cost flow problem', 'level': 3, 'score': 0.7704283}, {'id': 'https://openalex.org/C24858836', 'wikidata': 'https://www.wikidata.org/wiki/Q844718', 'display_name': 'Theory of computation', 'level': 2, 'score': 0.6821831}, {'id': 'https://openalex.org/C133824558', 'wikidata': 'https://www.wikidata.org/wiki/Q16893660', 'display_name': 'Out-of-kilter algorithm', 'level': 5, 'score': 0.67273766}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.6426986}, {'id': 'https://openalex.org/C38349280', 'wikidata': 'https://www.wikidata.org/wiki/Q1434290', 'display_name': 'Flow (mathematics)', 'level': 2, 'score': 0.6389384}, {'id': 'https://openalex.org/C114809511', 'wikidata': 'https://www.wikidata.org/wiki/Q1412924', 'display_name': 'Flow network', 'level': 2, 'score': 0.57907593}, {'id': 'https://openalex.org/C170334043', 'wikidata': 'https://www.wikidata.org/wiki/Q6934437', 'display_name': 'Multi-commodity flow problem', 'level': 3, 'score': 0.5598588}, {'id': 'https://openalex.org/C2777735758', 'wikidata': 'https://www.wikidata.org/wiki/Q817765', 'display_name': 'Path (computing)', 'level': 2, 'score': 0.5460787}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.54200006}, {'id': 'https://openalex.org/C120373497', 'wikidata': 'https://www.wikidata.org/wiki/Q1087987', 'display_name': 'Parallel algorithm', 'level': 2, 'score': 0.44397518}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.39965904}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.37112063}, {'id': 'https://openalex.org/C22590252', 'wikidata': 'https://www.wikidata.org/wiki/Q1058754', 'display_name': 'Shortest path problem', 'level': 3, 'score': 0.22833273}, {'id': 'https://openalex.org/C173870130', 'wikidata': 'https://www.wikidata.org/wiki/Q8548', 'display_name': "Dijkstra's algorithm", 'level': 4, 'score': 0.15888703}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.117938995}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.074148744}, {'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/C2524010', 'wikidata': 'https://www.wikidata.org/wiki/Q8087', 'display_name': 'Geometry', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/bf02935746', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S199913245', 'display_name': 'Journal of Applied Mathematics and Computing', 'issn_l': '1598-5865', 'issn': ['1598-5865', '1865-2085'], '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/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 9, 'referenced_works': ['https://openalex.org/W1977545325', 'https://openalex.org/W1985036904', 'https://openalex.org/W2007470648', 'https://openalex.org/W2025830455', 'https://openalex.org/W2046043928', 'https://openalex.org/W2057059776', 'https://openalex.org/W2090359754', 'https://openalex.org/W2109567578', 'https://openalex.org/W2338905098'], 'related_works': ['https://openalex.org/W4206915070', 'https://openalex.org/W3159013657', 'https://openalex.org/W3141113327', 'https://openalex.org/W2963592990', 'https://openalex.org/W2625547693', 'https://openalex.org/W2379499702', 'https://openalex.org/W2355612523', 'https://openalex.org/W2108800124', 'https://openalex.org/W2051329268', 'https://openalex.org/W2014993890'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2014993890', 'counts_by_year': [{'year': 2024, 'cited_by_count': 1}, {'year': 2022, 'cited_by_count': 3}, {'year': 2021, 'cited_by_count': 2}, {'year': 2020, 'cited_by_count': 2}, {'year': 2019, 'cited_by_count': 2}, {'year': 2018, 'cited_by_count': 2}, {'year': 2017, 'cited_by_count': 2}, {'year': 2015, 'cited_by_count': 1}, {'year': 2014, 'cited_by_count': 3}, {'year': 2013, 'cited_by_count': 4}, {'year': 2012, 'cited_by_count': 3}], 'updated_date': '2024-09-19T13:40:42.570352', 'created_date': '2016-06-24'}