{"id":"https://openalex.org/W1504429833","doi":"https://doi.org/10.1007/978-3-642-13073-1","title":"Algorithms and complexity : 7th international conference, CIAC 2010, Rome, Italy, May 26-28, 2010 : proceedings","display_name":"Algorithms and complexity : 7th international conference, CIAC 2010, Rome, Italy, May 26-28, 2010 : proceedings","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1504429833","doi":"https://doi.org/10.1007/978-3-642-13073-1","mag":"1504429833"},"language":"en","primary_location":{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-020347332","is_oa":false,"landing_page_url":"http://deposit.dnb.de/cgi-bin/dokserv?id=3454462&prov=M&dok_var=1&dok_ext=htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":[],"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/A5031442426","display_name":"Tiziana Calamoneri","orcid":"https://orcid.org/0000-0002-4099-1836"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tiziana Calamoneri","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4099-1836","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5037690759","display_name":"Josep D\u0131\u0301az","orcid":"https://orcid.org/0000-0003-4422-0067"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Josep D\u0131\u0301az","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4422-0067","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.04542345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.5719000101089478,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.5719000101089478,"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/combinatorics","display_name":"Combinatorics","score":0.6259241104125977},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6235360503196716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.561665415763855},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5201809406280518},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4983184337615967},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4745881259441376},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4515135586261749},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4469875991344452},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.44156578183174133},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43553808331489563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3616317808628082},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35607069730758667},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.3334290385246277},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.324174165725708},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28528445959091187}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6259241104125977},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6235360503196716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.561665415763855},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5201809406280518},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4983184337615967},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4745881259441376},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4515135586261749},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4469875991344452},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.44156578183174133},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43553808331489563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3616317808628082},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35607069730758667},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3334290385246277},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.324174165725708},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28528445959091187}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-020347332","is_oa":false,"landing_page_url":"http://deposit.dnb.de/cgi-bin/dokserv?id=3454462&prov=M&dok_var=1&dok_ext=htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dial.uclouvain.be:ebook:20878","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078/ebook:20878","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:1504429833","is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BB03436557","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Springer eBooks","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1603063140","https://openalex.org/W1550887196","https://openalex.org/W1562916609","https://openalex.org/W1209855306","https://openalex.org/W1494310072","https://openalex.org/W1558147216","https://openalex.org/W3147701688","https://openalex.org/W1542326760","https://openalex.org/W1544961126","https://openalex.org/W1596689408","https://openalex.org/W1608783969","https://openalex.org/W1567338926","https://openalex.org/W1585638336","https://openalex.org/W1571896974","https://openalex.org/W2152589198","https://openalex.org/W1499912543","https://openalex.org/W1605744855","https://openalex.org/W1539759504","https://openalex.org/W1515959974","https://openalex.org/W1529198486"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}