Geometric representation of graphs in low dimension - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (CoRR, 2006)

Representing graphs as the intersection of axis-parallel cubes - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (CoRR, 2006)

On the Cubicity of Interval Graphs. - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (Electron. Notes Discret. Math., 2007)

Finding a Box Representation for a Graph in O(n2Δ2lnn) Time. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (ICIT, 2008)

Boxicity and maximum degree. - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (J. Comb. Theory B, 2008)

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (Graph Theory, Computational Intelligence and Thought, 2009)

Boxicity of Halin graphs. - L. Sunil Chandran; Mathew C. Francis; Santhosh Suresh (Discret. Math., 2009)

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (Algorithmica, 2010)

Non-contractible non-edges in 2-connected graphs. - Anita Das 001; Mathew C. Francis; Rogers Mathew; N. Sadagopan (Inf. Process. Lett., 2010)

Contact representations of planar graphs with cubes. - Stefan Felsner; Mathew C. Francis (SCG, 2011)

Boxicity of Leaf Powers. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (Graphs Comb., 2011)

Chordal Bipartite Graphs with High Boxicity. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (Graphs Comb., 2011)

The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). - Mathew C. Francis; Daniel Gonçalves 001; Pascal Ochem (WG, 2012)

Segment representation of a subclass of co-planar graphs. - Mathew C. Francis; Jan Kratochvíl; Tomás Vyskocil (Discret. Math., 2012)

Recognition and Characterization of Chronological Interval Digraphs. - Sandip Das 001; Mathew C. Francis; Pavol Hell; Jing Huang 007 (Electron. J. Comb., 2013)

Obstructions to chordal circular-arc graphs of small independence number. - Mathew C. Francis; Pavol Hell; Juraj Stacho (Electron. Notes Discret. Math., 2013)

Cubicity and Bandwidth. - L. Sunil Chandran; Mathew C. Francis; Naveen Sivadasan (Graphs Comb., 2013)

Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. - Mathew C. Francis; Pavol Hell; Juraj Stacho (SIAM J. Discret. Math., 2014)

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. - Mathew C. Francis; Pavol Hell; Juraj Stacho (SODA, 2015)

The Maximum Clique Problem in Multiple Interval Graphs. - Mathew C. Francis; Daniel Gonçalves 001; Pascal Ochem (Algorithmica, 2015)

Strong Chromatic Index of Chordless Graphs. - Manu Basavaraju; Mathew C. Francis (J. Graph Theory, 2015)

VPG and EPG bend-numbers of Halin graphs. - Mathew C. Francis; Abhiruk Lahiri (Discret. Appl. Math., 2016)

Partially Polynomial Kernels for Set Cover and Test Cover. - Manu Basavaraju; Mathew C. Francis; M. S. Ramanujan 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2016)

Dushnik-Miller dimension of contact systems of d-dimensional boxes. - Mathew C. Francis; Daniel Gonçalves 001 (Electron. Notes Discret. Math., 2017)

The Second Neighborhood Conjecture for some Special Classes of Graphs. - Suresh Dara 002; Mathew C. Francis; Dalu Jacob; N. Narayanan 001 (CoRR, 2018)

Dushnik-Miller dimension of d-dimensional tilings with boxes. - Mathew C. Francis; Daniel Gonçalves 001 (CoRR, 2018)

Uniquely Restricted Matchings in Interval Graphs. - Mathew C. Francis; Dalu Jacob; Satyabrata Jana (SIAM J. Discret. Math., 2018)

On Graphs with Minimal Eternal Vertex Cover Number. - Jasine Babu; L. Sunil Chandran; Mathew C. Francis; Veena Prabhakaran; Deepak Rajendraprasad; J. Nandini Warrier (CALDAM, 2019)

On induced colourful paths in triangle-free graphs. - Jasine Babu; Manu Basavaraju; L. Sunil Chandran; Mathew C. Francis (Discret. Appl. Math., 2019)

The Linear Arboricity Conjecture for 3-Degenerate Graphs. - Manu Basavaraju; Arijit Bishnu; Mathew C. Francis; Drimit Pattanayak (WG, 2020)

On the Stab Number of Rectangle Intersection Graphs. - Dibyayan Chakraborty; Mathew C. Francis (Theory Comput. Syst., 2020)

Recognizing k-Clique Extendible Orderings. - Mathew C. Francis; Rian Neogi; Venkatesh Raman 001 (Algorithmica, 2021)

Representing Graphs as the Intersection of Cographs and Threshold Graphs. - Daphna Chacko; Mathew C. Francis (Electron. J. Comb., 2021)

On rectangle intersection graphs with stab number at most two. - Dibyayan Chakraborty; Sandip Das 001; Mathew C. Francis; Sagnik Sen 001 (Discret. Appl. Math., 2021)

Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates. - Mathew C. Francis; Atrayee Majumder; Rogers Mathew (WG, 2022)

A p-centered coloring for the grid using O(p) colors. - Mathew C. Francis; Drimit Pattanayak (CoRR, 2022)

On graphs whose eternal vertex cover number and vertex cover number coincide. - Jasine Babu; L. Sunil Chandran; Mathew C. Francis; Veena Prabhakaran; Deepak Rajendraprasad; J. Nandini Warrier (Discret. Appl. Math., 2022)

Extending some results on the second neighborhood conjecture. - Suresh Dara 002; Mathew C. Francis; Dalu Jacob; N. Narayanan 001 (Discret. Appl. Math., 2022)

On subclasses of interval count two and on Fishburn's conjecture. - Mathew C. Francis; Lívia Salgado Medeiros; Fabiano de S. Oliveira; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2022)

On the Kernel and Related Problems in Interval Digraphs. - Mathew C. Francis; Pavol Hell; Dalu Jacob (Algorithmica, 2023)

The lexicographic method for the threshold cover problem. - Mathew C. Francis; Dalu Jacob (Discret. Math., 2023)

Geometric Covering Number: Covering Points with Curves. - Arijit Bishnu; Mathew C. Francis; Pritam Majumder (CALDAM, 2024)

Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs. - Manu Basavaraju; L. Sunil Chandran; Mathew C. Francis; Ankur Naskar (Electron. J. Comb., 2024)

Token sliding independent set reconfiguration on block graphs. - Mathew C. Francis; Veena Prabhakaran (CoRR, 2024)

A p-centered coloring for the grid using O(p) colors. - Mathew C. Francis; Drimit Pattanayak (Discret. Math., 2024)

Some Bounds on the Threshold Dimension of Graphs. - Mathew C. Francis; Atrayee Majumder; Rogers Mathew (Electron. J. Comb., 2025)

Variants of the Gyárfás-Sumner conjecture: Oriented trees and rainbow paths. - Manu Basavaraju; L. Sunil Chandran; Mathew C. Francis; Karthik Murali 001 (J. Graph Theory, 2025)

Curves, points, incidences and covering. - Arijit Bishnu; Mathew C. Francis; Pritam Majumder (CoRR, 2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs. - Diptimaya Behera; Mathew C. Francis; Sreejith K. Pallathumadam (CoRR, 2025)