default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRogers Mathew
Person information
- affiliation: Indian Institute of Technology Hyderabad, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j33]L. Sunil Chandran, Talha Hashim, Dalu Jacob, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh:
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring. Discret. Math. 347(4): 113894 (2024)- [j32]Prasad Krishnan
, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. IEEE Trans. Inf. Theory 70(6): 3903-3921 (2024) - 2023
- [j31]Niranjan Balachandran, Srimanta Bhattacharya, Krishn Kher, Rogers Mathew, Brahadeesh Sankarnarayanan:
On Hierarchically Closed Fractional Intersecting Families. Electron. J. Comb. 30(4) (2023) - 2022
- [j30]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-Free Coloring Bounds on Open Neighborhoods. Algorithmica 84(8): 2154-2185 (2022) - [j29]Rogers Mathew, Tapas Kumar Mishra, Ritabrata Ray, Shashank Srivastava:
Modular and Fractional $L$-Intersecting Families of Vector Spaces. Electron. J. Comb. 29(1) (2022) - [j28]Atrayee Majumder, Rogers Mathew:
Local boxicity and maximum degree. Discret. Math. 345(12): 113085 (2022) - [j27]Suman Banerjee, Rogers Mathew, Fahad Panolan:
Target Set Selection Parameterized by Vertex Cover and More. Theory Comput. Syst. 66(5): 996-1018 (2022) - 2021
- [j26]Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul:
Grid obstacle representation of graphs. Discret. Appl. Math. 296: 39-51 (2021) - [j25]Rogers Mathew, Ritabrata Ray, Shashank Srivastava:
Fractional Cross Intersecting Families. Graphs Comb. 37(2): 471-484 (2021) - [j24]Rogers Mathew, Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad:
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes. J. Comb. Theory B 150: 119-143 (2021) - [j23]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs. J. Graph Theory 97(4): 553-556 (2021) - [j22]Atrayee Majumder, Rogers Mathew, Deepak Rajendraprasad:
Dimension of CPT Posets. Order 38(1): 13-19 (2021) - 2020
- [j21]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bisecting and D-secting families for set systems. Discret. Appl. Math. 280: 2-13 (2020) - [j20]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
System of unbiased representatives for a collection of bicolorings. Discret. Appl. Math. 286: 116-127 (2020) - [j19]Rogers Mathew, Tapas Kumar Mishra:
A Combinatorial Proof of Fisher's Inequality. Graphs Comb. 36(6): 1953-1956 (2020) - 2019
- [j18]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra:
Fractional L-intersecting Families. Electron. J. Comb. 26(2): 2 (2019) - 2018
- [j17]Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
The Induced Separation Dimension of a Graph. Algorithmica 80(10): 2834-2848 (2018) - [j16]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Induced-bisecting families of bicolorings for hypergraphs. Discret. Math. 341(6): 1732-1739 (2018) - 2016
- [j15]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Graphs and Hypergraphs. Algorithmica 75(1): 187-204 (2016) - [j14]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number. Discret. Math. 339(2): 443-446 (2016) - 2015
- [j13]Jeannette C. M. Janssen, Rogers Mathew, Deepak Rajendraprasad:
Partial List Colouring of Certain Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j12]L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and cubicity of product graphs. Eur. J. Comb. 48: 100-109 (2015) - [j11]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Bounded Degree Graphs. SIAM J. Discret. Math. 29(1): 59-64 (2015) - 2014
- [j10]Abhijin Adiga, L. Sunil Chandran, Rogers Mathew:
Cubicity, degeneracy, and crossing number. Eur. J. Comb. 35: 2-12 (2014) - 2013
- [j9]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma:
Product Dimension of Forests and Bounded Treewidth Graphs. Electron. J. Comb. 20(3): 42 (2013) - [j8]R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan:
A Dirac-type characterization of k-chordal graphs. Discret. Math. 313(24): 2865-2867 (2013) - [j7]L. Sunil Chandran, Rogers Mathew:
Bipartite Powers of k-chordal Graphs. Discret. Math. Theor. Comput. Sci. 15(2): 49-58 (2013) - 2012
- [j6]Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Rainbow Connection Number and Connectivity. Electron. J. Comb. 19(1): 20 (2012) - [j5]Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Trans. Algorithms 8(1): 3:1-3:33 (2012) - 2011
- [j4]L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan:
Boxicity of line graphs. Discret. Math. 311(21): 2359-2367 (2011) - [j3]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
Boxicity of Leaf Powers. Graphs Comb. 27(1): 61-72 (2011) - [j2]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
Chordal Bipartite Graphs with High Boxicity. Graphs Comb. 27(3): 353-362 (2011) - 2010
- [j1]Anita Das, Mathew C. Francis, Rogers Mathew, N. Sadagopan:
Non-contractible non-edges in 2-connected graphs. Inf. Process. Lett. 110(23): 1044-1048 (2010)
Conference and Workshop Papers
- 2022
- [c9]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. MFCS 2022: 19:1-19:14 - [c8]Mathew C. Francis, Atrayee Majumder, Rogers Mathew:
Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates. WG 2022: 244-256 - 2021
- [c7]Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. ISIT 2021: 214-219 - 2017
- [c6]Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey:
Maximum Weighted Independent Sets with a Budget. CALDAM 2017: 254-266 - 2016
- [c5]Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
Induced Separation Dimension. WG 2016: 121-132 - 2014
- [c4]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Separation Dimension. WG 2014: 81-92 - 2011
- [c3]Abhijin Adiga, L. Sunil Chandran, Rogers Mathew:
Cubicity, Degeneracy, and Crossing Number. FSTTCS 2011: 176-190 - 2008
- [c2]L. Sunil Chandran, Mathew C. Francis, Rogers Mathew:
Finding a Box Representation for a Graph in O(n2Δ2lnn) Time. ICIT 2008: 3-8 - [c1]Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Faster Algorithms for Incremental Topological Ordering. ICALP (1) 2008: 421-433
Informal and Other Publications
- 2024
- [i26]Shiwali Gupta, Rogers Mathew:
List Conflict-free Coloring. CoRR abs/2409.12672 (2024) - 2023
- [i25]Shiwali Gupta, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Extremal Results on Conflict-free Coloring. CoRR abs/2305.02570 (2023) - 2021
- [i24]Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. CoRR abs/2102.02182 (2021) - [i23]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-free coloring on open neighborhoods of claw-free graphs. CoRR abs/2112.12173 (2021) - 2020
- [i22]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-free coloring on closed neighborhoods of bounded degree graphs. CoRR abs/2003.05637 (2020) - [i21]Rogers Mathew, Tapas Kumar Mishra, Ritabrata Ray, Shashank Srivastava:
Modular and fractional L-intersecting families of vector spaces. CoRR abs/2004.04937 (2020) - 2019
- [i20]Rogers Mathew, Ritabrata Ray, Shashank Srivastava:
Fractional cross intersecting families. CoRR abs/1903.01872 (2019) - 2018
- [i19]Atrayee Majumder, Rogers Mathew, Deepak Rajendraprasad:
Dimension of CPT posets. CoRR abs/1802.09326 (2018) - [i18]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra:
Fractional L-intersecting families. CoRR abs/1803.03954 (2018) - [i17]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh:
Approximation bounds on maximum edge 2-coloring of dense graphs. CoRR abs/1810.00624 (2018) - [i16]Atrayee Majumder, Rogers Mathew:
Local Boxicity, Local Dimension, and Maximum Degree. CoRR abs/1810.02963 (2018) - [i15]Suman Banerjee, Rogers Mathew:
An Inapproximability Result for the Target Set Selection Problem on Bipartite Graphs. CoRR abs/1812.01482 (2018) - 2017
- [i14]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
System of unbiased representatives for a collection of bicolorings. CoRR abs/1704.07716 (2017) - [i13]Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul:
Grid obstacle representation of graphs. CoRR abs/1708.01765 (2017) - 2016
- [i12]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bisecting families for set systems. CoRR abs/1604.01482 (2016) - 2015
- [i11]Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey:
Maximum weighted independent sets with a budget. CoRR abs/1506.07773 (2015) - 2014
- [i10]Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of sparse graphs. CoRR abs/1404.4484 (2014) - [i9]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and separation dimension. CoRR abs/1404.4486 (2014) - [i8]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of bounded degree graphs. CoRR abs/1407.5075 (2014) - 2013
- [i7]L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Cubicity of Product Graphs. CoRR abs/1305.5233 (2013) - 2012
- [i6]R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan:
A Dirac-type Characterization of k-chordal Graphs. CoRR abs/1206.5397 (2012) - [i5]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma:
Product Dimension of Forests and Bounded Treewidth Graphs. CoRR abs/1209.2218 (2012) - 2011
- [i4]Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. CoRR abs/1105.2397 (2011) - [i3]Abhijin Adiga, L. Sunil Chandran, Rogers Mathew:
Cubicity, Degeneracy, and Crossing Number. CoRR abs/1105.5225 (2011) - 2010
- [i2]L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan:
Boxicity of Line Graphs. CoRR abs/1009.4471 (2010) - 2007
- [i1]Telikepalli Kavitha, Rogers Mathew:
Faster Algorithms for Online Topological Ordering. CoRR abs/0711.0251 (2007)
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-10-22 21:17 CEST 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:
