Regular

All Items

• Equitable colorings of $K_4$-minor-free graphs

  Rémi de Joannis de Verclos, Jean-Sébastien Sereni

  1091-1105

• Essential Constraints of Edge-Constrained Proximity Graphs

  Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel Smid

  389-415

• Estimating the Number of s-t Paths in a Graph

  Ben Roberts, Dirk Kroese

  195-214

• Every graph admits an unambiguous bold drawing

  János Pach

  299-312

• Experimental Analysis of the Accessibility of Drawings with Few Segments

  Philipp Kindermann, Wouter Meulemans, André Schulz

  501-518

• Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs

  Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi

  1-23

• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization

  Matthew Suderman, Sue Whitesides

  149-163

• Exploiting Air-Pressure to Map Floorplans on Point Sets

  Stefan Felsner

  233-252

• Exponential vs. Subexponential Tower of Hanoi Variants

  Daniel Berend, Amir Sapir

  461-479

• Extending Partial Orthogonal Drawings

  Patrizio Angelini, Ignaz Rutter, Sandhya T P

  581-602

• Extreme Distances in Multicolored Point Sets

  Adrian Dumitrescu, Sumanta Guha

  27-38

• Fast approximation of eccentricities and distances in hyperbolic graphs

  Victor Chepoi, Feodor Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed

  393-433

• Fast edge colorings with fixed number of colors to minimize imbalance

  Gruia Calinescu, Michael Pelsmajer

  401-417

• Faster algorithms for shortest path and network flow based on graph decomposition

  Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane

  781-813

• Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem

  Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel Smid

  527-546

• Faster maximal clique enumeration in large real-world link streams

  Alexis Baudin, Clémence Magnien, Lionel Tabourier

  149-178

• Fast Generation of Unlabelled Free Trees using Weight Sequences

  Paul Brown, Trevor Fenner

  219-240

• Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures

  Enrico Nardelli, Guido Proietti, Peter Widmayer

  39-57

• Finding a Maximum Clique in a Grounded 1-Bend String Graph

  J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich

  553-575

• Finding a Maximum-Weight Convex Set in a Chordal Graph

  Jean Cardinal, Jean-Paul Doignon, Keno Merckx

  167-190

• Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

  Mauro Mezzini

  239-257

• Finding Dominators in Practice

  Loukas Georgiadis, Robert Tarjan, Renato Werneck

  69-94

• Finding Hamilton cycles in robustly expanding digraphs

  Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus

  335-358

• Finding Shortest Paths With Computational Geometry

  Po-Shen Loh

  287-303

• Finding the Most Relevant Fragments in Networks

  Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo Silveira, Bettina Speckmann, Thomas Wolle

  307-336