Faster Algorithms for Online Topological Ordering - Telikepalli Kavitha; Rogers Mathew (CoRR, 2007)

Finding a Box Representation for a Graph in O(n2Δ2lnn) Time. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (ICIT, 2008)

Faster Algorithms for Incremental Topological Ordering. - Bernhard Haeupler; Telikepalli Kavitha; Rogers Mathew; Siddhartha Sen 001; Robert Endre Tarjan (ICALP (1), 2008)

Non-contractible non-edges in 2-connected graphs. - Anita Das 001; Mathew C. Francis; Rogers Mathew; N. Sadagopan (Inf. Process. Lett., 2010)

Boxicity of line graphs. - L. Sunil Chandran; Rogers Mathew; Naveen Sivadasan (Discret. Math., 2011)

Boxicity of Leaf Powers. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (Graphs Comb., 2011)

Chordal Bipartite Graphs with High Boxicity. - L. Sunil Chandran; Mathew C. Francis; Rogers Mathew (Graphs Comb., 2011)

Rainbow Connection Number and Connectivity. - Xueliang Li 001; Sujuan Liu; L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad (Electron. J. Comb., 2012)

A Dirac-type Characterization of k-chordal Graphs - R. Krithika 001; Rogers Mathew; N. S. Narayanaswamy; N. Sadagopan (CoRR, 2012)

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. - Bernhard Haeupler; Telikepalli Kavitha; Rogers Mathew; Siddhartha Sen 001; Robert Endre Tarjan (ACM Trans. Algorithms, 2012)

Product Dimension of Forests and Bounded Treewidth Graphs. - L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad; Roohani Sharma (Electron. J. Comb., 2013)

A Dirac-type characterization of k-chordal graphs. - R. Krithika 001; Rogers Mathew; N. S. Narayanaswamy; N. Sadagopan (Discret. Math., 2013)

Bipartite Powers of k-chordal Graphs. - L. Sunil Chandran; Rogers Mathew (Discret. Math. Theor. Comput. Sci., 2013)

Boxicity and Separation Dimension. - Manu Basavaraju; L. Sunil Chandran; Martin Charles Golumbic; Rogers Mathew; Deepak Rajendraprasad (WG, 2014)

Separation dimension of sparse graphs. - Manu Basavaraju; L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad (CoRR, 2014)

Cubicity, degeneracy, and crossing number. - Abhijin Adiga; L. Sunil Chandran; Rogers Mathew (Eur. J. Comb., 2014)

Partial List Colouring of Certain Graphs. - Jeannette C. M. Janssen; Rogers Mathew; Deepak Rajendraprasad (Electron. J. Comb., 2015)

Boxicity and cubicity of product graphs. - L. Sunil Chandran; Wilfried Imrich; Rogers Mathew; Deepak Rajendraprasad (Eur. J. Comb., 2015)

Separation Dimension of Bounded Degree Graphs. - Noga Alon; Manu Basavaraju; L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad (SIAM J. Discret. Math., 2015)

Induced Separation Dimension. - Emile Ziedan; Deepak Rajendraprasad; Rogers Mathew; Martin Charles Golumbic; Jérémie Dusart (WG, 2016)

Separation Dimension of Graphs and Hypergraphs. - Manu Basavaraju; L. Sunil Chandran; Martin Charles Golumbic; Rogers Mathew; Deepak Rajendraprasad (Algorithmica, 2016)

Bisecting families for set systems. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (CoRR, 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)

Maximum Weighted Independent Sets with a Budget. - Tushar Kalra; Rogers Mathew; Sudebkumar Prasant Pal; Vijay Pandey (CALDAM, 2017)

The Induced Separation Dimension of a Graph. - Emile Ziedan; Deepak Rajendraprasad; Rogers Mathew; Martin Charles Golumbic; Jérémie Dusart (Algorithmica, 2018)

Approximation bounds on maximum edge 2-coloring of dense graphs. - L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad; Nitin Singh (CoRR, 2018)

