#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1973

2017

- This year (1)
- Last 5 years (13)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Louigi Addario-Berry, William Sean Kennedy, Andrew D. King, Zhentao Li, Bruce A. Reed
- Discrete Applied Mathematics
- 2010

An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable precisely if every induced subgraph either has a clique cutset, or is a complete multipartite graph or a… (More)

- Peter Cogan, Matthew Andrews, Milan Bradonjic, W. Sean Kennedy, Alessandra Sala, Gabriel Tucci
- HotSocial '12
- 2012

User interactions over social networks has been an emergent theme over the last several years. In contrast to previous work we focus on characterizing user communications patterns around an initial post, or conversation root. Specifically, we focus on how other users respond to these roots and how the complete conversation initiated by this root evolves… (More)

- William Sean Kennedy, Bruce A. Reed
- KyotoCGGT
- 2007

Chvátal defined a skew partition of a graph G to be a partition of its vertex set into two non-empty parts A and B such that A induces a disconnected subgraph of G and B induces a disconnected subgraph of G. Skew partitions are important in the characterization of perfect graphs. De Figuereido et al. presented a polynomial time algorithm which given a graph… (More)

- William Sean Kennedy, Guohui Lin, Guiying Yan
- J. Discrete Algorithms
- 2006

A fundamental problem in computational biology is the phylogeny reconstruction for a set of specific organisms. One of the graph theoretical approaches is to construct a similarity graph on the set of organisms where adjacency indicates evolutionary closeness, and then to reconstruct a phylogeny by computing a tree interconnecting the organisms such that… (More)

- William Sean Kennedy, Onuttom Narayan, Iraj Saniee
- ArXiv
- 2013

Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric characteristic of real-life networks, namely their hyperbolicity. In smooth geometry, hyperbolicity captures the notion of… (More)

- William Sean Kennedy, Andrew D. King
- Discrete Applied Mathematics
- 2013

A lemma of Fouquet implies that a claw-free graph contains an induced C5, contains no odd hole, or is quasi-line. In this paper we use this result to give an improved shortest-oddhole algorithm for claw-free graphs by exploiting the structural relationship between line graphs and quasi-line graphs suggested by Chudnovsky and Seymour’s structure theorem for… (More)

We provide a quasilinear time algorithm for the p-center problem with an additive error less than or equal to 3 times the input graph’s hyperbolic constant. Specifically, for the graph G = (V,E) with n vertices, m edges and hyperbolic constant δ, we construct an algorithm for p-centers in time O(p(δ + 1)(n + m) log(n)) with radius not exceeding rp + δ when… (More)

- Andrew C. Kadak, Martin Z. Bazant, +12 authors Dean Wang
- 2004

A series of one-to-ten-scale experiments were conducted at the Massachusetts Institute of Technology (MIT) to explore several key aspects of pebble flow in pebble-bed reactors. These experiments were done to assess not only the flow lines but also the relative velocities of the pebbles of various radii from the center line of the core. Half-model and full… (More)

- William Sean Kennedy, Guohui Lin
- ISAAC
- 2005

Reconstruction of an evolutionary history for a set of organisms is an important research subject in computational biology. One approach motivated by graph theory constructs a relationship graph based on pairwise evolutionary closeness. The approach builds a tree representation equivalent to this graph such that leaves of the tree, corresponding to the… (More)

- Katherine Edwards, Simon Griffiths, William Sean Kennedy
- APPROX-RANDOM
- 2013

Given an interval I = {1, 2, ..., n} of points, a collection I of subintervals of I and a fraction 0 ≤ r ≤ 1, we consider the following variation of partial set cover. We wish to find an optimal subset of I covering at least an r-fraction of I. While this problem is easily solved exactly in quadratic time using classical methods, we focus on developing… (More)