Regular

All Items

• The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs

  Krishnam Raju Jampani, Anna Lubiw

  283-315

• The SNPR neighbourhood of tree-child networks

  Jonathan Klawitter

  329-355

• The Star and Biclique Coloring and Choosability Problems

  Marina Groshaus, Francisco Soulignac, Pablo Terlisky

  347-383

• The Star Clustering Algorithm for Static and Dynamic Information Organization

  Javed Aslam, Ekaterina Pelekhov, Daniela Rus

  95-129

• The Straight-Line RAC Drawing Problem is NP-Hard

  Evmorfia Argyriou, Michael Bekos, Antonios Symvonis

  569-597

• The Stub Resolution of 1-planar Graphs

  Michael Kaufmann, Jan Kratochvil, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi Raftopoulou, Pavel Valtr

  625-642

• The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant

  Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka

  29-70

• The Traveling Salesman Problem for Cubic Graphs

  David Eppstein

  61-81

• The Unit Bar Visibility Number of a Graph

  Emily Gaub, Michelle Rose, Paul Wenger

  269-297

• The Utility of Untangling

  Vida Dujmović

  121-134

• The Voronoi game on graphs and its complexity

  Sachio Teramoto, Erik Demaine, Ryuhei Uehara

  485-501

• Thrackles, Superthrackles and the Hanani-Tutte Theorem

  Hooman Dehkordi, Graham Farr

  95-127

• Threshold Circuits Detecting Global Patterns in Two-dimensional Maps

  Kei Uchizawa, Daiki Yashima, Xiao Zhou

  115-131

• Time Windowed Data Structures for Graphs

  Farah Chanchary, Anil Maheshwari

  191-226

• Topological Decomposition of Directed Graphs

  Ala Abuthawabeh, Dirk Zeckzer

  589-630

• Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants

  Marcus Schaefer

  367-440

• Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

  Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier

  173-194

• Traversing Directed Eulerian Mazes

  S. Bhatt, Shimon Even, D. Greenberg, R. Tayar

  157-173

• Tree Containment With Soft Polytomies

  Matthias Bentert, Mathias Weller

  417-436

• 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