{"id":188,"date":"2017-08-06T10:08:21","date_gmt":"2017-08-06T10:08:21","guid":{"rendered":"http:\/\/dccg.upc.edu\/gd2018\/?page_id=188"},"modified":"2018-11-05T10:58:05","modified_gmt":"2018-11-05T10:58:05","slug":"program","status":"publish","type":"page","link":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/program\/","title":{"rendered":"Program"},"content":{"rendered":"<table>\n<tbody>\n<tr>\n<th colspan=\"3\">\n<h3><span style=\"color: #800000;\"><strong>Tuesday, September 25<\/strong><\/span><\/h3>\n<\/th>\n<\/tr>\n<tr>\n<td width=\"17%\">19:00 &#8211; 21:30<\/td>\n<td colspan=\"2\">Reception and registration (<a href=\"https:\/\/dccg.upc.edu\/gd2018\/index.php\/social-activities\/\">garden of Torre Girona<\/a>)<\/td>\n<\/tr>\n<tr>\n<th colspan=\"3\">\n<h3><\/h3>\n<h3><span style=\"color: #800000;\"><strong>Wednesday, September 26<\/strong><\/span><\/h3>\n<\/th>\n<\/tr>\n<tr>\n<td>08:30 \u2013 08:50<\/td>\n<td colspan=\"2\">Registration (<a href=\"https:\/\/dccg.upc.edu\/gd2018\/index.php\/locations\/\">Aula Master<\/a>)<\/td>\n<\/tr>\n<tr>\n<td>08:50 \u2013 09:00<\/td>\n<td colspan=\"2\">Opening<\/td>\n<\/tr>\n<tr>\n<td>09:00 \u2013 10:00<\/td>\n<td colspan=\"2\"><strong>Invited talk: Alexandru Telea<\/strong> \u2013 Chair: Andreas Kerren<strong><br \/>\n<em>Image-Based Graph Visualization: Advances and Challenges<\/em><br \/>\n<\/strong><\/td>\n<\/tr>\n<tr>\n<td>10:00 \u2013 10:30<\/td>\n<td colspan=\"2\">Coffee break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 1 &#8211; Planarity variants <\/strong>\u2013 Chair: Fabrizio Frati<\/td>\n<\/tr>\n<tr>\n<td>10:30 \u2013 10:50<\/td>\n<td>Pier Francesco Cortese and Maurizio Patrignani<br \/>\n<em>Clustered Planarity = Flat Clustered Planarity<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.07437\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s1t1.ppt\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>10:50 \u2013 11:10<\/td>\n<td>Guido Br\u00fcckner, Ignaz Rutter and Peter Stumpf<br \/>\n<em>Level Planarity: Transitivity vs. Even Crossings<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.09931\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s1t2.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>11:10 \u2013 11:30<\/td>\n<td>Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin No\u0308llenburg and Xiaoru Yuan<br \/>\n<em>Short Plane Supports for Spatial Hypergraphs<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.09729\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s1t3.pptx\">slides<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>11:30 \u2013 11:45<\/td>\n<td>Patrizio Angelini, Peter Eades, Seok-hee Hong, Karsten Klein, Stephen Kobourov, Giuseppe Liotta, Alfredo Navarra and Alessandra Tappini<br \/>\n<em>Turning Cliques into Paths to Achieve Planarity<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.08925\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s1t4.pdf\">slides<\/a>]<\/td>\n<td>S<\/td>\n<\/tr>\n<tr>\n<td>11:45 \u2013 12:00<\/td>\n<td colspan=\"2\">Short break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 2 \u2013 Upward drawings <\/strong>\u2013 Chair: Anna Lubiw<\/td>\n<\/tr>\n<tr>\n<td>12:00 \u2013 12:20<\/td>\n<td>Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta and Fabrizio Motecchiani<br \/>\n<em>Universal Slope Sets for Upward Planar Drawings<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1803.09949\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s2t1.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>12:20 \u2013 12:40<\/td>\n<td>Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Vincenzo Roselli<br \/>\n<em>Upward Planar Morphs<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10826\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s2t2.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>12:40 \u2013 13:00<\/td>\n<td>Maya Olszewski, Jeff Meder, Emmanuel Kieffer, Rapha\u00ebl Bleuse, Martin Rosalie, Gr\u00e9goire Danoy and Pascal Bouvry<br \/>\n<em>Visualizing the Template of a Chaotic Attractor<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1807.11853\">arxiv<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>13:00 \u2013 14:30<\/td>\n<td colspan=\"2\">Lunch (<a href=\"https:\/\/dccg.upc.edu\/gd2018\/index.php\/social-activities\/\">restaurant Unity<\/a>)<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\" width=\"670\"><strong>Session 3 \u2013 RAC drawings<\/strong> \u2013 Chair: Carla Binucci<\/td>\n<\/tr>\n<tr>\n<td>14:30 \u2013 14:50<\/td>\n<td>Patrizio Angelini, Michael A. Bekos, Henry F\u00f6rster and Michael Kaufmann<br \/>\n<em>On RAC Drawings of Graphs with one Bend per Edge<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10470\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s3t1.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>14:50 \u2013 15:10<\/td>\n<td>Steven Chaplick, Fabian Lipp, Alexander Wolff and Johannes Zink<br \/>\n<em>Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1806.10044\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s3t2.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>15:10 \u2013 15:30<\/td>\n<td>Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf and Andr\u00e9 Schulz<br \/>\n<em>Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes and Large Angles<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.08496\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s3t3.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>15:30 \u2013 15:40<\/td>\n<td colspan=\"2\">Short break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Best paper \u2013 Track 2 <\/strong>\u2013 Chair: Stephen Kobourov<\/td>\n<\/tr>\n<tr>\n<td>15:40 \u2013 16:00<\/td>\n<td>Moritz Klammler, Tamara Mchedlidze and Alexey Pak<br \/>\n<em>Aesthetic Discrimination of Graph Layouts<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1809.01017\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/BestPaperT2.pdf\">slides<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>16:00 \u2013 16:15<\/td>\n<td colspan=\"2\"><strong>Poster pitches<\/strong><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani and Daniele Pagliuca<br \/>\n<em>Visual Analysis of Temporal Fiscal Networks with TeFNet<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">LukasBarth, Guido Br\u00fcckner, Paul Jungeblut and Marcel Radermacher<br \/>\n<em>Multilevel Planarity<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Marcelo de Lima Galv\u00e3o, Jakub Krukar and Angela Schwering<br \/>\n<em>Schematization of Polygons for Wayfinding and Orientation<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Patrizio Angelini, Michael A. Bekos, Michael Kaufmann and Thomas Schneck<br \/>\n<em>Low-Degree Graphs Beyond Planarity<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Charles Camacho, Silvia Fern\u00e1ndez-Merchant, Marija Jelic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson and Jennifer White<br \/>\n<em>Bounding the Tripartite-Circle Crossing Number of Complete Tripartite Graphs<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Steven Chaplick, Andre L\u00f6ffler and Rainer Schmo\u0308ger<br \/>\n<em>On the Edge Density of k-planar Graphs<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Jonathan X. Zheng, Samraat Pawar and Dan F. M. Goodman<br \/>\n<em>Confluent* Drawings by Hierarchical Clustering<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Oksana Firman, Fabian Lipp, Laura Straube and Alexander Wolff<br \/>\n<em>Examining Weak Line Cover Numbers with Two Lines on the Plane<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Christian Bachmaier, Ignaz Rutter and Peter Stumpf<br \/>\n<em>1-Gap Planarity of Complete Bipartite Graphs<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Alan Arroyo, R. Bruce Richter and Matthew Sunohara<br \/>\n<em>Extending Drawings of <\/em>K<sub>n<\/sub><em> into Arrangements of Pseudocircles<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Kin Sum Liu, Chien-Chun Ni, Yu-Yao Lin and Jie Gao<br \/>\n<em>Topology Based Scalable Graph Kernels<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Jingming Hu and Seok-Hee Hong<br \/>\n<em>New Spectral Sparsification Approach for Drawing Large Graphs<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Seok-Hee Hong and Quan Nguyen<br \/>\n<em>SPQR Proxy Graphs for Visualization of Large Graphs<\/em><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td colspan=\"2\">Juan Jose Besa, Timothy Johnson, Nil Mamano and Martha Osegueda<br \/>\n<em>Taming the Knight&#8217;s Tour: Minimizing Turns and Crossings<\/em><\/td>\n<\/tr>\n<tr>\n<td>16:15 \u2013 17:00<\/td>\n<td colspan=\"2\"><strong>Poster exhibition<\/strong> and coffee break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 4 \u2013 Orders<\/strong> \u2013 Chair: Martin N\u00f6llenburg<\/td>\n<\/tr>\n<tr>\n<td>17:00 \u2013 17:20<\/td>\n<td>Michael J\u00fcnger, Petra Mutzel and Christiane Spisla<br \/>\n<em>A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1806.06617\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s4t1.pdf\">slides<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>17:20 \u2013 17:40<\/td>\n<td>Kolja Knauer, Piotr Micek and Torsten Ueckerdt<br \/>\n<em>The Queue-Number of Planar Posets<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1806.04489\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s4t2.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>17:40 \u2013 18:00<\/td>\n<td>Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann and Sergey Pupyrev<br \/>\n<em>Queue Layouts of Planar 3-Trees<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10841\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s4t3.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>18:00 \u2013 19:30<\/td>\n<td colspan=\"2\" width=\"576\"><strong>Graph Drawing Live Challenge<\/strong><\/td>\n<\/tr>\n<tr>\n<th colspan=\"3\">\n<h3><\/h3>\n<h3><span style=\"color: #800000;\"><strong>Thursday, September 27<\/strong><\/span><\/h3>\n<\/th>\n<\/tr>\n<tr>\n<td>09:00 \u2013 10:00<\/td>\n<td colspan=\"2\"><strong>Invited talk: Bojan Mohar <\/strong>\u2013 Chair: Radoslav Fulek<strong><br \/>\n<em>Beauty and Challenges of Crossing Numbers<\/em><\/strong><\/td>\n<\/tr>\n<tr>\n<td>10:00 \u2013 10:30<\/td>\n<td colspan=\"2\">Coffee break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 5 \u2013 Crossings<\/strong> \u2013 Chair: Therese Biedl<\/td>\n<\/tr>\n<tr>\n<td>10:30 \u2013 10:50<\/td>\n<td>Radoslav Fulek and Csaba T\u00f3th<br \/>\n<em>Crossing Minimization in Perturbed Drawings<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.07608\">arxiv<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>10:50 \u2013 11:10<\/td>\n<td>Michael Kaufmann, J\u00e1nos Pach, G\u00e9za T\u00f3th and Torsten Ueckerdt<br \/>\n<em>The Number of Crossings in Multigraphs with no Empty Lens<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10480\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s5t2.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>11:10 \u2013 11:30<\/td>\n<td>Markus Chimani, Hanna D\u00f6ring and Matthias Reitzner<br \/>\n<em>Crossing Numbers and Stress of Random Graphs<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.07558\">arxiv<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>11:30 \u2013 11:40<\/td>\n<td colspan=\"2\">Short break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 6 \u2013 Crossing Angle \/ Contact representations<\/strong> \u2013 Chair: Giuseppe Liotta<\/td>\n<\/tr>\n<tr>\n<td>11:40 \u2013 12:00<\/td>\n<td>Michael A. Bekos, Henry F\u00f6rster, Christian Geckeler, Lukas Holl\u00e4nder, Michael Kaufmann, Amad\u00e4us M. Spallek and Jan Splett<br \/>\n<em>A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10519\">arxiv<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>12:00 \u2013 12:20<\/td>\n<td>Almut Demel, Dominik D\u00fcrrschnabel, Tamara Mchedlidze, Marcel Radermacher and Lasse Wulf<br \/>\n<em>A Greedy Heuristic for Crossing Angle Maximization<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1807.09483\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s6t2.pdf\">slides<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>12:20 \u2013 12:40<\/td>\n<td>Felice De Luca, Md. Iqbal Hossain, Stephen Kobourov, Anna Lubiw and Debajyoti Mondal<br \/>\n<em>Recognition and Drawing of Stick Graphs<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10005\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s6t3.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>12:40 \u2013 13:00<\/td>\n<td>Zakir Deniz, Esther Galby, Andrea Munaro and Bernard Ries<br \/>\n<em>On Contact Graphs of Paths on a Grid<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1803.03468\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s6t4.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>13:00 \u2013 14:30<\/td>\n<td colspan=\"2\">Lunch (<a href=\"https:\/\/dccg.upc.edu\/gd2018\/index.php\/social-activities\/\">restaurant Unity<\/a>)<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 7 \u2013 Specialized graphs and trees<\/strong> \u2013 Chair: Alexander Wolff<\/td>\n<\/tr>\n<tr>\n<td>14:30 \u2013 14:50<\/td>\n<td>Linda Kleist<br \/>\n<em>On the Area-Universality of Triangulations<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10864\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s7t1.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>14:50 \u2013 15:05<\/td>\n<td>Anargyros Oikonomou and Antonios Symvonis<br \/>\n<em>Monotone Drawings of k-Inner Planar Graphs<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.06892\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s7t2.pdf\">slides<\/a>]<\/td>\n<td>S<\/td>\n<\/tr>\n<tr>\n<td>15:05 \u2013 15:20<\/td>\n<td>Torsten M\u00fctze and Manfred Scheucher<br \/>\n<em>On <\/em>L<em>-shaped point set embeddings of trees: First non-embeddable examples<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1807.11043\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s7t3.pdf\">slides<\/a>]<\/td>\n<td>S<\/td>\n<\/tr>\n<tr>\n<td>15:20 \u2013 15:35<\/td>\n<td>Hugo Akitaya, Maarten L\u00f6ffler and Irene Parada<br \/>\n<em>How to Fit a Tree in a Box<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10572\">arxiv<\/a>] [<a href=\"https:\/\/www.staff.science.uu.nl\/~loffl001\/publications\/slides\/tree_in_a_box.pdf\">slides<\/a>]<\/td>\n<td>S<\/td>\n<\/tr>\n<tr>\n<td>15:35 \u2013 15:45<\/td>\n<td colspan=\"2\">Short break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Best paper \u2013 Track 1<\/strong> \u2013 Chair: Alexander Wolff<\/td>\n<\/tr>\n<tr>\n<td>15:45 \u2013 16:05<\/td>\n<td>Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D&#8217;Angelo, Vida Dujmovi\u0107, Fabrizio Frati, Stefan Langerman and Alessandra Tappini<br \/>\n<em>Pole Dancing: 3D Morphs for Tree Drawings<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10738\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/BestPaperT1.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>16:05 \u2013 16:35<\/td>\n<td colspan=\"2\">Coffee break<\/td>\n<\/tr>\n<tr>\n<td>16:35 \u2013 17:30<\/td>\n<td colspan=\"2\"><strong>Business meeting<\/strong><\/td>\n<\/tr>\n<tr>\n<td>19:30 \u2013 22:00<\/td>\n<td colspan=\"2\">Conference dinner and <strong>Contest results<\/strong> (<a href=\"https:\/\/dccg.upc.edu\/gd2018\/index.php\/social-activities\/\">restaurant Boo<\/a>)<\/td>\n<\/tr>\n<tr>\n<th colspan=\"3\">\n<h3><\/h3>\n<h3><span style=\"color: #800000;\"><strong>Friday, September 28<\/strong><\/span><\/h3>\n<\/th>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 8 \u2013 Partially fixed drawings <\/strong>\u2013 Chair: Patrizio Angelini<\/td>\n<\/tr>\n<tr>\n<td>09:00 \u2013 09:20<\/td>\n<td>Anna Lubiw, Tillmann Miltzow and Debajyoti Mondal<br \/>\n<em>The Complexity of Drawing a Graph in a Polygonal Region<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1802.06699\">arxiv<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>09:20 \u2013 09:40<\/td>\n<td>Marcel Radermacher and Ignaz Rutter<br \/>\n<em>Inserting an Edge into a Geometric Embedding<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1807.11711\">arxiv<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>09:40 \u2013 10:00<\/td>\n<td>Tamara Mchedlidze and J\u00e9r\u00f4me Urhausen<br \/>\n\u03b2<em>-Stars or On Extending a Drawing of a Connected Subgraph<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10366\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s8t3.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>10:00 \u2013 10:30<\/td>\n<td colspan=\"2\">Coffee break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 9 \u2013 Experiments<\/strong> \u2013 Chair: Daniel Archambault<\/td>\n<\/tr>\n<tr>\n<td>10:30 \u2013 10:50<\/td>\n<td>Felice De Luca, Stephen Kobourov and Helen Purchase<br \/>\n<em>Perception of Symmetries in Drawings of Graphs<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.01031\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s9t1.pdf\">slides<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>10:50 \u2013 11:10<\/td>\n<td>Chien-Chun Ni, Yu-Yao Lin, Xianfeng Gu and Jie Gao<br \/>\n<em>Network Alignment by Discrete Ollivier-Ricci Flow<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1809.00320\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s9t2.pdf\">slides<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>11:10 \u2013 11:30<\/td>\n<td>Hang Chen, Utkarsh Soni, Yafeng Lu, Ross Maciejewski and Stephen Kobourov<br \/>\n<em>Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings)<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.09913\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s9t3.pdf\">slides<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>11:30 \u2013 11:40<\/td>\n<td colspan=\"2\">Short break<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 10 &#8211; <em>yWorks<\/em> session on Orthogonal Drawings<\/strong> \u2013 Chair: Ioannis Tollis<\/td>\n<\/tr>\n<tr>\n<td>11:40 \u2013 12:00<\/td>\n<td>Walter Didimo, Giuseppe Liotta and Maurizio Patrignani<br \/>\n<em>Bend-minimum Orthogonal Drawings in Quadratic Time<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1804.05813\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s10t1.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>12:00 \u2013 12:20<\/td>\n<td>Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis and Alessandra Tappini<br \/>\n<em>Greedy Rectilinear Drawings<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.09063\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s10t2.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>12:20 \u2013 12:40<\/td>\n<td>Evmorfia Argyriou, Sabine Cornelsen, Henry F\u00f6rster, Michael Kaufmann, Martin N\u00f6llenburg, Yoshio Okamoto, Chrysanthi Raftopoulou and Alexander Wolff<br \/>\n<em>Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10536\">arxiv<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>12:40 \u2013 13:00<\/td>\n<td>Giuseppe Liotta, Fabrizio Montecchiani and Alessandra Tappini<br \/>\n<em>Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1807.01247\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s10t4.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>13:00 \u2013 14:30<\/td>\n<td colspan=\"2\">Lunch (restaurant Unity)<\/td>\n<\/tr>\n<tr>\n<td colspan=\"3\"><strong>Session 11 \u2013 <em>Tom Sawyer Software<\/em> session on Realizability. Miscellaneous<\/strong> \u2013 Chair: Giuseppe Di Battista<\/td>\n<\/tr>\n<tr>\n<td>14:30 \u2013 14:50<\/td>\n<td>David Eppstein<br \/>\n<em>Realization and Connectivity of the Graphs of Origami Flat Foldings<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.06013\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s11t1.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>14:50 \u2013 15:10<\/td>\n<td>Stefan Felsner and Manfred Scheucher<br \/>\n<em>Arrangements of Pseudocircles: On Circularizability<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1712.02149\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s11t2.pdf\">slides<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>15:10 \u2013 15:25<\/td>\n<td>Peter Eades, Patrick Healy and Nikola S. Nikolov<br \/>\n<em>The Weighted Barycenter Drawing Recognition Problem<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1809.00628\">arxiv<\/a>] [<a href=\"https:\/\/dccg.upc.edu\/gd2018\/wp-content\/uploads\/2018\/11\/s11t3.pptx\">slides<\/a>]<\/td>\n<td>S<\/td>\n<\/tr>\n<tr>\n<td>15:25 \u2013 15:45<\/td>\n<td>Giacomo Ortali and Ioannis G. Tollis<br \/>\n<em>Algorithms and Bounds for Drawing Directed Graphs<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.10364\">arxiv<\/a>]<\/td>\n<td>T2<\/td>\n<\/tr>\n<tr>\n<td>15:45 \u2013 16:05<\/td>\n<td>Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara and Dieter Mitsche<br \/>\n<em>Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity<\/em> [<a href=\"https:\/\/arxiv.org\/abs\/1808.09024\">arxiv<\/a>]<\/td>\n<td>T1<\/td>\n<\/tr>\n<tr>\n<td>16:05 \u2013 16:15<\/td>\n<td colspan=\"2\">Short break (until votes are counted)<\/td>\n<\/tr>\n<tr>\n<td>16:15 \u2013 16:30<\/td>\n<td colspan=\"2\"><strong>Best Poster and Presentation awards<\/strong>, and Farewell<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"<p>Tuesday, September 25 19:00 &#8211; 21:30 Reception and registration (garden of Torre Girona) Wednesday, September 26 08:30 \u2013 08:50 Registration (Aula Master) 08:50 \u2013 09:00 Opening 09:00 \u2013 10:00 Invited talk: Alexandru Telea \u2013 Chair: Andreas Kerren Image-Based Graph Visualization: Advances and Challenges 10:00 \u2013 10:30 Coffee break Session 1 &#8211; Planarity variants \u2013 Chair: &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/dccg.upc.edu\/gd2018\/index.php\/program\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Program&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":30,"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\/188"}],"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=188"}],"version-history":[{"count":66,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/pages\/188\/revisions"}],"predecessor-version":[{"id":1078,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/pages\/188\/revisions\/1078"}],"wp:attachment":[{"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/media?parent=188"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}