{"id":"https://openalex.org/W2751157569","doi":"https://doi.org/10.1007/978-3-319-73915-1_5","title":"Experimental Analysis of the Accessibility of Drawings with Few Segments","display_name":"Experimental Analysis of the Accessibility of Drawings with Few Segments","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2751157569","doi":"https://doi.org/10.1007/978-3-319-73915-1_5","mag":"2751157569"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-73915-1_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-73915-1_5","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/a138f42e-c8d7-45bc-9dda-d3fe4bcbec19","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029516206","display_name":"Philipp Kindermann","orcid":"https://orcid.org/0000-0001-5764-7719"},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"FernUniversit\u00e4t in Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Philipp Kindermann","raw_affiliation_strings":["LG Theoretische Informatik, FernUniversit\u00e4t in Hagen, Hagen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LG Theoretische Informatik, FernUniversit\u00e4t in Hagen, Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062614232","display_name":"Wouter Meulemans","orcid":"https://orcid.org/0000-0002-4978-3400"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Wouter Meulemans","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055531990","display_name":"Andr\u00e9 Schulz","orcid":"https://orcid.org/0000-0002-2134-4852"},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"FernUniversit\u00e4t in Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Schulz","raw_affiliation_strings":["LG Theoretische Informatik, FernUniversit\u00e4t in Hagen, Hagen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LG Theoretische Informatik, FernUniversit\u00e4t in Hagen, Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0759,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.30352263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"52","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10799","display_name":"Data Visualization and Analytics","score":0.9980000257492065,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9980000257492065,"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/T12650","display_name":"Aesthetic Perception and Analysis","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/2805","display_name":"Cognitive Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11605","display_name":"Visual Attention and Saliency Detection","score":0.9735000133514404,"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.7811275720596313},{"id":"https://openalex.org/keywords/graph-drawing","display_name":"Graph drawing","score":0.6010585427284241},{"id":"https://openalex.org/keywords/line-drawings","display_name":"Line drawings","score":0.5891749262809753},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5080440044403076},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4916079640388489},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4503152370452881},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44246357679367065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43153366446495056},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4177429974079132},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4169248640537262},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3274439573287964},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.29135051369667053},{"id":"https://openalex.org/keywords/engineering-drawing","display_name":"Engineering drawing","score":0.19657710194587708},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14070504903793335},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08301830291748047}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7811275720596313},{"id":"https://openalex.org/C112953755","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph drawing","level":3,"score":0.6010585427284241},{"id":"https://openalex.org/C2983864324","wikidata":"https://www.wikidata.org/wiki/Q16872183","display_name":"Line drawings","level":2,"score":0.5891749262809753},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5080440044403076},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4916079640388489},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4503152370452881},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44246357679367065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43153366446495056},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4177429974079132},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4169248640537262},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3274439573287964},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.29135051369667053},{"id":"https://openalex.org/C199639397","wikidata":"https://www.wikidata.org/wiki/Q1788588","display_name":"Engineering drawing","level":1,"score":0.19657710194587708},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14070504903793335},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08301830291748047},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/978-3-319-73915-1_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-73915-1_5","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"},{"id":"pmh:oai:pure.tue.nl:openaire/a138f42e-c8d7-45bc-9dda-d3fe4bcbec19","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a138f42e-c8d7-45bc-9dda-d3fe4bcbec19","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kindermann, P, Meulemans, W & Schulz, A 2018, Experimental analysis of the accessibility of drawings with few segments. in K-L Ma & F Frati (eds), Graph Drawing and Network Visualization : 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10692, Springer, Dordrecht, pp. 52-64. https://doi.org/10.1007/978-3-319-73915-1_5","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.tue.nl:publications/0536252d-86a6-4165-945c-d47e77f20c6b","is_oa":false,"landing_page_url":"https://arxiv.org/abs/1708.09815","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:gdea.informatik.uni-koeln.de:1591","is_oa":false,"landing_page_url":"http://gdea.informatik.uni-koeln.de/1591/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400857","display_name":"Graph Drawing E-print Archive (Die Universit\u00e4t zu K\u00f6ln)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:pure.tue.nl:publications/a138f42e-c8d7-45bc-9dda-d3fe4bcbec19","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85041820250&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kindermann, P, Meulemans, W & Schulz, A 2018, Experimental analysis of the accessibility of drawings with few segments. in K-L Ma & F Frati (eds), Graph Drawing and Network Visualization : 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10692, Springer, Dordrecht, pp. 52-64. https://doi.org/10.1007/978-3-319-73915-1_5","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a138f42e-c8d7-45bc-9dda-d3fe4bcbec19","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/a138f42e-c8d7-45bc-9dda-d3fe4bcbec19","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Graph Drawing and Network Visualization: 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers, 52 - 64","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/a138f42e-c8d7-45bc-9dda-d3fe4bcbec19","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a138f42e-c8d7-45bc-9dda-d3fe4bcbec19","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kindermann, P, Meulemans, W & Schulz, A 2018, Experimental analysis of the accessibility of drawings with few segments. in K-L Ma & F Frati (eds), Graph Drawing and Network Visualization : 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10692, Springer, Dordrecht, pp. 52-64. https://doi.org/10.1007/978-3-319-73915-1_5","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G5927205862","display_name":null,"funder_award_id":"027.015","funder_id":"https://openalex.org/F4320314239","funder_display_name":"Netherlands eScience Center"}],"funders":[{"id":"https://openalex.org/F4320314239","display_name":"Netherlands eScience Center","ror":"https://ror.org/00rbjv475"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1985118207","https://openalex.org/W1987886060","https://openalex.org/W1988119253","https://openalex.org/W1988606223","https://openalex.org/W2005080287","https://openalex.org/W2045012623","https://openalex.org/W2091548089","https://openalex.org/W2135415614","https://openalex.org/W2155421081","https://openalex.org/W2156742052","https://openalex.org/W2164675803","https://openalex.org/W2167482691","https://openalex.org/W2404730450","https://openalex.org/W2604341771","https://openalex.org/W3103264504","https://openalex.org/W4211110189"],"related_works":["https://openalex.org/W2379764279","https://openalex.org/W2360924501","https://openalex.org/W2766237626","https://openalex.org/W2134886733","https://openalex.org/W1567245832","https://openalex.org/W2165110861","https://openalex.org/W1540680886","https://openalex.org/W3038010468","https://openalex.org/W2751157569","https://openalex.org/W2468630637"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}