{"id":"https://openalex.org/W1597528919","doi":"https://doi.org/10.1007/bfb0032061","title":"On-line graph algorithms with SPQR-trees","display_name":"On-line graph algorithms with SPQR-trees","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W1597528919","doi":"https://doi.org/10.1007/bfb0032061","mag":"1597528919"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0032061","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0032061","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/A5038655759","display_name":"Giuseppe Di Battista","orcid":"https://orcid.org/0000-0003-4224-1550"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giuseppe Di Battista","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Via Buonarroti, 12, 00185, Rome, Italy","Universita di Roma, \u201cLa Sapienza\u201d"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Via Buonarroti, 12, 00185, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Universita di Roma, \u201cLa Sapienza\u201d","institution_ids":["https://openalex.org/I861853513"]}]},{"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/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]},{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roberto Tamassia","raw_affiliation_strings":["Department of Computer Science, Brown University, 02912-1910, Providence, Rhode Island","Brown University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, 02912-1910, Providence, Rhode Island","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038655759"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":10.5072,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.98472311,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"598","last_page":"611"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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":0.9977999925613403,"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.9972000122070312,"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/T11106","display_name":"Data Management and Algorithms","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7938926219940186},{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.5863792300224304},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5471712946891785},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.527951180934906},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.4966579079627991},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4942152798175812},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4847142696380615},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4404504597187042},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43522393703460693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4037036895751953},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3265719413757324},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31875142455101013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19562333822250366},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.13070493936538696},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.11578837037086487}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7938926219940186},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.5863792300224304},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5471712946891785},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.527951180934906},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.4966579079627991},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4942152798175812},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4847142696380615},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4404504597187042},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43522393703460693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4037036895751953},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3265719413757324},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31875142455101013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19562333822250366},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13070493936538696},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.11578837037086487},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bfb0032061","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0032061","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:iris.uniroma3.it:11590/177039","is_oa":false,"landing_page_url":"http://hdl.handle.net/11590/177039","pdf_url":null,"source":{"id":"https://openalex.org/S4377196120","display_name":"Iris (Roma Tre University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119003972","host_organization_name":"Roma Tre University","host_organization_lineage":["https://openalex.org/I119003972"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W165494783","https://openalex.org/W237994133","https://openalex.org/W1480770719","https://openalex.org/W1585069742","https://openalex.org/W1933276021","https://openalex.org/W1976177462","https://openalex.org/W1989111470","https://openalex.org/W1994556169","https://openalex.org/W2002614628","https://openalex.org/W2002723731","https://openalex.org/W2002906478","https://openalex.org/W2007918837","https://openalex.org/W2017351109","https://openalex.org/W2018804864","https://openalex.org/W2020473451","https://openalex.org/W2028503265","https://openalex.org/W2040444410","https://openalex.org/W2044146725","https://openalex.org/W2049596277","https://openalex.org/W2091252880","https://openalex.org/W2106439532","https://openalex.org/W2111526927","https://openalex.org/W2121473031","https://openalex.org/W2145289828","https://openalex.org/W3211329402","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4288274400","https://openalex.org/W1550834367","https://openalex.org/W2965591752","https://openalex.org/W2991386008","https://openalex.org/W4300971753","https://openalex.org/W1498879492","https://openalex.org/W1985516142","https://openalex.org/W2275773863","https://openalex.org/W1990802213","https://openalex.org/W2962819865"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}