{"id":"https://openalex.org/W2026014023","doi":"https://doi.org/10.1016/0166-218x(95)00106-2","title":"Landmarks in graphs","display_name":"Landmarks in graphs","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W2026014023","doi":"https://doi.org/10.1016/0166-218x(95)00106-2","mag":"2026014023"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(95)00106-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(95)00106-2","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA","Department of Computer Science and Institute for Advanced Computer Studies,University of Maryland, College Park, MD 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies,University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75083-0688, USA","Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75083-0688, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75083-0688, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75083-0688, USA#TAB#","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110520108","display_name":"Azriel Rosenfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Azriel Rosenfeld","raw_affiliation_strings":["Center for Automation Research, University of Maryland, College Park, MD 20742, USA","Center for Automation Research, University of Maryland, College Park, MD, 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Automation Research, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Center for Automation Research, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042716179"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":813,"citation_normalized_percentile":{"value":0.1579053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"70","issue":"3","first_page":"217","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998000264167786,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9520000219345093,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9506000280380249,"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/visibility-graph","display_name":"Visibility graph","score":0.657672643661499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5928654670715332},{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.5131576657295227},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4893185794353485},{"id":"https://openalex.org/keywords/geometric-graph-theory","display_name":"Geometric graph theory","score":0.4837625026702881},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47283774614334106},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4256893992424011},{"id":"https://openalex.org/keywords/lattice-graph","display_name":"Lattice graph","score":0.42473772168159485},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38219594955444336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36023008823394775},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.313308984041214},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.2949230372905731},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.09691876173019409},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09168592095375061}],"concepts":[{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.657672643661499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5928654670715332},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.5131576657295227},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4893185794353485},{"id":"https://openalex.org/C173547177","wikidata":"https://www.wikidata.org/wiki/Q1503271","display_name":"Geometric graph theory","level":5,"score":0.4837625026702881},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47283774614334106},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4256893992424011},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.42473772168159485},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38219594955444336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36023008823394775},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.313308984041214},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2949230372905731},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.09691876173019409},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09168592095375061}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(95)00106-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(95)00106-2","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2019020998","https://openalex.org/W2040924621","https://openalex.org/W2163322487"],"related_works":["https://openalex.org/W2035096174","https://openalex.org/W4206233881","https://openalex.org/W4386631173","https://openalex.org/W3014299506","https://openalex.org/W4289731634","https://openalex.org/W3136772997","https://openalex.org/W3039998266","https://openalex.org/W84545254","https://openalex.org/W2284879731","https://openalex.org/W2026014023"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":31},{"year":2025,"cited_by_count":56},{"year":2024,"cited_by_count":63},{"year":2023,"cited_by_count":75},{"year":2022,"cited_by_count":87},{"year":2021,"cited_by_count":108},{"year":2020,"cited_by_count":66},{"year":2019,"cited_by_count":50},{"year":2018,"cited_by_count":33},{"year":2017,"cited_by_count":23},{"year":2016,"cited_by_count":29},{"year":2015,"cited_by_count":34},{"year":2014,"cited_by_count":38},{"year":2013,"cited_by_count":32},{"year":2012,"cited_by_count":27}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}