Regular

All Items

• An Algorithm to Construct Greedy Drawings of Triangulations

  Patrizio Angelini, Fabrizio Frati, Luca Grilli

  19-51

• An Approach for Mixed Upward Planarization

  Markus Eiglsperger, Michael Kaufmann, Frank Eppinger

  203-220

• A navigation system for tree space

  Sarah Mark, Jeanette McLeod, Mike Steel

  247-268

• A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs

  Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman, Debajyoti Mondal

  341-352

• An effective crossing minimisation heuristic based on star insertion

  Kieran Clancy, Michael Haythorpe, Alex Newcombe

  135-166

• An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem

  Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick

  383-399

• An Efficient Algorithm for the Transversal Hypergraph Generation

  Dimitris Kavvadias, Elias Stavropoulos

  239-264

• An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing

  Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann

  305-325

• An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks

  Yuma Asada, Fukuhito Ooshita, Michiko Inoue

  59-78

• A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph

  Lev Levitin, Mark Karpovsky, Mehmet Mustafa, Lev Zakrevski

  387-420

• A New Framework for Hierarchical Drawings

  Giacomo Ortali, Ioannis Tollis

  553-578

• A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques

  Takeya Shigezumi, Yushi Uno, Osamu Watanabe

  661-682

• An Experimental Study on the Ply Number of Straight-line Drawings

  Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen Kobourov, Giuseppe Liotta

  71-91

• An FPT algorithm for Tree Deletion Set

  Venkatesh Raman, Saket Saurabh, Ondřej Suchý

  615-628

• Angle Covers: Algorithms and Complexity

  William Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff

  643-661

• An Improved Algorithm for Parameterized Edge Dominating Set Problem

  Ken Iwaide, Hiroshi Nagamochi

  23-58

• An Improvement of Reed’s Treewidth Approximation

  Mahdi Belbasi, Martin Fürer

  257-282

• An Incremental Layout Method for Visualizing Online Dynamic Graphs

  Tarik Crnovrsanin, Jacqueline Chu, Kwan-Liu Ma

  55-80

• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications

  Junhao Gan, Yufei Tao

  297-327

• An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants

  Oswin Aichholzer, Frank Duque, Ruy Fabila-Monroy, Oscar García-Quintero, Carlos Hidalgo-Toscano

  421-432

• A Note on Minimum-Segment Drawings of Planar Graphs

  Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides

  301-328

• A Note on Universal Point Sets for Planar Graphs

  Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner

  247-267

• A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality

  Khaled Elbassioni

  273-280

• A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games

  Louigi Addario-Berry, Neil Olver, Adrian Vetta

  309-319

• Applications of Parameterized st-Orientations

  Charalampos Papamanthou, Ioannis Tollis

  337-365