Mathew C. Francis

According to our database, Mathew C. Francis authored at least 45 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A <i>p</i>-centered coloring for the grid using <i>O</i>(<i>p</i>) colors.

Mathew C. Francis, Drimit Pattanayak

Discret. Math., January, 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

Geometric Covering Number: Covering Points with Curves.

Arijit Bishnu, Mathew C. Francis, Pritam Majumder

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

The lexicographic method for the threshold cover problem.

Mathew C. Francis, Dalu Jacob

Discret. Math., June, 2023

On the Kernel and Related Problems in Interval Digraphs.

Mathew C. Francis, Pavol Hell, Dalu Jacob

Algorithmica, June, 2023

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

Extending some results on the second neighborhood conjecture.

Suresh Dara, Mathew C. Francis, Dalu Jacob, N. Narayanan

Discret. Appl. Math., 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

A p-centered coloring for the grid using O(p) colors.

Mathew C. Francis, Drimit Pattanayak

CoRR, 2022

Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates.

Mathew C. Francis, Atrayee Majumder, Rogers Mathew

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021

On rectangle intersection graphs with stab number at most two.

Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen

Discret. Appl. Math., 2021

Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths.

Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik M

CoRR, 2021

Representing Graphs as the Intersection of Cographs and Threshold Graphs.

Daphna Chacko, Mathew C. Francis

Electron. J. Comb., 2021

Recognizing k-Clique Extendible Orderings.

Mathew C. Francis, Rian Neogi, Venkatesh Raman

Algorithmica, 2021

2020

On the Stab Number of Rectangle Intersection Graphs.

Dibyayan Chakraborty, Mathew C. Francis

Theory Comput. Syst., 2020

The Linear Arboricity Conjecture for 3-Degenerate Graphs.

Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

On Graphs with Minimal Eternal Vertex Cover Number.

Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Uniquely Restricted Matchings in Interval Graphs.

Mathew C. Francis, Dalu Jacob, Satyabrata Jana

SIAM J. Discret. Math., 2018

Dushnik-Miller dimension of d-dimensional tilings with boxes.

Mathew C. Francis, Daniel Gonçalves

CoRR, 2018

The Second Neighborhood Conjecture for some Special Classes of Graphs.

Suresh Dara, Mathew C. Francis, Dalu Jacob, N. Narayanan

CoRR, 2018

2017

Dushnik-Miller dimension of contact systems of d-dimensional boxes.

Mathew C. Francis, Daniel Gonçalves

Electron. Notes Discret. Math., 2017

On Induced Colourful Paths in Triangle-free Graphs.

Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis

Electron. Notes Discret. Math., 2017

2016

Partially Polynomial Kernels for Set Cover and Test Cover.

Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh

SIAM J. Discret. Math., 2016

VPG and EPG bend-numbers of Halin graphs.

Mathew C. Francis, Abhiruk Lahiri

Discret. Appl. Math., 2016

2015

Strong Chromatic Index of Chordless Graphs.

Manu Basavaraju, Mathew C. Francis

J. Graph Theory, 2015

The Maximum Clique Problem in Multiple Interval Graphs.

Mathew C. Francis, Daniel Gonçalves, Pascal Ochem

Algorithmica, 2015

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm.

Mathew C. Francis, Pavol Hell, Juraj Stacho

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Blocking Quadruple: A New Obstruction to Circular-Arc Graphs.

Mathew C. Francis, Pavol Hell, Juraj Stacho

SIAM J. Discret. Math., 2014

2013

Cubicity and Bandwidth.

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

Graphs Comb., 2013

Obstructions to chordal circular-arc graphs of small independence number.

Mathew C. Francis, Pavol Hell, Juraj Stacho

Electron. Notes Discret. Math., 2013

Recognition and Characterization of Chronological Interval Digraphs.

Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang

Electron. J. Comb., 2013

2012

Segment representation of a subclass of co-planar graphs.

Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil

Discret. Math., 2012

The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).

Mathew C. Francis, Daniel Gonçalves, Pascal Ochem

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Chordal Bipartite Graphs with High Boxicity.

L. Sunil Chandran, Mathew C. Francis, Rogers Mathew

Graphs Comb., 2011

Boxicity of Leaf Powers.

L. Sunil Chandran, Mathew C. Francis, Rogers Mathew

Graphs Comb., 2011

Contact representations of planar graphs with cubes.

Stefan Felsner, Mathew C. Francis

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Non-contractible non-edges in 2-connected graphs.

Anita Das, Mathew C. Francis, Rogers Mathew, N. Sadagopan

Inf. Process. Lett., 2010

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes.

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

Algorithmica, 2010

2009

Boxicity of Halin graphs.

L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh

Discret. Math., 2009

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs.

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

Proceedings of the Graph Theory, 2009

2008

Boxicity and maximum degree.

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

J. Comb. Theory B, 2008

Finding a Box Representation for a Graph in O(n²Δ²lnn) Time.

L. Sunil Chandran, Mathew C. Francis, Rogers Mathew

Proceedings of the 2008 International Conference on Information Technology, 2008

2007

On the Cubicity of Interval Graphs.

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

Electron. Notes Discret. Math., 2007

2006

Representing graphs as the intersection of axis-parallel cubes

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

CoRR, 2006

Geometric representation of graphs in low dimension

L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan

CoRR, 2006