Mathew C. Francis

72 papers A* 1B 5Journal 57Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
Adjacent vertex distinguishing total coloring of 3-degenerate graphs.
CoRR
Diptimaya Behera, Mathew C. Francis, Sreejith K. Pallathumadam
2025 J jnl
Curves, points, incidences and covering.
CoRR
Arijit Bishnu, Mathew C. Francis, Pritam Majumder
2025 J jnl
Some Bounds on the Threshold Dimension of Graphs.
Electron. J. Comb.
Mathew C. Francis, Atrayee Majumder, Rogers Mathew
2025 — conf
Token Sliding Independent Set Reconfiguration on Block Graphs.
FSTTCS
Mathew C. Francis, Veena Prabhakaran
2025 J jnl
Variants of the Gyárfás-Sumner conjecture: Oriented trees and rainbow paths.
J. Graph Theory
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik Murali
2024 J jnl
A
Discret. Math.
Mathew C. Francis, Drimit Pattanayak
2024 — conf
Geometric Covering Number: Covering Points with Curves.
CALDAM
Arijit Bishnu, Mathew C. Francis, Pritam Majumder
2024 J jnl
Token sliding independent set reconfiguration on block graphs.
CoRR
Mathew C. Francis, Veena Prabhakaran
2024 J jnl
Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs.
Electron. J. Comb.
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Ankur Naskar
2023 J jnl
On the Kernel and Related Problems in Interval Digraphs.
Algorithmica
Mathew C. Francis, Pavol Hell, Dalu Jacob
2023 J jnl
The lexicographic method for the threshold cover problem.
Discret. Math.
Mathew C. Francis, Dalu Jacob
2022 J jnl
A p-centered coloring for the grid using O(p) colors.
CoRR
Mathew C. Francis, Drimit Pattanayak
2022 B conf
Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates.
WG
Mathew C. Francis, Atrayee Majumder, Rogers Mathew
2022 J jnl
Extending some results on the second neighborhood conjecture.
Discret. Appl. Math.
Suresh Dara, Mathew C. Francis, Dalu Jacob, N. Narayanan
2022 J jnl
On graphs whose eternal vertex cover number and vertex cover number coincide.
Discret. Appl. Math.
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
2022 J jnl
On subclasses of interval count two and on Fishburn's conjecture.
Discret. Appl. Math.
Mathew C. Francis, Lívia Salgado Medeiros, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter
2021 J jnl
On rectangle intersection graphs with stab number at most two.
Discret. Appl. Math.
Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
2021 B conf
On the Kernel and Related Problems in Interval Digraphs.
ISAAC
Mathew C. Francis, Pavol Hell, Dalu Jacob
2021 J jnl
On the Kernel and Related Problems in Interval Digraphs.
CoRR
Mathew C. Francis, Pavol Hell, Dalu Jacob
2021 J jnl
Recognizing k-Clique Extendible Orderings.
Algorithmica
Mathew C. Francis, Rian Neogi, Venkatesh Raman
2021 J jnl
Representing Graphs as the Intersection of Cographs and Threshold Graphs.
Electron. J. Comb.
Daphna Chacko, Mathew C. Francis
2021 J jnl
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths.
CoRR
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik Murali
2020 J jnl
On the Stab Number of Rectangle Intersection Graphs.
Theory Comput. Syst.
Dibyayan Chakraborty, Mathew C. Francis
2020 B conf
Recognizing k-Clique Extendible Orderings.
WG
Mathew C. Francis, Rian Neogi, Venkatesh Raman
2020 J jnl
Recognizing k-Clique Extendible Orderings.
CoRR
Mathew C. Francis, Rian Neogi, Venkatesh Raman
2020 J jnl
Representing graphs as the intersection of cographs and threshold graphs.
CoRR
Daphna Chacko, Mathew C. Francis
2020 — conf
The Lexicographic Method for the Threshold Cover Problem.
CALDAM
Mathew C. Francis, Dalu Jacob
2020 B conf
The Linear Arboricity Conjecture for 3-Degenerate Graphs.
WG
Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak
2020 J jnl
The linear arboricity conjecture for 3-degenerate graphs.
CoRR
Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak
2019 — conf
On Graphs with Minimal Eternal Vertex Cover Number.
CALDAM
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
2019 — conf
On Rectangle Intersection Graphs with Stab Number at Most Two.
CALDAM
Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
2019 J jnl
On induced colourful paths in triangle-free graphs.
Discret. Appl. Math.
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
2019 J jnl
The Lexicographic Method for the Threshold Cover Problem.
CoRR
Mathew C. Francis, Dalu Jacob
2018 J jnl
Dushnik-Miller dimension of d-dimensional tilings with boxes.
CoRR
Mathew C. Francis, Daniel Gonçalves
2018 J jnl
On Graphs with Minimal Eternal Vertex Cover Number.
CoRR
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier
2018 J jnl
On the stab number of rectangle intersection graphs.
CoRR
Dibyayan Chakraborty, Mathew C. Francis
2018 J jnl
The Second Neighborhood Conjecture for some Special Classes of Graphs.
CoRR
Suresh Dara, Mathew C. Francis, Dalu Jacob, N. Narayanan
2018 J jnl
Uniquely Restricted Matchings in Interval Graphs.
SIAM J. Discret. Math.
Mathew C. Francis, Dalu Jacob, Satyabrata Jana
2017 J jnl
Dushnik-Miller dimension of contact systems of d-dimensional boxes.
Electron. Notes Discret. Math.
Mathew C. Francis, Daniel Gonçalves
2017 J jnl
On Induced Colourful Paths in Triangle-free Graphs.
Electron. Notes Discret. Math.
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
2016 J jnl
Partially Polynomial Kernels for Set Cover and Test Cover.
SIAM J. Discret. Math.
Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
2016 J jnl
Uniquely Restricted Matchings in Interval Graphs.
CoRR
Mathew C. Francis, Dalu Jacob, Satyabrata Jana
2016 J jnl
VPG and EPG bend-numbers of Halin graphs.
Discret. Appl. Math.
Mathew C. Francis, Abhiruk Lahiri
2015 A* conf
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm.
SODA
Mathew C. Francis, Pavol Hell, Juraj Stacho
2015 J jnl
Strong Chromatic Index of Chordless Graphs.
J. Graph Theory
Manu Basavaraju, Mathew C. Francis
2015 J jnl
The Maximum Clique Problem in Multiple Interval Graphs.
Algorithmica
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2015 J jnl
VPG and EPG bend-numbers of Halin Graphs.
CoRR
Mathew C. Francis, Abhiruk Lahiri
2014 J jnl
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs.
SIAM J. Discret. Math.
Mathew C. Francis, Pavol Hell, Juraj Stacho
2014 J jnl
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm.
CoRR
Mathew C. Francis, Pavol Hell, Juraj Stacho
2013 J jnl
Cubicity and Bandwidth.
Graphs Comb.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2013 J jnl
Obstructions to chordal circular-arc graphs of small independence number.
Electron. Notes Discret. Math.
Mathew C. Francis, Pavol Hell, Juraj Stacho
2013 — conf
Partially Polynomial Kernels for Set Cover and Test Cover.
FSTTCS
Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
2013 J jnl
Recognition and Characterization of Chronological Interval Digraphs.
Electron. J. Comb.
Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang
2013 J jnl
Strong chromatic index of chordless graphs
CoRR
Manu Basavaraju, Mathew C. Francis
2012 J jnl
Obstructions to chordal circular-arc graphs of small independence number
CoRR
Mathew C. Francis, Pavol Hell, Juraj Stacho
2012 J jnl
Segment representation of a subclass of co-planar graphs.
Discret. Math.
Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil
2012 J jnl
The Maximum Clique Problem in Multiple Interval Graphs
CoRR
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2012 B conf
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).
WG
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2011 J jnl
Boxicity of Leaf Powers.
Graphs Comb.
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
2011 J jnl
Chordal Bipartite Graphs with High Boxicity.
Graphs Comb.
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
2011 — conf
Contact representations of planar graphs with cubes.
SCG
Stefan Felsner, Mathew C. Francis
2010 J jnl
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes.
Algorithmica
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2010 J jnl
Non-contractible non-edges in 2-connected graphs.
Inf. Process. Lett.
Anita Das, Mathew C. Francis, Rogers Mathew, N. Sadagopan
2009 J jnl
Boxicity of Halin graphs.
Discret. Math.
L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh
2009 — conf
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs.
Graph Theory, Computational Intelligence and Thought
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2009 J jnl
On the Cubicity of Interval Graphs.
Graphs Comb.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2008 J jnl
Boxicity and maximum degree.
J. Comb. Theory B
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2008 — conf
Finding a Box Representation for a Graph in O(n
ICIT
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
2008 J jnl
On the cubicity of AT-free graphs and circular-arc graphs
CoRR
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2007 J jnl
On the Cubicity of Interval Graphs.
Electron. Notes Discret. Math.
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2006 J jnl
Geometric representation of graphs in low dimension
CoRR
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
2006 J jnl
Representing graphs as the intersection of axis-parallel cubes
CoRR
L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan