{"id":899,"date":"2018-08-26T07:41:15","date_gmt":"2018-08-26T07:41:15","guid":{"rendered":"http:\/\/dccg.upc.edu\/gd2018\/?page_id=899"},"modified":"2018-09-07T08:24:45","modified_gmt":"2018-09-07T08:24:45","slug":"accepted-posters","status":"publish","type":"page","link":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/accepted-posters\/","title":{"rendered":"Accepted posters"},"content":{"rendered":"<ul>\n<li><a href=\"http:\/\/mozart.diei.unipg.it\/didimo\/\">Walter Didimo<\/a>, <a href=\"https:\/\/www.unipg.it\/personale\/luca.grilli\/\">Luca Grilli<\/a>, <a href=\"http:\/\/mozart.diei.unipg.it\/liotta\/\">Giuseppe Liotta<\/a>, <a href=\"http:\/\/mozart.diei.unipg.it\/montecchiani\/\">Fabrizio Montecchiani<\/a> and Daniele Pagliuca. <em>Visual Analysis of Temporal Fiscal Networks with TeFNet<\/em><\/li>\n<li><a href=\"https:\/\/i11www.iti.kit.edu\/en\/members\/lukas_barth\/index\">Lukas Barth<\/a>, <a href=\"https:\/\/i11www.iti.kit.edu\/en\/members\/guido_brueckner\/index\">Guido Br\u00fcckner<\/a>, Paul Jungeblut and <a href=\"https:\/\/i11www.iti.kit.edu\/en\/members\/marcel_radermacher\/index\">Marcel Radermacher<\/a>. <em>Multilevel Planarity<\/em><\/li>\n<li><a href=\"https:\/\/www.uni-muenster.de\/Geoinformatics\/en\/institute\/staff\/index.php\/269\/Marcelo_De_Lima_Galvao\">Marcelo de Lima Galv\u00e3o<\/a>, <a href=\"http:\/\/krukar.staff.ifgi.de\/\">Jakub Krukar<\/a> and <a href=\"http:\/\/schwering.staff.ifgi.de\/\">Angela Schwering<\/a>. <em>Schematization of Polygons for Wayfinding and Orientation. Emphasizing path-polygon spatial relations of regional landmarks in route maps<\/em><\/li>\n<li><a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/?site=mitarbeiter\/patrizioangelini\/index\">Patrizio Angelini<\/a>, <a href=\"http:\/\/algo.inf.uni-tuebingen.de\/?site=mitarbeiter\/michaelbekos\/index\">Michael Bekos<\/a>, <a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/?site=mitarbeiter\/michaelkaufmann\/index\">Michael Kaufmann<\/a> and Thomas Schneck. <em>Low-Degree Graphs Beyond Planarity<\/em><\/li>\n<li><a href=\"https:\/\/math.oregonstate.edu\/people\/view\/camchoc\">Charles Camacho<\/a>, <a href=\"http:\/\/www.csun.edu\/~sf70713\/\">Silvia Fern\u00e1ndez-Merchant<\/a>, <a href=\"http:\/\/www.matf.bg.ac.rs\/p\/-marija-jelic\">Marija Jelic<\/a>, <a href=\"https:\/\/www.math.unl.edu\/~rkirsch2\/\">Rachel Kirsch<\/a>, <a href=\"http:\/\/page.math.tu-berlin.de\/~kleist\/\">Linda Kleist<\/a>, <a href=\"https:\/\/www.auburn.edu\/cosam\/news\/articles\/2018\/03\/matson_accepts_assistant_professor_position.htm\">Elizabeth Bailey Matson<\/a> and <a href=\"https:\/\/www.uncsa.edu\/faculty-staff\/jennifer-white.aspx\">Jennifer White<\/a>. <em>Bounding the Tripartite-Circle Crossing Number of Complete Tripartite Graphs<\/em><\/li>\n<li><a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/chaplick-steven\/\">Steven Chaplick<\/a>, <a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/loeffler-andre\/\">Andre L\u00f6ffler<\/a> and Rainer Schmo\u0308ger. <em>On the Edge Density of k-planar Graphs<\/em><\/li>\n<li><a href=\"http:\/\/neural-reckoning.org\/jonathan_zheng.html\">Jonathan X. Zheng<\/a>, <a href=\"http:\/\/www.imperial.ac.uk\/people\/s.pawar\">Samraat Pawar<\/a> and <a href=\"https:\/\/www.imperial.ac.uk\/people\/d.goodman\">Dan F. M. Goodman<\/a>. <em>Confluent* Drawings by Hierarchical Clustering<\/em><\/li>\n<li><a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/firman-oksana\/\">Oksana Firman<\/a>, <a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/mitarbeiterinnen\/ehemalige-mitarbeiter\/lipp-fabian\/\">Fabian Lipp<\/a>, Laura Straube and <a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/wolff-alexander\/\">Alexander Wolff<\/a>. <em>Examining Weak Line Cover Numbers with Two Lines on the Plane<\/em><\/li>\n<li><a href=\"https:\/\/www.infosun.fim.uni-passau.de\/~chris\/\">Christian Bachmaier<\/a>, <a href=\"http:\/\/www.fim.uni-passau.de\/theoretische-informatik\/lehrstuhlteam\/prof-dr-ignaz-rutter\/\">Ignaz Rutter<\/a> and <a href=\"http:\/\/www.fim.uni-passau.de\/theoretische-informatik\/lehrstuhlteam\/peter-stumpf\/\">Peter Stumpf<\/a>.<em> 1-Gap Planarity of Complete Bipartite Graphs<\/em><\/li>\n<li><a href=\"https:\/\/uwaterloo.ca\/combinatorics-and-optimization\/about\/people\/amarroyo\">Alan Arroyo<\/a>, <a href=\"http:\/\/www.math.uwaterloo.ca\/~brichter\/\">R. Bruce Richter<\/a> and <a href=\"https:\/\/www.math.toronto.edu\/cms\/people\/students\/graduate\/sunohara-matthew\/\">Matthew Sunohara<\/a>. <em>Extending Drawings of $K_n$ into Arrangements of Pseudocircles<\/em><\/li>\n<li><a href=\"https:\/\/sites.google.com\/a\/cs.stonybrook.edu\/kinsumliu\/\">Kin Sum Liu<\/a>, <a href=\"http:\/\/www3.cs.stonybrook.edu\/~chni\/\">Chien-Chun Ni<\/a>, <a href=\"https:\/\/www.linkedin.com\/in\/yu-yao-lin-9866617b\">Yu-Yao Lin<\/a> and <a href=\"http:\/\/www3.cs.stonybrook.edu\/~jgao\/\">Jie Gao<\/a>. <em>Topology Based Scalable Graph Kernels<\/em><\/li>\n<li>Jingming Hu and <a href=\"http:\/\/www.it.usyd.edu.au\/~shhong\/\">Seok-Hee Hong<\/a>. <em>New Spectral Sparsification Approach for Drawing Large Graphs<\/em><\/li>\n<li><a href=\"http:\/\/www.it.usyd.edu.au\/~shhong\/\">Seok-Hee Hong<\/a> and <a href=\"https:\/\/www.researchgate.net\/profile\/Quan_Nguyen43\">Quan Nguyen<\/a>. <em>SPQR Proxy Graphs for Visualization of Large Graphs<\/em><\/li>\n<li>Juan Jose Besa, <a href=\"https:\/\/www.ics.uci.edu\/~tujohnso\/\">Timothy Johnson<\/a>, <a href=\"https:\/\/www.ics.uci.edu\/~nmamano\/\">Nil Mamano<\/a>, Martha Osegueda. <em>Taming the Knight&#8217;s Tour: Minimizing Turns and Crossings<\/em><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani and Daniele Pagliuca. Visual Analysis of Temporal Fiscal Networks with TeFNet Lukas Barth, Guido Br\u00fcckner, Paul Jungeblut and Marcel Radermacher. Multilevel Planarity Marcelo de Lima Galv\u00e3o, Jakub Krukar and Angela Schwering. Schematization of Polygons for Wayfinding and Orientation. Emphasizing path-polygon spatial relations of regional landmarks in route &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/dccg.upc.edu\/gd2018\/index.php\/accepted-posters\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Accepted posters&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":50,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"_links":{"self":[{"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/pages\/899"}],"collection":[{"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/comments?post=899"}],"version-history":[{"count":5,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/pages\/899\/revisions"}],"predecessor-version":[{"id":993,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/pages\/899\/revisions\/993"}],"wp:attachment":[{"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/media?parent=899"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}