#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1978

2017

- This year (2)
- Last 5 years (13)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stefan Felsner, Mathew C. Francis
- Symposium on Computational Geometry
- 2011

We prove that every planar graph has a representation using axis-parallel cubes in three dimensions in such a way that there is a cube corresponding to each vertex of the planar graph and two cubes have a non-empty intersection if and only if their corresponding vertices are adjacent. Moreover, when two cubes have a non-empty intersection, they just touch… (More)

- M O Bradley, B Bhuyan, M C Francis, R Langenbach, A Peterson, E Huberman
- Mutation research
- 1981

The report reviews and evaluates the current literature (about 125 primary publications) on chemically induced specific locus mutations in the V79 Chinese hamster lung cell line. The V79 cell is convenient to use for mutagenesis studies since it has a rapid growth rate, high plating efficiency, and a stable karyotype. Mutation can be easily measured at… (More)

- L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
- J. Comb. Theory, Ser. B
- 2008

An axis-parallel d–dimensional box is a Cartesian product R1 × R2 × · · · × Rd where Ri (for 1 ≤ i ≤ d) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension d, such that G is representable as the intersection graph of (axis–parallel) boxes in d–dimensional space. The concept of boxicity… (More)

- L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
- Algorithmica
- 2008

An axis-parallel k-dimensional box is a Cartesian product R 1×R 2×⋅⋅⋅×R k where R i (for 1≤i≤k) is a closed interval of the form [a i ,b i ] on the real line. For a graph G, its boxicity box (G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds… (More)

- Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
- SIAM J. Discrete Math.
- 2013

In a typical covering problem we are given a universe U of size n, a family S (S could be given implicitly) of sizem and an integer k and the objective is to check whether there exists a subfamily S ′ ⊆ S of size at most k satisfying some desired properties. If S ′ is required to contain all the elements of U then it corresponds to the classical Set Cover… (More)

- L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
- Graphs and Combinatorics
- 2011

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We… (More)

- Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
- Algorithmica
- 2012

Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple interval graphs. The MAXIMUM CLIQUE problem, or the problem of finding the size of the maximum clique, is known to be… (More)

- L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
- ArXiv
- 2006

A unit cube in k dimensional space (or k-cube in short) is defined as the Cartesian product R1 × R2 × · · · × Rk where Ri(for 1 ≤ i ≤ k) is a closed interval of the form [ai, ai + 1] on the real line. A k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that two vertices in G are adjacent if and only if their corresponding… (More)

- Mathew C. Francis, Abhiruk Lahiri
- Discrete Applied Mathematics
- 2016

A piecewise linear simple curve in the plane made up of k+1 line segments, each of which is either horizontal or vertical, with consecutive segments being of different orientation is called a k-bend path. Given a graph G, a collection of k-bend paths in which each path corresponds to a vertex in G and two paths have a common point if and only if the… (More)

- Mathew C. Francis, Pavol Hell, Juraj Stacho
- SODA
- 2015

A circular-arc graph is the intersection graph of arcs of a circle. It is a well-studied graph model with numerous natural applications. A certifying algorithm is an algorithm that outputs a certificate, along with its answer (be it positive or negative), where the certificate can be used to easily justify the given answer. While the recognition of… (More)