Local Boxicity, Local Dimension, and Maximum Degree. - Atrayee Majumder; Rogers Mathew (CoRR, 2018)

An Inapproximability Result for the Target Set Selection Problem on Bipartite Graphs. - Suman Banerjee 002; Rogers Mathew (CoRR, 2018)

Induced-bisecting families of bicolorings for hypergraphs. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (Discret. Math., 2018)

Fractional L-intersecting Families. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001 (Electron. J. Comb., 2019)

Conflict-free coloring on closed neighborhoods of bounded degree graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (CoRR, 2020)

System of unbiased representatives for a collection of bicolorings. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (Discret. Appl. Math., 2020)

Bisecting and D-secting families for set systems. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (Discret. Appl. Math., 2020)

A Combinatorial Proof of Fisher's Inequality. - Rogers Mathew; Tapas Kumar Mishra 001 (Graphs Comb., 2020)

Conflict-free coloring on open neighborhoods of claw-free graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (CoRR, 2021)

Grid obstacle representation of graphs. - Arijit Bishnu; Arijit Ghosh; Rogers Mathew; Gopinath Mishra; Subhabrata Paul (Discret. Appl. Math., 2021)

Fractional Cross Intersecting Families. - Rogers Mathew; Ritabrata Ray; Shashank Srivastava (Graphs Comb., 2021)

Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes. - Rogers Mathew; Ilan Newman; Yuri Rabinovich; Deepak Rajendraprasad (J. Comb. Theory B, 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)

Dimension of CPT Posets. - Atrayee Majumder; Rogers Mathew; Deepak Rajendraprasad (Order, 2021)

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (MFCS, 2022)

Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates. - Mathew C. Francis; Atrayee Majumder; Rogers Mathew (WG, 2022)

Conflict-Free Coloring Bounds on Open Neighborhoods. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (Algorithmica, 2022)

Modular and Fractional $L$-Intersecting Families of Vector Spaces. - Rogers Mathew; Tapas Kumar Mishra 001; Ritabrata Ray; Shashank Srivastava (Electron. J. Comb., 2022)

Local boxicity and maximum degree. - Atrayee Majumder; Rogers Mathew (Discret. Math., 2022)

Target Set Selection Parameterized by Vertex Cover and More. - Suman Banerjee 002; Rogers Mathew; Fahad Panolan (Theory Comput. Syst., 2022)

On Hierarchically Closed Fractional Intersecting Families. - Niranjan Balachandran; Srimanta Bhattacharya; Krishn Kher; Rogers Mathew; Brahadeesh Sankarnarayanan (Electron. J. Comb., 2023)

Extremal Results on Conflict-free Coloring. - Shiwali Gupta; Subrahmanyam Kalyanasundaram; Rogers Mathew (CoRR, 2023)

Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem. - Rogers Mathew; Fahad Panolan; Seshikanth (FSTTCS, 2024)

List Conflict-free Coloring. - Shiwali Gupta; Rogers Mathew (CoRR, 2024)

Flexible list colorings: Maximizing the number of requests satisfied. - Hemanshu Kaul; Rogers Mathew; Jeffrey A. Mudrock; Michael J. Pelsmajer (J. Graph Theory, 2024)

New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring. - L. Sunil Chandran; Talha Hashim; Dalu Jacob; Rogers Mathew; Deepak Rajendraprasad; Nitin Singh (Discret. Math., 2024)

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. - Prasad Krishnan; Rogers Mathew; Subrahmanyam Kalyanasundaram (IEEE Trans. Inf. Theory, 2024)

Streaming Algorithms for Conflict-Free Coloring. - Rogers Mathew; Fahad Panolan; Seshikanth (WADS, 2025)

Some Bounds on the Threshold Dimension of Graphs. - Mathew C. Francis; Atrayee Majumder; Rogers Mathew (Electron. J. Comb., 2025)

Conflict-free coloring on subclasses of perfect graphs and bipartite graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (Theor. Comput. Sci., 2025)