Concise

All Items

• 2-Layer Graph Drawings with Bounded Pathwidth

  David Wood

  843-851

• A faster algorithm for maximum independent set on interval filament graphs

  Darcy Best, Max Ward

  199-205

• A Faster Algorithm for Maximum Induced Matchings on Circle Graphs

  Max Ward, Andrew Gozzard, Michael Wise, Amitava Datta

  389-396

• A Linear-Time Approximation Algorithm for Rotation Distance

  Sean Cleary, Katherine St. John

  385-390

• A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints

  Max Ward, Andrew Gozzard, Amitava Datta

  547-554

• An Approximate Restatement of the Four-Color Theorem

  Atish Das Sarma, Amita Gajewar, Richard Lipton, Danupon Nanongkai

  567-573

• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs

  Nils Kriege, Andre Droschinsky, Petra Mutzel

  607-616

• A Note on Rectilinearity and Angular Resolution

  Hans Bodlaender, Gerard Tel

  89-94

• A Note on the Existence of All (g,f)-Factors

  Radosław Cymer

  555-560

• Approximating Clustering Coefficient and Transitivity

  Thomas Schank, Dorothea Wagner

  265-275

• Drawing Kn in Three Dimensions with One Bend per Edge

  Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen Wismath

  287-295

• Embeddings Between Hypercubes and Hypertrees

  R. Sundara Rajan, Paul Manuel, Indra Rajasingh

  361-373

• Fast Approximation of Centrality

  David Eppstein, Joseph Wang

  39-45

• Finding Large Clique Minors is Hard

  David Eppstein

  197-204

• Graphs with Obstacle Number Greater than One

  Leah Wrenn Berman, Glenn Chappell, Jill Faudree, John Gimbel, Chris Hartman, Gordon Williams

  1107-1119

• Homothetic triangle representations of planar graphs

  Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou

  745-753

• Not all planar graphs are in PURE-4-DIR

  Daniel Gonçalves

  293-301

• On the Complexity of the Planar Slope Number Problem

  Udo Hoffmann

  183-193

• On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem

  Pavlos Eirinakis, Matthew Williamson, K. Subramani

  177-181

• Orthogonal-Ordering Constraints are Tough

  Ulrik Brandes, Barbara Pampel

  1-10

• Point-Set Embedding in Three Dimensions

  Henk Meijer, Stephen Wismath

  243-257

• Revising the Fellows-Kaschube $K_{3,3}$ Search

  John Boyer

  513-520

• Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing

  Daniel Summer Magruder, Stefan Bonn

  1027-1038

• The Computational Complexity of the ChordLink Model

  Philipp Kindermann, Jan Sauer, Alexander Wolff

  759-767

• The Maximum Number of Edges in a Three-Dimensional Grid-Drawing

  Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David Wood

  21-26