Rogers Mathew

According to our database, Rogers Mathew authored at least 50 papers between 2007 and 2024.

Collaborative distances:

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

2024

New bounds on the anti-Ramsey numbers of star graphs via maximum edge <i>q</i>-coloring.

L. Sunil Chandran, Talha Hashim, Dalu Jacob, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh

Discret. Math., April, 2024

2023

Extremal Results on Conflict-free Coloring.

Shiwali Gupta, Subrahmanyam Kalyanasundaram, Rogers Mathew

CoRR, 2023

On Hierarchically Closed Fractional Intersecting Families.

Niranjan Balachandran, Srimanta Bhattacharya, Krishn Kher, Rogers Mathew, Brahadeesh Sankarnarayanan

Electron. J. Comb., 2023

2022

Target Set Selection Parameterized by Vertex Cover and More.

Suman Banerjee, Rogers Mathew, Fahad Panolan

Theory Comput. Syst., 2022

Local boxicity and maximum degree.

Atrayee Majumder, Rogers Mathew

Discret. Math., 2022

Modular and Fractional $L$-Intersecting Families of Vector Spaces.

Rogers Mathew, Tapas Kumar Mishra, Ritabrata Ray, Shashank Srivastava

Electron. J. Comb., 2022

Conflict-Free Coloring Bounds on Open Neighborhoods.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

Algorithmica, 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

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Dimension of CPT Posets.

Atrayee Majumder, Rogers Mathew, Deepak Rajendraprasad

Order, 2021

A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

J. Graph Theory, 2021

Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes.

Rogers Mathew, Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad

J. Comb. Theory, Ser. B, 2021

Fractional Cross Intersecting Families.

Rogers Mathew, Ritabrata Ray, Shashank Srivastava

Graphs Comb., 2021

Grid obstacle representation of graphs.

Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul

Discret. Appl. Math., 2021

Conflict-free coloring on open neighborhoods of claw-free graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

CoRR, 2021

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs.

Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

A Combinatorial Proof of Fisher's Inequality.

Rogers Mathew, Tapas Kumar Mishra

Graphs Comb., 2020

Bisecting and D-secting families for set systems.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal

Discret. Appl. Math., 2020

System of unbiased representatives for a collection of bicolorings.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal

Discret. Appl. Math., 2020

Conflict-free coloring on closed neighborhoods of bounded degree graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

CoRR, 2020

2019

Fractional L-intersecting Families.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra

Electron. J. Comb., 2019

2018

Induced-bisecting families of bicolorings for hypergraphs.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal

Discret. Math., 2018

An Inapproximability Result for the Target Set Selection Problem on Bipartite Graphs.

Suman Banerjee, Rogers Mathew

CoRR, 2018

Local Boxicity, Local Dimension, and Maximum Degree.

Atrayee Majumder, Rogers Mathew

CoRR, 2018

Approximation bounds on maximum edge 2-coloring of dense graphs.

L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh

CoRR, 2018

The Induced Separation Dimension of a Graph.

Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart

Algorithmica, 2018

2017

Maximum Weighted Independent Sets with a Budget.

Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number.

L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad

Discret. Math., 2016

Bisecting families for set systems.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal

CoRR, 2016

Separation Dimension of Graphs and Hypergraphs.

Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad

Algorithmica, 2016

Induced Separation Dimension.

Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart

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

2015

Separation Dimension of Bounded Degree Graphs.

Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad

SIAM J. Discret. Math., 2015

Boxicity and cubicity of product graphs.

L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad

Eur. J. Comb., 2015

Partial List Colouring of Certain Graphs.

Jeannette C. M. Janssen, Rogers Mathew, Deepak Rajendraprasad

Electron. J. Comb., 2015

2014

Cubicity, degeneracy, and crossing number.

Abhijin Adiga, L. Sunil Chandran, Rogers Mathew

Eur. J. Comb., 2014

Separation dimension of sparse graphs.

Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad

CoRR, 2014

Boxicity and Separation Dimension.

Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad

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

2013

Bipartite Powers of k-chordal Graphs.

L. Sunil Chandran, Rogers Mathew

Discret. Math. Theor. Comput. Sci., 2013

A Dirac-type characterization of <i>k</i>-chordal graphs.

R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan

Discret. Math., 2013

Product Dimension of Forests and Bounded Treewidth Graphs.

L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma

Electron. J. Comb., 2013

2012

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.

Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan

ACM Trans. Algorithms, 2012

A Dirac-type Characterization of k-chordal Graphs

R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan

CoRR, 2012

Rainbow Connection Number and Connectivity.

Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad

Electron. J. Comb., 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

Boxicity of line graphs.

L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan

Discret. Math., 2011

2010

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

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

Inf. Process. Lett., 2010

2008

Faster Algorithms for Incremental Topological Ordering.

Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 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

Faster Algorithms for Online Topological Ordering

Telikepalli Kavitha, Rogers Mathew

CoRR, 2007