{"id":"https://openalex.org/W2157901347","doi":"https://doi.org/10.1007/s004530010032","title":"Dynamically Switching Vertices in Planar Graphs","display_name":"Dynamically Switching Vertices in Planar Graphs","publication_year":2000,"publication_date":"2000-09-01","ids":{"openalex":"https://openalex.org/W2157901347","doi":"https://doi.org/10.1007/s004530010032","mag":"2157901347"},"language":"en","primary_location":{"id":"doi:10.1007/s004530010032","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010032","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5022524777","display_name":"Daniele Frigioni","orcid":"https://orcid.org/0000-0002-2180-8813"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"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":["DE","IT"],"is_corresponding":true,"raw_author_name":"D. Frigioni","raw_affiliation_strings":["Dipartimento di Informatica e  Sistemistica, Universit\u00e0 di Roma ``La Sapienza,'' via Salaria 113,  I-00198 Roma, Italy. frigioni@dis.uniroma1.it.  Part of the work of this author was done while visiting the Max Planck  Institut f\u00fcr Informatik, Im Stadtwald, 66123 Saarbr\u00fccken,  Germany, supported by Research Fellowship No. 203.15.07 of the Italian   National Research Council (CNR)., IT","Dipartimento di Informativa e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e  Sistemistica, Universit\u00e0 di Roma ``La Sapienza,'' via Salaria 113,  I-00198 Roma, Italy. frigioni@dis.uniroma1.it.  Part of the work of this author was done while visiting the Max Planck  Institut f\u00fcr Informatik, Im Stadtwald, 66123 Saarbr\u00fccken,  Germany, supported by Research Fellowship No. 203.15.07 of the Italian   National Research Council (CNR)., IT","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Dipartimento di Informativa e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086186456","display_name":"Giuseppe F. Italiano","orcid":"https://orcid.org/0000-0002-9492-9894"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. F. Italiano","raw_affiliation_strings":["Dipartimento di Informatica, Sistemi e Produzione,  Universit\u00e0 di Roma ``Tor Vergata,'' Rome, Italy.  italiano@?info?.uniroma2.?it.   http:?//www.?info.?uniroma2.?it/?~italiano/., IT"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Sistemi e Produzione,  Universit\u00e0 di Roma ``Tor Vergata,'' Rome, Italy.  italiano@?info?.uniroma2.?it.   http:?//www.?info.?uniroma2.?it/?~italiano/., IT","institution_ids":["https://openalex.org/I116067653"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022524777"],"corresponding_institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I861853513"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.8578,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.81761949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"28","issue":"1","first_page":"76","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9962999820709229,"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/T12288","display_name":"Optimization and Search Problems","score":0.995199978351593,"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/combinatorics","display_name":"Combinatorics","score":0.7519674301147461},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5327214002609253},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4924684464931488},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.47798222303390503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4405856132507324},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.43930286169052124},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.43223094940185547},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.38304591178894043},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3753649592399597},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3537490665912628},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15029671788215637},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.12065696716308594},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11745345592498779}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7519674301147461},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5327214002609253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4924684464931488},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.47798222303390503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4405856132507324},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.43930286169052124},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.43223094940185547},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.38304591178894043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3753649592399597},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3537490665912628},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15029671788215637},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.12065696716308594},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11745345592498779}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s004530010032","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010032","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.9647","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.9647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://www.dis.uniroma1.it/pub/Theory/alcom-it/AlcomArchive/WP3/DynSwiVerPlaGra.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.9472","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.9472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.info.uniroma2.it/~italiano/Papers/onoff.ps.gz","raw_type":"text"},{"id":"pmh:oai:iris.luiss.it:11385/199823","is_oa":false,"landing_page_url":"http://hdl.handle.net/11385/199823","pdf_url":null,"source":{"id":"https://openalex.org/S4377196446","display_name":"IRIS - Institutional Research Information System (Libera Universit\u00e0 Internazionale degli Studi Sociali Guido Carli)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56441308","host_organization_name":"Libera Universit\u00e0 Internazionale degli Studi Sociali Guido Carli","host_organization_lineage":["https://openalex.org/I56441308"],"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/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1552413686","https://openalex.org/W1572092079","https://openalex.org/W1968647828","https://openalex.org/W1997906261","https://openalex.org/W2009695707","https://openalex.org/W2028507750","https://openalex.org/W2032075690","https://openalex.org/W2038643780","https://openalex.org/W2069731308","https://openalex.org/W2087989168","https://openalex.org/W2094632707","https://openalex.org/W2095282679","https://openalex.org/W2102347446","https://openalex.org/W2104224360","https://openalex.org/W2116633957","https://openalex.org/W2121473031","https://openalex.org/W2127605247","https://openalex.org/W2128744826","https://openalex.org/W2148841334","https://openalex.org/W3138175242"],"related_works":["https://openalex.org/W4283803822","https://openalex.org/W2044422372","https://openalex.org/W1984844695","https://openalex.org/W2964695382","https://openalex.org/W3003159024","https://openalex.org/W256237781","https://openalex.org/W2963041596","https://openalex.org/W4213252030","https://openalex.org/W2157163513","https://openalex.org/W3120639636"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
