{"id":"https://openalex.org/W2579550659","doi":"https://doi.org/10.1090/dimacs/069/11","title":"How far is, should and could be conjecture-making in graph theory an automated process?","display_name":"How far is, should and could be conjecture-making in graph theory an automated process?","publication_year":2007,"publication_date":"2007-06-07","ids":{"openalex":"https://openalex.org/W2579550659","doi":"https://doi.org/10.1090/dimacs/069/11","mag":"2579550659"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/069/11","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/069/11","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical 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/A5038480864","display_name":"Pierre Hansen","orcid":null},"institutions":[{"id":"https://openalex.org/I108192572","display_name":"HEC Montr\u00e9al","ror":"https://ror.org/05ww3wq27","country_code":"CA","type":"education","lineage":["https://openalex.org/I108192572"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Pierre Hansen","raw_affiliation_strings":["HEC Montr\u00c3\u00a9al, Montr\u00c3\u00a9al, Quebec, Canada"],"affiliations":[{"raw_affiliation_string":"HEC Montr\u00c3\u00a9al, Montr\u00c3\u00a9al, Quebec, Canada","institution_ids":["https://openalex.org/I108192572"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038480864"],"corresponding_institution_ids":["https://openalex.org/I108192572"],"apc_list":null,"apc_paid":null,"fwci":1.6555,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85758099,"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":"189","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9287999868392944,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9287999868392944,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.5426173806190491},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5411384105682373},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5117404460906982},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5090886950492859},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.5024888515472412},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3051975965499878},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30263617634773254},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2429874837398529},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12933525443077087}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5426173806190491},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5411384105682373},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5117404460906982},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5090886950492859},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.5024888515472412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3051975965499878},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30263617634773254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2429874837398529},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12933525443077087}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/069/11","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/069/11","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"}],"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/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2039864950","https://openalex.org/W2532801570","https://openalex.org/W4385627933","https://openalex.org/W2480127678","https://openalex.org/W2762831627","https://openalex.org/W2806270048","https://openalex.org/W4310605282"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}