Regular

All Items

• Recursive generation of simple planar 5-regular graphs and pentangulations

  Mahdieh Hasheminezhad, Brendan McKay, Tristan Reeves

  417-436

• Relaxed Agreement Forests of Phylogenetic Trees

  Virginia Ardevol Martinez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matus Mihalak, Georgios Stamoulis

  25-46

• Removing Popular Faces in Curve Arrangements

  Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote

  47-82

• Resource relocation on asymmetric networks

  D. Jacob Wildstrom

  149-163

• Restricted rotation distance between k-ary trees

  Sean Cleary

  19-33

• Rook-drawings of Plane Graphs

  David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun

  103-120

• Rooted Cycle Bases

  David Eppstein, J. Michael McCarthy, Brian Parrish

  663-686

• Saturated simple and 2-simple topological graphs with few edges

  Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz

  117-138

• Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs

  Jannick Borowitz, Ernestine Großmann, Christian Schulz, Dominik Schweisgut

  159-186

• Scheduled Hot-Potato Routing

  Joseph(Seffi) Naor, Ariel Orda, Raphael Rom

  1-20

• Schematic Representation of Large Biconnected Graphs

  Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais

  311-352

• Searching for a Black Hole in a Dynamic Cactus

  Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal

  127-166

• Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

  Seth Pettie

  375-391

• Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles

  Oswin Aichholzer, Joachim Orthaber, Birgit Vogtenhuber

  79-109

• Sequentially Swapping Colored Tokens on Graphs

  Katsuhisa Yamanaka, Erik Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno

  3-27

• Shape-Based Quality Metrics for Large Graph Visualization

  Peter Eades, Seok-Hee Hong, An Nguyen, Karsten Klein

  29-53

• Shelling Hexahedral Complexes for Mesh Generation

  Matthias Müller-Hannemann

  59-91

• Short certificates for chromatic equivalence

  Zoe Bukovac, Graham Farr, Kerri Morgan

  227-269

• Short Plane Supports for Spatial Hypergraphs

  Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan

  463-498

• Show Me Your Best Side: Characteristics of User-Preferred Perspectives for 3D Graph Drawings

  Lucas Joos, Gavin J. Mooney, Maximilian T. Fischer, Daniel A. Keim, Falk Schreiber, Helen C. Purchase, Karsten Klein

  59-119

• Simple and Efficient Bilayer Cross Counting

  Wilhelm Barth, Petra Mutzel, Michael Jünger

  179-194

• Simple Recognition of Halin Graphs and Their Generalizations

  David Eppstein

  323-346

• Simplifying Non-Simple Fan-Planar Drawings

  Boris Klemz, Kristin Knorr, Meghana Reddy, Felix Schröder

  147-172

• Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images

  Xiaodong Wu, Michael Merickel

  215-237

• Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends

  Michael Bekos, Thomas van Dijk, Philipp Kindermann, Alexander Wolff

  133-158