{"id":860,"date":"2018-07-20T07:53:44","date_gmt":"2018-07-20T07:53:44","guid":{"rendered":"http:\/\/dccg.upc.edu\/gd2018\/?page_id=860"},"modified":"2018-09-07T07:56:43","modified_gmt":"2018-09-07T07:56:43","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/accepted-papers\/","title":{"rendered":"Accepted papers"},"content":{"rendered":"<style>.accepted {clear:right;margin-bottom:20pt;padding:3pt}<\/style>\n<style>.abstract {border-left: solid black 1px;border-right: solid black 1px;border-top: solid black 1px;padding:3pt}<\/style>\n<style>.title {font-style: italic}<\/style>\n<style>.abstract:last-child {border-bottom: solid black 1px;padding:3pt}<\/style>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/tcs.uos.de\">Markus Chimani<\/a>, <a href=\"https:\/\/www.mathematik.uni-osnabrueck.de\/forschung\/ag_stochastik\/doering_hanna.html\">Hanna D\u00f6ring<\/a> and <a href=\"https:\/\/www.mathematik.uni-osnabrueck.de\/index.php?id=1931\">Matthias Reitzner<\/a>. <\/span><span class=\"title\">Crossing Numbers and Stress of Random Graphs<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.math.tu-berlin.de\/~felsner\/\">Stefan Felsner<\/a> and <a href=\"http:\/\/page.math.tu-berlin.de\/~scheuch\/\">Manfred Scheucher<\/a>. <\/span><span class=\"title\">Arrangements of Pseudocircles: On Circularizability<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/www.win.tue.nl\/~tcasterm\/\">Thom Castermans<\/a>, <a href=\"http:\/\/algo.uni-konstanz.de\/members\/garderen\/\">Mereke van Garderen<\/a>, <a href=\"https:\/\/www.win.tue.nl\/~wmeulema\/\">Wouter Meulemans<\/a>, <a href=\"https:\/\/www.ac.tuwien.ac.at\/people\/noellenburg\/\">Martin N\u00f6llenburg<\/a> and Xiaoru Yuan. <\/span><span class=\"title\">Short Plane Supports for Spatial Hypergraphs<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/page.math.tu-berlin.de\/~muetze\/\">Torsten M\u00fctze<\/a> and <a href=\"http:\/\/page.math.tu-berlin.de\/~scheuch\/\">Manfred Scheucher<\/a>. <\/span><span class=\"title\">On L-shaped point set embeddings of trees: First non-embeddable examples<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.ics.uci.edu\/~eppstein\/\">David Eppstein<\/a>. <\/span><span class=\"title\">Realization and Connectivity of the Graphs of Origami Flat Foldings<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\">Almut Demel, Dominik D\u00fcrrschnabel, <a href=\"http:\/\/i11www.iti.uni-karlsruhe.de\/en\/members\/tamara_mchedlidze\/index\">Tamara Mchedlidze<\/a>, <a href=\"https:\/\/i11www.iti.kit.edu\/members\/marcel_radermacher\/index\">Marcel Radermacher<\/a> and Lasse Wulf. <\/span><span class=\"title\">A Greedy Heuristic for Crossing Angle Maximization<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.pfcortese.it\/wordpress\/\">Pier Francesco Cortese<\/a> and <a href=\"http:\/\/www.dia.uniroma3.it\/%7epatrigna\">Maurizio Patrignani<\/a>. <\/span><span class=\"title\">Clustered Planarity = Flat Clustered Planarity<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/chaplick-steven\/\">Steven Chaplick<\/a>, <a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/mitarbeiterinnen\/ehemalige-mitarbeiter\/lipp-fabian\/\">Fabian Lipp<\/a>, <a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/wolff-alexander\/\">Alexander Wolff<\/a> and <a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/zink-johannes\/\">Johannes Zink<\/a>. <\/span><span class=\"title\">Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/informatik.uni-koeln.de\/ls-juenger\/people\/juenger\/\">Michael J\u00fcnger<\/a>, <a href=\"https:\/\/ls11-www.cs.tu-dortmund.de\/staff\/mutzel\">Petra Mutzel<\/a> and <a href=\"https:\/\/ls11-www.cs.tu-dortmund.de\/staff\/spisla\">Christiane Spisla<\/a>. <\/span><span class=\"title\">A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/algo.inf.uni-tuebingen.de\/~bekos\">Michael A. Bekos<\/a>, <a href=\"http:\/\/www.diei.unipg.it\/~digiacomo\">Emilio Di Giacomo<\/a>, <a href=\"http:\/\/mozart.diei.unipg.it\/didimo\">Walter Didimo<\/a>, <a href=\"http:\/\/www.diei.unipg.it\/~liotta\">Giuseppe Liotta<\/a> and <a href=\"http:\/\/mozart.diei.unipg.it\/montecchiani\/\">Fabrizio Montecchiani<\/a>. <\/span><span class=\"title\">Universal Slope Sets for Upward Planar Drawings<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/mozart.diei.unipg.it\/didimo\">Walter Didimo<\/a>, <a href=\"http:\/\/mozart.diei.unipg.it\/liotta\">Giuseppe Liotta<\/a> and <a href=\"http:\/\/www.dia.uniroma3.it\/%7epatrigna\">Maurizio Patrignani<\/a>. <\/span><span class=\"title\">Bend-minimum Orthogonal Drawings in Quadratic Time<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/i11www.iti.kit.edu\/en\/members\/tamara_mchedlidze\/index\">Tamara Mchedlidze<\/a> and <a href=\"http:\/\/www.cs.uu.nl\/staff\/urhausen.html\">J\u00e9r\u00f4me Urhausen<\/a>. <\/span><span class=\"title\">\u03b2-Stars or On Extending a Drawing of a Connected Subgraph<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\">Maya Olszewski, Jeff Meder, Emmanuel Kieffer, <a href=\"http:\/\/moais.imag.fr\/membres\/raphael.bleuse\/\">Rapha\u00ebl Bleuse<\/a>, <a href=\"https:\/\/martinrosalie.gforge.uni.lu\/\">Martin Rosalie<\/a>, <a href=\"http:\/\/danoy.gforge.uni.lu\/\">Gr\u00e9goire Danoy<\/a> and <a href=\"http:\/\/csc.uni.lu\">Pascal Bouvry<\/a>. <\/span><span class=\"title\">Visualizing the Template of a Chaotic Attractor<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\">Anargyros Oikonomou and <a href=\"http:\/\/www.math.ntua.gr\/~symvonis\/\">Antonios Symvonis<\/a>. <\/span><span class=\"title\">Monotone Drawings of k-Inner Planar Graphs<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/?site=mitarbeiter\/patrizioangelini\/index\">Patrizio Angelini<\/a>, <a href=\"http:\/\/algo.inf.uni-tuebingen.de\/~bekos\">Michael A. Bekos<\/a>, <a href=\"http:\/\/algo.inf.uni-tuebingen.de\/~foersth\">Henry F\u00f6rster<\/a> and <a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/\">Michael Kaufmann<\/a>. <\/span><span class=\"title\">On RAC Drawings of Graphs with one Bend per Edge<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.diei.unipg.it\/~liotta\">Giuseppe Liotta<\/a>, <a href=\"http:\/\/mozart.diei.unipg.it\/montecchiani\/\">Fabrizio Montecchiani<\/a> and <a href=\"https:\/\/www.researchgate.net\/profile\/Alessandra_Tappini\">Alessandra Tappini<\/a>. <\/span><span class=\"title\">Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/cgi.cs.arizona.edu\/~felicedeluca\/\">Felice De Luca<\/a>, <a href=\"http:\/\/www.cs.arizona\/edu\/~kobourov\">Stephen Kobourov<\/a> and <a href=\"http:\/\/www.dcs.gla.ac.uk\/~hcp\/\">Helen Purchase<\/a>. <\/span><span class=\"title\">Perception of Symmetries in Drawings of Graphs<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/?site=mitarbeiter\/patrizioangelini\/index\">Patrizio Angelini<\/a>, <a href=\"http:\/\/algo.inf.uni-tuebingen.de\/~bekos\">Michael A. Bekos<\/a>, <a href=\"http:\/\/mozart.diei.unipg.it\/didimo\">Walter Didimo<\/a>, <a href=\"http:\/\/www.diei.unipg.it\/~grilli\/\">Luca Grilli<\/a>, <a href=\"http:\/\/www.fernuni-hagen.de\/ti\/en\/team\/philipp.kindermann.shtml\">Philipp Kindermann<\/a>, <a href=\"http:\/\/i11www.iti.uni-karlsruhe.de\/en\/members\/tamara_mchedlidze\/index\">Tamara Mchedlidze<\/a>, Roman Prutkin, <a href=\"http:\/\/www.math.ntua.gr\/~symvonis\/\">Antonios Symvonis<\/a> and Alessandra Tappini. <\/span><span class=\"title\">Greedy Rectilinear Drawings<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/sites.google.com\/site\/fulekrado\/\">Radoslav Fulek<\/a> and <a href=\"http:\/\/csabatoth.org\/\">Csaba T\u00f3th<\/a>. <\/span><span class=\"title\">Crossing Minimization in Perturbed Drawings<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/www.linkedin.com\/in\/chien-chun-ni-649a0932\">Chien-Chun Ni<\/a>, <a href=\"https:\/\/www.linkedin.com\/in\/yu-yao-lin-9866617b\">Yu-Yao Lin<\/a>, <a href=\"http:\/\/www.cs.sunysb.edu\/~gu\/\">Xianfeng Gu<\/a> and <a href=\"http:\/\/www.cs.sunysb.edu\/~jgao\">Jie Gao<\/a>. <\/span><span class=\"title\">Network Alignment by Discrete Ollivier-Ricci Flow<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.duzce.edu.tr\/\">Zakir Deniz<\/a>, <a href=\"https:\/\/www3.unifr.ch\/inf\/dsor\/en\/group\/esther-galby.html\">Esther Galby<\/a>, <a href=\"https:\/\/pagesperso.g-scop.grenoble-inp.fr\/~munaroa\/\">Andrea Munaro<\/a> and <a href=\"https:\/\/www3.unifr.ch\/inf\/dsor\/en\/group\/bernard-ries.html\">Bernard Ries<\/a>. <\/span><span class=\"title\">On Contact Graphs of Paths on a Grid<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/algo.inf.uni-tuebingen.de\/~bekos\">Michael A. Bekos<\/a>, <a href=\"http:\/\/algo.inf.uni-tuebingen.de\/?site=mitarbeiter\/henryfoerster\/index\">Henry F\u00f6rster<\/a>, Christian Geckeler, Lukas Holl\u00e4nder, <a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/\">Michael Kaufmann<\/a>, Amad\u00e4us M. Spallek and Jan Splett. <\/span><span class=\"title\">A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/?site=mitarbeiter\/michaelkaufmann\/index\">Michael Kaufmann<\/a>, <a href=\"https:\/\/www.math.nyu.edu\/~pach\/\">J\u00e1nos Pach<\/a>, <a href=\"https:\/\/users.renyi.hu\/~geza\/\">G\u00e9za T\u00f3th<\/a> and <a href=\"https:\/\/i11www.iti.kit.edu\/en\/members\/torsten_ueckerdt\/index\">Torsten Ueckerdt<\/a>. <\/span><span class=\"title\">The number of crossings in multigraphs with no empty lens<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/page.math.tu-berlin.de\/~kleist\/\">Linda Kleist<\/a>. <\/span><span class=\"title\">On the Area-Universality of Triangulations<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.cs.arizona.edu\/~mjalam\/\">Jawaherul Md. Alam<\/a>, <a href=\"http:\/\/algo.inf.uni-tuebingen.de\/~bekos\">Michael A. Bekos<\/a>, <a href=\"https:\/\/informatik.uni-koeln.de\/ls-juenger\/people\/gronemann\/\">Martin Gronemann<\/a>, <a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/\">Michael Kaufmann<\/a> and <a href=\"http:\/\/www.cs.arizona.edu\/~spupyrev\/\">Sergey Pupyrev<\/a>. <\/span><span class=\"title\">Queue Layouts of Planar 3-Trees<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.cs.uwaterloo.ca\/~alubiw\/\">Anna Lubiw<\/a>, <a href=\"https:\/\/sites.google.com\/site\/tillshome\/\">Tillmann Miltzow<\/a> and <a href=\"https:\/\/www.cs.usask.ca\/faculty\/dmondal\">Debajyoti Mondal<\/a>. <\/span><span class=\"title\">The Complexity of Drawing a Graph in a Polygonal Region<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><span class=\"authors\"><a href=\"http:\/\/homepages.ulb.ac.be\/~ekhramtc\/\">Elena Arseneva<\/a>, <a href=\"http:\/\/cg.scs.carleton.ca\/~jit\">Prosenjit Bose<\/a>, <a href=\"https:\/\/mat-web.upc.edu\/people\/m.pilar.cano\/\">Pilar Cano<\/a>, Anthony D&#8217;Angelo, <a href=\"http:\/\/cglab.ca\/~vida\/\">Vida Dujmovi\u0107<\/a>, <a href=\"http:\/\/www.dia.uniroma3.it\/~compunet\/www\/view\/person.php?id=frati\">Fabrizio Frati<\/a>, <a href=\"http:\/\/cgm.cs.mcgill.ca\/~sl\/\">Stefan Langerman<\/a> and Alessandra Tappini. <\/span><span class=\"title\">Pole Dancing: 3D Morphs for Tree Drawings<\/span><\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.math.cinvestav.mx\/rfabila\">Ruy Fabila-Monroy<\/a>, <a href=\"https:\/\/www.researchgate.net\/profile\/Carlos_Hidalgo-Toscano\">Carlos Hidalgo-Toscano<\/a>, <a href=\"https:\/\/mat.upc.edu\/en\/people\/clemens.huemer\">Clemens Huemer<\/a>, <a href=\"http:\/\/delta.cs.cinvestav.mx\/~dlara\/home.html\">Dolores Lara<\/a> and <a href=\"https:\/\/math.unice.fr\/~dmitsche\/\">Dieter Mitsche<\/a>. <\/span><span class=\"title\">Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/klammler.eu\/\">Moritz Klammler<\/a>, <a href=\"http:\/\/i11www.iti.uni-karlsruhe.de\/en\/members\/tamara_mchedlidze\/index\">Tamara Mchedlidze<\/a> and Alexey Pak. <\/span><span class=\"title\">Aesthetic Discrimination of Graph Layouts<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.math.ntua.gr\/~fargyriou\/\">Evmorfia Argyriou<\/a>, <a href=\"http:\/\/algo.uni-konstanz.de\/members\/cornelsen\/\">Sabine Cornelsen<\/a>, <a href=\"http:\/\/algo.inf.uni-tuebingen.de\/?site=mitarbeiter\/henryfoerster\/index\">Henry F\u00f6rster<\/a>, <a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/\">Michael Kaufmann<\/a>, <a href=\"https:\/\/www.ac.tuwien.ac.at\/people\/noellenburg\/\">Martin N\u00f6llenburg<\/a>, <a href=\"http:\/\/dopal.cs.uec.ac.jp\/okamotoy\/\">Yoshio Okamoto<\/a>, Chrysanthi Raftopoulou and <a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/wolff-alexander\/\">Alexander Wolff<\/a>. <\/span><span class=\"title\">Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/i11www.iti.kit.edu\/members\/marcel_radermacher\/index\">Marcel Radermacher<\/a> and <a href=\"http:\/\/www.fim.uni-passau.de\/theoretische-informatik\/lehrstuhlteam\/prof-dr-ignaz-rutter\/\">Ignaz Rutter<\/a>. <\/span><span class=\"title\">Inserting an Edge into a Geometric Embedding<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\">Hang Chen, Utkarsh Soni, <a href=\"http:\/\/www.public.asu.edu\/~lyafeng\/\">Yafeng Lu<\/a>, <a href=\"http:\/\/rmaciejewski.faculty.asu.edu\/\">Ross Maciejewski<\/a> and <a href=\"http:\/\/www.cs.arizona\/edu\/~kobourov\">Stephen Kobourov<\/a>. <\/span><span class=\"title\">Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings)<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/pageperso.lif.univ-mrs.fr\/~kolja.knauer\/\">Kolja Knauer<\/a>, <a href=\"http:\/\/page.math.tu-berlin.de\/~micek\/\">Piotr Micek<\/a> and <a href=\"http:\/\/www.math.kit.edu\/iag6\/~ueckerdt\/en\">Torsten Ueckerdt<\/a>. <\/span><span class=\"title\">The Queue Number of Planar Posets<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/www.eecs.tufts.edu\/~halves01\/\">Hugo Akitaya<\/a>, <a href=\"http:\/\/www.staff.science.uu.nl\/~loffl001\">Maarten L\u00f6ffler<\/a> and <a href=\"https:\/\/online.tugraz.at\/tug_online\/visitenkarte.show_vcard?pPersonenId=8FD01744C06858D8&amp;pPersonenGruppe=3\">Irene Parada<\/a>. <\/span><span class=\"title\">How to Fit a Tree in a Box<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www-pr.informatik.uni-tuebingen.de\/?site=mitarbeiter\/patrizioangelini\/index\">Patrizio Angelini<\/a>, <a href=\"https:\/\/sydney.edu.au\/engineering\/people\/peter.eades.php\">Peter Eades<\/a>, <a href=\"http:\/\/www.it.usyd.edu.au\/~shhong\/\">Seok-hee Hong<\/a>, <a href=\"https:\/\/ls11-www.cs.tu-dortmund.de\/people\/klein\/\">Karsten Klein<\/a>, <a href=\"http:\/\/www.cs.arizona\/edu\/~kobourov\">Stephen Kobourov<\/a>, <a href=\"http:\/\/gdv.diei.unipg.it\/view\/person.php?id=liotta\">Giuseppe Liotta<\/a>, <a href=\"http:\/\/www.dmi.unipg.it\/navarra\/\">Alfredo Navarra<\/a> and Alessandra Tappini. <\/span><span class=\"title\">Turning Cliques into Paths to Achieve Planarity<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/i11www.iti.kit.edu\/en\/members\/guido_brueckner\/index\">Guido Br\u00fcckner<\/a>, <a href=\"http:\/\/www.fim.uni-passau.de\/theoretische-informatik\/lehrstuhlteam\/prof-dr-ignaz-rutter\/\">Ignaz Rutter<\/a> and Peter Stumpf. <\/span><span class=\"title\">Level Planarity: Transitivity vs. Even Crossings<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\">Giacomo Ortali and <a href=\"https:\/\/www.csd.uoc.gr\/CSD\/index.jsp?custom=ioannis_tollis&amp;lang=en\">Ioannis G. Tollis<\/a>. <\/span><span class=\"title\">Algorithms and Bounds for Drawing Directed Graphs<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"https:\/\/sydney.edu.au\/engineering\/people\/peter.eades.php\">Peter Eades<\/a>, Patrick Healy and <a href=\"http:\/\/informatika.ftn.uns.ac.rs\/NikolaNikolic\/\">Nikola Nikolovic<\/a>. <\/span><span class=\"title\">The Weighted Barycenter Drawing Recognition Problem<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.dia.uniroma3.it\/~dalozzo\">Giordano Da Lozzo<\/a>, <a href=\"http:\/\/www.dia.uniroma3.it\/people\/gdb\/\">Giuseppe Di Battista<\/a>, <a href=\"http:\/\/www.dia.uniroma3.it\/~compunet\/www\/view\/person.php?id=frati\">Fabrizio Frati<\/a>, <a href=\"http:\/\/www.dia.uniroma3.it\/%7epatrigna\">Maurizio Patrignani<\/a> and <a href=\"http:\/\/www.dia.uniroma3.it\/~roselli\">Vincenzo Roselli<\/a>. <\/span><span class=\"title\">Upward Planar Morphs<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/mozart.diei.unipg.it\/deluca\/\">Felice De Luca<\/a>, <a href=\"http:\/\/cs.arizona.edu\/~hossain\">Md. Iqbal Hossain<\/a>, <a href=\"http:\/\/www.cs.arizona\/edu\/~kobourov\">Stephen Kobourov<\/a>, <a href=\"https:\/\/cs.uwaterloo.ca\/~alubiw\/Site\/Anna_Lubiw.html\">Anna Lubiw<\/a> and <a href=\"https:\/\/www.cs.usask.ca\/faculty\/dmondal\/index.html\">Debajyoti Mondal<\/a>. <\/span><span class=\"title\">Recognition and Drawing of Stick Graphs<\/span><\/li>\n<\/ul>\n<\/div>\n<div class=\"paper\">\n<ul>\n<li><span class=\"authors\"><a href=\"http:\/\/www.fernuni-hagen.de\/ti\/en\/team\/philipp.kindermann.shtml\">Philipp Kindermann<\/a>, <a href=\"http:\/\/mozart.diei.unipg.it\/montecchiani\/\">Fabrizio Montecchiani<\/a>, <a href=\"https:\/\/www.fernuni-hagen.de\/ti\/team\/lena.schlipf.shtml\">Lena Schlipf<\/a> and <a href=\"https:\/\/www.fernuni-hagen.de\/ti\/team\/andre.schulz.shtml\">Andr\u00e9 Schulz<\/a>. <\/span><span class=\"title\">Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles<\/span><\/li>\n<\/ul>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Markus Chimani, Hanna D\u00f6ring and Matthias Reitzner. Crossing Numbers and Stress of Random Graphs Stefan Felsner and Manfred Scheucher. Arrangements of Pseudocircles: On Circularizability Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin N\u00f6llenburg and Xiaoru Yuan. Short Plane Supports for Spatial Hypergraphs Torsten M\u00fctze and Manfred Scheucher. On L-shaped point set embeddings of trees: First &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/dccg.upc.edu\/gd2018\/index.php\/accepted-papers\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Accepted papers&#8221;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":40,"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\/860"}],"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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/comments?post=860"}],"version-history":[{"count":6,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/pages\/860\/revisions"}],"predecessor-version":[{"id":992,"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/pages\/860\/revisions\/992"}],"wp:attachment":[{"href":"https:\/\/dccg.upc.edu\/gd2018\/index.php\/wp-json\/wp\/v2\/media?parent=860"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}