Regular

All Items

• Computation in Causal Graphs

  Juli Atherton, Derek Ruths, Adrian Vetta

  317-344

• Computing All Best Swaps for Minimum-Stretch Tree Spanners

  Shantanu Das, Beat Gfeller, Peter Widmayer

  287-306

• Computing and Drawing Isomorphic Subgraphs

  Sabine Bachl, Franz Brandenburg, Daniel Gmach

  215-238

• Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems

  Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph(Seffi) Naor

  1-27

• Computing Betweenness Centrality in Link Streams

  Frédéric Simard, Clémence Magnien, Matthieu Latapy

  195-217

• Computing Communities in Large Networks Using Random Walks

  Pascal Pons, Matthieu Latapy

  191-218

• Computing consensus networks for collections of 1-nested phylogenetic networks

  Katharina Huber, Vincent Moulton, Andreas Spillner

  541-563

• Computing L(p,1)-Labeling with Combined Parameters

  Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono

  241-255

• Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time

  Carola Doerr, G. Ramakrishna, Jens Schmidt

  325-346

• Computing NodeTrix Representations of Clustered Graphs

  Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani

  139-176

• Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

  Van Bang Le, Christian Rosenke

  243-274

• Computing phylogenetic trees using topologically related minimum spanning trees

  Prabhav Kalaghatgi, Thomas Lengauer

  1003-1025

• Computing Radial Drawings on the Minimum Number of Circles

  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer

  365-389

• Computing the Characteristic Polynomial of Threshold Graphs

  David Jacobs, Vilmar Trevisan, Fernando Tura

  709-719

• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

  Matthew Dickerson, David Eppstein, Michael Goodrich, Jeremy Meng

  31-52

• Confluent Hasse Diagrams

  David Eppstein, Joseph Simons

  689-710

• Connected-closeness: A Visual Quantification of Distances in Network Layouts

  Mathieu Jacomy

  341-404

• Connected (s,t)-Vertex Separator Parameterized by Chordality

  N. Narayanaswamy, N. Sadagopan

  549-565

• Connectivity of Planar Graphs

  Hubert de Fraysseix, Patrice Ossona de Mendez

  93-105

• Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

  Tetsuo Asano, Wolfgang Mulzer, Yajun Wang

  569-586

• Constrained Simultaneous and Near-Simultaneous Embeddings

  Fabrizio Frati, Michael Kaufmann, Stephen Kobourov

  447-465

• Constructing Hard Examples for Graph Isomorphism

  Anuj Dawar, Kashif Khan

  293-316

• Construction and Local Routing for Angle-Monotone Graphs

  Anna Lubiw, Debajyoti Mondal

  345-369

• Constructive algorithms for the partial directed weighted improper coloring problem

  Alain Hertz, Romain Montagné, François Gagnon

  159-188

• Contraction and Treewidth Lower Bounds

  Hans Bodlaender, Thomas Wolle, Arie Koster

  5-49