Rogers Mathew

Orcid: 0000-0003-4536-1136

Affiliations:
  • Indian Institute of Technology Hyderabad, India


According to our database1, Rogers Mathew authored at least 52 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs.
IEEE Trans. Inf. Theory, June, 2024

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

List Conflict-free Coloring.
CoRR, 2024

Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023
Extremal Results on Conflict-free Coloring.
CoRR, 2023

On Hierarchically Closed Fractional Intersecting Families.
Electron. J. Comb., 2023

2022
Target Set Selection Parameterized by Vertex Cover and More.
Theory Comput. Syst., 2022

Local boxicity and maximum degree.
Discret. Math., 2022

Modular and Fractional $L$-Intersecting Families of Vector Spaces.
Electron. J. Comb., 2022

Conflict-Free Coloring Bounds on Open Neighborhoods.
Algorithmica, 2022

Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
Dimension of CPT Posets.
Order, 2021

A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs.
J. Graph Theory, 2021

Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes.
J. Comb. Theory B, 2021

Fractional Cross Intersecting Families.
Graphs Comb., 2021

Grid obstacle representation of graphs.
Discret. Appl. Math., 2021

Conflict-free coloring on open neighborhoods of claw-free graphs.
CoRR, 2021

2020
A Combinatorial Proof of Fisher's Inequality.
Graphs Comb., 2020

Bisecting and D-secting families for set systems.
Discret. Appl. Math., 2020

System of unbiased representatives for a collection of bicolorings.
Discret. Appl. Math., 2020

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

2019
Fractional L-intersecting Families.
Electron. J. Comb., 2019

2018
Induced-bisecting families of bicolorings for hypergraphs.
Discret. Math., 2018

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

Local Boxicity, Local Dimension, and Maximum Degree.
CoRR, 2018

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

The Induced Separation Dimension of a Graph.
Algorithmica, 2018

2017
Maximum Weighted Independent Sets with a Budget.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number.
Discret. Math., 2016

Bisecting families for set systems.
CoRR, 2016

Separation Dimension of Graphs and Hypergraphs.
Algorithmica, 2016

Induced Separation Dimension.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015
Separation Dimension of Bounded Degree Graphs.
SIAM J. Discret. Math., 2015

Boxicity and cubicity of product graphs.
Eur. J. Comb., 2015

Partial List Colouring of Certain Graphs.
Electron. J. Comb., 2015

2014
Cubicity, degeneracy, and crossing number.
Eur. J. Comb., 2014

Separation dimension of sparse graphs.
CoRR, 2014

Boxicity and Separation Dimension.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013
Bipartite Powers of k-chordal Graphs.
Discret. Math. Theor. Comput. Sci., 2013

A Dirac-type characterization of <i>k</i>-chordal graphs.
Discret. Math., 2013

Product Dimension of Forests and Bounded Treewidth Graphs.
Electron. J. Comb., 2013

2012
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.
ACM Trans. Algorithms, 2012

A Dirac-type Characterization of k-chordal Graphs
CoRR, 2012

Rainbow Connection Number and Connectivity.
Electron. J. Comb., 2012

2011
Chordal Bipartite Graphs with High Boxicity.
Graphs Comb., 2011

Boxicity of Leaf Powers.
Graphs Comb., 2011

Boxicity of line graphs.
Discret. Math., 2011

2010
Non-contractible non-edges in 2-connected graphs.
Inf. Process. Lett., 2010

2008
Faster Algorithms for Incremental Topological Ordering.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Finding a Box Representation for a Graph in O(n<sup>2</sup>Δ<sup>2</sup>lnn) Time.
Proceedings of the 2008 International Conference on Information Technology, 2008

2007
Faster Algorithms for Online Topological Ordering
CoRR, 2007


  Loading...