{"id":"https://openalex.org/W1605390268","doi":"https://doi.org/10.1007/3-540-62495-3_49","title":"A new minimum cost flow algorithm with applications to graph drawing","display_name":"A new minimum cost flow algorithm with applications to graph drawing","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1605390268","doi":"https://doi.org/10.1007/3-540-62495-3_49","mag":"1605390268"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-62495-3_49","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-62495-3_49","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-62495-3_49.pdf","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":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-62495-3_49.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016725153","display_name":"Ashim Garg","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]},{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ashim Garg","raw_affiliation_strings":["Department of Computer Science, Brown University, Providence, USA","Brown University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079716343","display_name":"Roberto Tamassia","orcid":"https://orcid.org/0000-0003-2445-6064"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]},{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roberto Tamassia","raw_affiliation_strings":["Department of Computer Science, Brown University, Providence, USA","Brown University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016725153"],"corresponding_institution_ids":["https://openalex.org/I175594653","https://openalex.org/I27804330"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.0344,"has_fulltext":true,"cited_by_count":72,"citation_normalized_percentile":{"value":0.99,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"201","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9824000000953674,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.7591692805290222},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6721665263175964},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5733649134635925},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5365415215492249},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5248851180076599},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5229883193969727},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5075548887252808},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5037361979484558},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4889198839664459},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.48754212260246277},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.483112096786499},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.44722098112106323},{"id":"https://openalex.org/keywords/graph-drawing","display_name":"Graph drawing","score":0.4313163161277771},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42823129892349243},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42468810081481934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2697473168373108},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11137422919273376}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.7591692805290222},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6721665263175964},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5733649134635925},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5365415215492249},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5248851180076599},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5229883193969727},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5075548887252808},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5037361979484558},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4889198839664459},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.48754212260246277},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.483112096786499},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.44722098112106323},{"id":"https://openalex.org/C112953755","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph drawing","level":3,"score":0.4313163161277771},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42823129892349243},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42468810081481934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2697473168373108},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11137422919273376},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-62495-3_49","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-62495-3_49","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-62495-3_49.pdf","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:CiteSeerX.psu:10.1.1.4.7650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/cgc/papers/gt-nmcfa-97.ps.gz","raw_type":"text"},{"id":"pmh:oai:gdea.informatik.uni-koeln.de:113","is_oa":false,"landing_page_url":"http://gdea.informatik.uni-koeln.de/113/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196197","display_name":"gdea - Graph Drawing E-print Archive (GDEA)","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":"","raw_type":"Conference Paper"}],"best_oa_location":{"id":"doi:10.1007/3-540-62495-3_49","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-62495-3_49","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-62495-3_49.pdf","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2728514236","display_name":"Graph Drawing","funder_award_id":"9423847","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1605390268.pdf","grobid_xml":"https://content.openalex.org/works/W1605390268.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1496170950","https://openalex.org/W1500092951","https://openalex.org/W1501486526","https://openalex.org/W1513400187","https://openalex.org/W1523755052","https://openalex.org/W1536741012","https://openalex.org/W1594619031","https://openalex.org/W1764613511","https://openalex.org/W1884495739","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W1989650529","https://openalex.org/W1992709202","https://openalex.org/W2002025203","https://openalex.org/W2003764821","https://openalex.org/W2006382572","https://openalex.org/W2009710482","https://openalex.org/W2045870980","https://openalex.org/W2074872108","https://openalex.org/W2075209053","https://openalex.org/W2095371621","https://openalex.org/W2114098276","https://openalex.org/W2152598528","https://openalex.org/W2753176400","https://openalex.org/W4205163994","https://openalex.org/W4239898578","https://openalex.org/W4249958171","https://openalex.org/W6781618339","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W2182648737","https://openalex.org/W2625547693"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}