Regular

All Items

• Treewidth and Minimum Fill-in on d-Trapezoid Graphs

  Hans Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller

  1-23

• Treewidth of display graphs: bounds, brambles and applications

  Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu

  715-743

• Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs

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

  81-102

• Triangle-Free Planar Graphs and Segment Intersection Graphs

  Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Alberto Marquez, Marc Noy

  7-26

• Triangle Sparsifiers

  Charalampos Tsourakakis, Mihail Kolountzakis, Gary Miller

  703-726

• Triangulations with Circular Arcs

  Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Kateřina Čech Dobiášová, Bert Jüttler, Günter Rote

  43-65

• Two-floor buildings need eight colors

  Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni

  1-9

• Two-Layer Planarization: Improving on Parameterized Algorithmics

  Henning Fernau

  205-238

• Two Results on Layered Pathwidth and Linear Layouts

  Vida Dujmović, Pat Morin, Céline Yelle

  43-57

• Universal Line-Sets for Drawing Planar 3-Trees

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

  59-79

• Universal Point Sets for Drawing Planar Graphs with Circular Arcs

  Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff

  313-324

• Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks

  Arlind Nocaj, Mark Ortmann, Ulrik Brandes

  595-618

• Upright-Quad Drawing of st-Planar Learning Spaces

  David Eppstein

  51-72

• Upward Embeddings and Orientations of Undirected Planar Graphs

  Walter Didimo, Maurizio Pizzonia

  221-241

• Upward Planar Drawings and Switch-regularity Heuristics

  Walter Didimo

  259-285

• Upward Planar Drawings with Three and More Slopes

  Jonathan Klawitter, Johannes Zink

  49-70

• Upward planar drawings with two slopes

  Jonathan Klawitter, Tamara Mchedlidze

  171-198

• Upward Planarization Layout

  Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong

  127-155

• Using a Significant Spanning Tree to Draw a Directed Graph

  Martin Harrigan, Patrick Healy

  293-317

• Using Graph Layout to Visualize Train Interconnection Data

  Ulrik Brandes, Dorothea Wagner

  135-155

• Variants of Spreading Messages

  T V Thirumala Reddy, C Pandu Rangan

  683-699

• Vertex-Coloring with Defects

  Patrizio Angelini, Michael Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen Kobourov, Fabrizio Montecchiani, Chrysanthi Raftopoulou, Vincenzo Roselli, Antonios Symvonis

  313-340

• Vertex Contact Representations of Paths on a Grid

  Nieke Aerts, Stefan Felsner

  817-849

• Vertex Intersection Graphs of Paths on a Grid

  Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern

  129-150

• Visibility Graphs of Anchor Polygons

  Hossein Boomari, Alireza Zarei

  15-34