default search action
Mathew C. Francis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Ankur Naskar:
Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs. Electron. J. Comb. 31(1) (2024) - [j31]Mathew C. Francis
, Drimit Pattanayak:
A p-centered coloring for the grid using O(p) colors. Discret. Math. 347(1): 113670 (2024) - [c14]Arijit Bishnu, Mathew C. Francis, Pritam Majumder:
Geometric Covering Number: Covering Points with Curves. CALDAM 2024: 88-102 - [i21]Mathew C. Francis, Veena Prabhakaran:
Token sliding independent set reconfiguration on block graphs. CoRR abs/2410.07060 (2024) - 2023
- [j30]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. Algorithmica 85(6): 1522-1559 (2023) - [j29]Mathew C. Francis, Dalu Jacob:
The lexicographic method for the threshold cover problem. Discret. Math. 346(6): 113364 (2023) - 2022
- [j28]Suresh Dara, Mathew C. Francis
Extending some results on the second neighborhood conjecture. Discret. Appl. Math. 311: 1-17 (2022) - [j27]Jasine Babu, L. Sunil Chandran
On graphs whose eternal vertex cover number and vertex cover number coincide. Discret. Appl. Math. 319: 171-182 (2022) - [j26]Mathew C. Francis
On subclasses of interval count two and on Fishburn's conjecture. Discret. Appl. Math. 323: 236-251 (2022) - [c13]Mathew C. Francis
Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates. WG 2022: 244-256 - [i20]Mathew C. Francis, Drimit Pattanayak:
A p-centered coloring for the grid using O(p) colors. CoRR abs/2207.11496 (2022) - 2021
- [j25]Mathew C. Francis
Recognizing k-Clique Extendible Orderings. Algorithmica 83(11): 3338-3362 (2021) - [j24]Daphna Chacko, Mathew C. Francis:
Representing Graphs as the Intersection of Cographs and Threshold Graphs. Electron. J. Comb. 28(3): 3 (2021) - [j23]Dibyayan Chakraborty
On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. 289: 354-365 (2021) - [c12]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. ISAAC 2021: 17:1-17:17 - [i19]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. CoRR abs/2107.08278 (2021) - [i18]Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik Murali:
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths. CoRR abs/2111.13115 (2021) - 2020
- [j22]Dibyayan Chakraborty
On the Stab Number of Rectangle Intersection Graphs. Theory Comput. Syst. 64(5): 681-734 (2020) - [c11]Mathew C. Francis
The Lexicographic Method for the Threshold Cover Problem. CALDAM 2020: 41-52 - [c10]Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. WG 2020: 274-285 - [c9]Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak:
The Linear Arboricity Conjecture for 3-Degenerate Graphs. WG 2020: 376-387 - [i17]Daphna Chacko, Mathew C. Francis:
Representing graphs as the intersection of cographs and threshold graphs. CoRR abs/2001.00798 (2020) - [i16]Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. CoRR abs/2007.06060 (2020) - [i15]Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak:
The linear arboricity conjecture for 3-degenerate graphs. CoRR abs/2007.06066 (2020)
2010 – 2019
- 2019
- [j21]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis
On induced colourful paths in triangle-free graphs. Discret. Appl. Math. 255: 109-116 (2019) - [c8]Dibyayan Chakraborty
On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM 2019: 124-137 - [c7]Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad
On Graphs with Minimal Eternal Vertex Cover Number. CALDAM 2019: 263-273 - [i14]Mathew C. Francis, Dalu Jacob:
The Lexicographic Method for the Threshold Cover Problem. CoRR abs/1912.05819 (2019) - 2018
- [j20]Mathew C. Francis
Uniquely Restricted Matchings in Interval Graphs. SIAM J. Discret. Math. 32(1): 148-172 (2018) - [i13]Dibyayan Chakraborty, Mathew C. Francis:
On the stab number of rectangle intersection graphs. CoRR abs/1804.06571 (2018) - [i12]Suresh Dara, Mathew C. Francis, Dalu Jacob, N. Narayanan:
The Second Neighborhood Conjecture for some Special Classes of Graphs. CoRR abs/1808.02247 (2018) - [i11]Mathew C. Francis, Daniel Gonçalves:
Dushnik-Miller dimension of d-dimensional tilings with boxes. CoRR abs/1809.05287 (2018) - [i10]Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On Graphs with Minimal Eternal Vertex Cover Number. CoRR abs/1812.05125 (2018) - 2017
- [j19]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On Induced Colourful Paths in Triangle-free Graphs. Electron. Notes Discret. Math. 61: 69-75 (2017) - [j18]Mathew C. Francis, Daniel Gonçalves
Dushnik-Miller dimension of contact systems of d-dimensional boxes. Electron. Notes Discret. Math. 61: 467-473 (2017) - 2016
- [j17]Mathew C. Francis, Abhiruk Lahiri:
VPG and EPG bend-numbers of Halin graphs. Discret. Appl. Math. 215: 95-105 (2016) - [j16]Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. SIAM J. Discret. Math. 30(3): 1401-1423 (2016) - [i9]Mathew C. Francis, Dalu Jacob, Satyabrata Jana:
Uniquely Restricted Matchings in Interval Graphs. CoRR abs/1604.07016 (2016) - 2015
- [j15]Mathew C. Francis, Daniel Gonçalves
The Maximum Clique Problem in Multiple Interval Graphs. Algorithmica 71(4): 812-836 (2015) - [j14]Manu Basavaraju, Mathew C. Francis:
Strong Chromatic Index of Chordless Graphs. J. Graph Theory 80(1): 58-68 (2015) - [c6]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. SODA 2015: 1708-1727 - [i8]Mathew C. Francis, Abhiruk Lahiri:
VPG and EPG bend-numbers of Halin Graphs. CoRR abs/1505.06036 (2015) - 2014
- [j13]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. SIAM J. Discret. Math. 28(2): 631-655 (2014) - [i7]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. CoRR abs/1408.2639 (2014) - 2013
- [j12]Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang:
Recognition and Characterization of Chronological Interval Digraphs. Electron. J. Comb. 20(3): 5 (2013) - [j11]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Obstructions to chordal circular-arc graphs of small independence number. Electron. Notes Discret. Math. 44: 75-81 (2013) - [j10]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Cubicity and Bandwidth. Graphs Comb. 29(1): 45-69 (2013) - [c5]Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. FSTTCS 2013: 67-78 - [i6]Manu Basavaraju, Mathew C. Francis:
Strong chromatic index of chordless graphs. CoRR abs/1305.2009 (2013) - 2012
- [j9]Mathew C. Francis, Jan Kratochvíl
Segment representation of a subclass of co-planar graphs. Discret. Math. 312(10): 1815-1818 (2012) - [c4]Mathew C. Francis, Daniel Gonçalves, Pascal Ochem:
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). WG 2012: 57-68 - [i5]Mathew C. Francis, Daniel Gonçalves, Pascal Ochem:
The Maximum Clique Problem in Multiple Interval Graphs. CoRR abs/1201.0043 (2012) - [i4]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Obstructions to chordal circular-arc graphs of small independence number. CoRR abs/1210.5701 (2012) - 2011
- [j8]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
Boxicity of Leaf Powers. Graphs Comb. 27(1): 61-72 (2011) - [j7]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
Chordal Bipartite Graphs with High Boxicity. Graphs Comb. 27(3): 353-362 (2011) - [c3]Stefan Felsner, Mathew C. Francis:
Contact representations of planar graphs with cubes. SCG 2011: 315-320 - 2010
- [j6]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. Algorithmica 56(2): 129-140 (2010) - [j5]Anita Das
Non-contractible non-edges in 2-connected graphs. Inf. Process. Lett. 110(23): 1044-1048 (2010)
2000 – 2009
- 2009
- [j4]L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh:
Boxicity of Halin graphs. Discret. Math. 309(10): 3233-3237 (2009) - [j3]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the Cubicity of Interval Graphs. Graphs Comb. 25(2): 169-179 (2009) - [c2]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. Graph Theory, Computational Intelligence and Thought 2009: 148-157 - 2008
- [j2]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Boxicity and maximum degree. J. Comb. Theory B 98(2): 443-445 (2008) - [c1]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
Finding a Box Representation for a Graph in O(n2Δ2lnn) Time. ICIT 2008: 3-8 - [i3]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the cubicity of AT-free graphs and circular-arc graphs. CoRR abs/0803.3670 (2008) - 2007
- [j1]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the Cubicity of Interval Graphs. Electron. Notes Discret. Math. 29: 315-319 (2007) - 2006
- [i2]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Geometric representation of graphs in low dimension. CoRR abs/cs/0605013 (2006) - [i1]L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Representing graphs as the intersection of axis-parallel cubes. CoRR abs/cs/0607092 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: