{"id":"https://openalex.org/W1489979173","doi":"https://doi.org/10.1007/3-540-60692-0_39","title":"Efficient algorithms for vertex arboricity of planar graphs","display_name":"Efficient algorithms for vertex arboricity of planar graphs","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1489979173","doi":"https://doi.org/10.1007/3-540-60692-0_39","mag":"1489979173"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-60692-0_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60692-0_39","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/A5060115298","display_name":"Abhik Roychoudhury","orcid":"https://orcid.org/0000-0002-7127-1137"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Abhik Roychoudhury","raw_affiliation_strings":["Department of Computer Science and Engineering, Jadavpur University, 700032, Calcutta, India","Jadavpur university,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Jadavpur University, 700032, Calcutta, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"Jadavpur university,","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021904459","display_name":"Susmita Sur\u2010Kolay","orcid":"https://orcid.org/0000-0002-2052-3779"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Susmita Sur-Kolay","raw_affiliation_strings":["Department of Computer Science and Engineering, Jadavpur University, 700032, Calcutta, India","Jadavpur university,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Jadavpur University, 700032, Calcutta, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"Jadavpur university,","institution_ids":["https://openalex.org/I170979836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060115298"],"corresponding_institution_ids":["https://openalex.org/I170979836"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5558,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.62139574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9980000257492065,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9901000261306763,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9749000072479248,"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/arboricity","display_name":"Arboricity","score":0.9607354402542114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7158839106559753},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6217093467712402},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5290754437446594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4750618636608124},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4558514356613159},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3393169045448303},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2894454598426819},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2639448046684265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2069128453731537},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.05437067151069641}],"concepts":[{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.9607354402542114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7158839106559753},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6217093467712402},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5290754437446594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4750618636608124},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4558514356613159},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3393169045448303},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2894454598426819},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2639448046684265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2069128453731537},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.05437067151069641}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-60692-0_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60692-0_39","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W193938304","https://openalex.org/W1735141257","https://openalex.org/W1977080610","https://openalex.org/W1989544707","https://openalex.org/W2146318819","https://openalex.org/W2799004609","https://openalex.org/W4213214460","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1975580069","https://openalex.org/W2946579886","https://openalex.org/W4379662042","https://openalex.org/W4309476096","https://openalex.org/W2937971868","https://openalex.org/W3097603206","https://openalex.org/W3111310291","https://openalex.org/W3216105633","https://openalex.org/W2990956612","https://openalex.org/W2026401558"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}