Regular

All Items

• Random Popular Matchings with Incomplete Preference Lists

  Suthee Ruangwises, Toshiya Itoh

  815-835

• Realization of Posets

  Patrice Ossona deMendez

  149-153

• Recognition of Unigraphs through Superposition of Graphs

  Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi

  323-343

• Recognizing IC-Planar and NIC-Planar Graphs

  Franz Brandenburg

  239-271

• Recognizing Partial Cubes in Quadratic Time

  David Eppstein

  269-293

• Recognizing Stick Graphs with and without Length Constraints

  Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink

  657-681

• Reconfiguration of vertex-disjoint shortest paths on graphs

  Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara

  87-101

• Reconfiguring Minimum Dominating Sets in Trees

  Magdalena Lemańska, Paweł Żyliński

  47-61

• Reconstructing Generalized Staircase Polygons with Uniform Step Length

  Nodari Sitchinava, Darren Strash

  431-459

• Rectangle-visibility Layouts of Unions and Products of Trees

  Alice Dean, Joan Hutchinson

  1-21

• Rectilinear Planarity of Partial 2-Trees

  Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

  679-719

• 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