Homepage of Mathew C. Francis |
|
I have moved to Department of Computer Science, University of Toronto. |
|
My new webpage is available here. |
|
I can be reached at: |
|
my-complete-name-without-spaces-and-the-dot@gmail.com |
|
I was previously a Ph.D. Student at the Department of Computer Science and Automation, Indian Institute of Science, Bangalore. |
Ph. D. Supervisor: Dr. L. Sunil Chandran
Research Interests: Graph Theory, Geometric Intersection Graphs.
My Ph.D. Thesis - “Intersection graphs of boxes and cubes”
Publications
In journals:
Boxicity and Maximum Degree, with L. Sunil Chandran and Naveen Sivadasan, Journal of Combinatorial Theory, Series B, 98(2):443–445, 2008.
On the Cubicity of Interval Graphs, with L. Sunil Chandran and Naveen Sivadasan, Graphs and Combinatorics, 25(2):169–179, 2009.
Boxicity of Halin Graphs, with L. Sunil Chandran and Santhosh Suresh, Discrete Mathematics, 309(10):3233–3237, 2009.
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes, with L. Sunil Chandran and Naveen Sivadasan, Algorithmica, 56(2):129–140, 2010.
Non-contractible Non-edges in 2-connected Graphs, with Anita Das, Rogers Mathew and N. Sadagopan, Information Processing Letters, 110(23), 1044–1048, 2010.
Boxicity of Leaf Powers, with L. Sunil Chandran and Rogers Mathew, accepted for publication in Graphs and Combinatorics, 27(1):61–72, 2011.
Chordal Bipartite Graphs with High Boxicity, with L. Sunil Chandran and Rogers Mathew, accepted for publication in Graphs and Combinatorics.
In conferences:
On the Cubicity of Interval Graphs, with L. Sunil Chandran and Naveen Sivadasan, EuroComb'07, September 2007, Seville, Spain.
Representing Graphs as the Intersection of Axis Parallel Cubes, with L. Sunil Chandran and Naveen Sivadasan, MCDES 2008, May 2008, Bangalore.
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs, with L. Sunil Chandran and Naveen Sivadasan, Graph Theory, Computational Intelligence and Thought, September 2008, Israel.
Chordal Bipartite Graphs with High Boxicity, with L. Sunil Chandran and Rogers Mathew, JCCGG 2009, November 2009, Kanazawa, Japan.
Finding a Box Representation for a Graph in O(n2Δ2ln n) time, with L. Sunil Chandran and Rogers Mathew, ICIT 2008, December 2008, Bhubaneshwar, India.
Contact representations of planar graphs with cubes, with Stefan Felsner, accepted for SoCG 2011, June 2011, Paris.
Unpublished:
Cubicity and bandwidth, with L. Sunil Chandran and Naveen Sivadasan, Submitted.
Segment representation of a subclass of co-planar graphs, with Jan Kratochvíl and Tomáš Vyskočil, Submitted.