Regular

All Items

• 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 Near-Optimal Weight Independent Sets at Scale

  Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash

  439-473

• 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

• Fitting Planar Graphs on Planar Maps

  Md. Jawaherul Alam, Michael Kaufmann, Stephen Kobourov, Tamara Mchedlidze

  413-440

• Fixed-Location Circular Arc Drawing of Planar Graphs

  Alon Efrat, Cesim Erten, Stephen Kobourov

  145-164

• Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

  Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager

  131-150

• Flows in One-Crossing-Minor-Free Graphs

  Erin Wolf Chambers, David Eppstein

  201-220

• FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs

  R. Vijayalakshmi, R. Nadarajan, John Roddick, M. Thilaga, P. Nirmala

  753-776

• Fully Dynamic 3-Dimensional Orthogonal Graph Drawing

  M. Closson, S. Gartshore, J. Johansen, S. Wismath

  1-34

• Generalized Bounded Tree Cover of a Graph

  Barun Gorain, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya

  265-280

• Generalized Layerings for Arbitrary and Fixed Drawing Areas

  Ulf Rüegg, Thorsten Ehlers, Miro Spönemann, Reinhard von Hanxleden

  823-856

• Generalizing Geometric Graphs

  Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner

  35-76

• Generating All Triangulations of Plane Graphs

  Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-ichi Nakano

  457-482

• Generating connected and 2-edge connected graphs

  Angela Mestre

  251-281

• Generating Geometric Graphs Using Automorphisms

  Gregory McColm

  507-541

• Genus Distributions of Cubic Outerplanar Graphs

  Jonathan Gross

  295-316

• Geometric RAC Simultaneous Drawings of Graphs

  Evmorfia Argyriou, Michael Bekos, Michael Kaufmann, Antonios Symvonis

  11-34