Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Rogers Mathew
Observed names:
Mathew, R.,
Mathew, Rogers
Institution:
Indian Institute of Technology Hyderabad
Observed institutions:
Dalhousie University,
Indian Institute of Technology Kharagpur,
Nankai University,
Indian Institute of Science Bangalore,
Indian Institute of Technology Hyderabad,
University of Haifa
show all 6
ORCID:
0000-0003-4536-1136
Observed ORCID:
0000-0003-4536-1136
OpenAlex ID:
A5076736694
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
2012
·
Bernhard Haeupler
, Telikepalli Kavitha
, et al.
·
ACM Transactions on Algorithms
·
107
PDF
Rainbow Connection Number and Connectivity
2012
·
Xueliang Li
, Sujuan Liu
, et al.
·
The Electronic Journal of Combinatorics
·
37
PDF
Boxicity of line graphs
2011
·
L. Sunil Chandran
, Rogers Mathew
, et al.
·
Discrete Mathematics
·
32
PDF
Faster Algorithms for Incremental Topological Ordering
2008
·
Bernhard Haeupler
, Telikepalli Kavitha
, et al.
·
Lecture notes in computer science
·
30
Chordal Bipartite Graphs with High Boxicity
2011
·
L. Sunil Chandran
, Mathew C. Francis
, et al.
·
Graphs and Combinatorics
·
28
PDF
A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs
2021
·
Sriram Bhyravarapu
, Subrahmanyam Kalyanasundaram
, et al.
·
Journal of Graph Theory
·
18
PDF
Maximum Weighted Independent Sets with a Budget
2017
·
Tushar Kalra
, Rogers Mathew
, et al.
·
Lecture notes in computer science
·
17
PDF
A Dirac-type characterization of k -chordal graphs
2013
·
R. Krithika
, Rogers Mathew
, et al.
·
Discrete Mathematics
·
15
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
2021
·
Prasad Krishnan
, Rogers Mathew
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
13
Separation Dimension of Bounded Degree Graphs
2015
·
Noga Alon
, Manu Basavaraju
, et al.
·
SIAM Journal on Discrete Mathematics
·
13
PDF
Conflict-Free Coloring Bounds on Open Neighborhoods
2022
·
Sriram Bhyravarapu
, Subrahmanyam Kalyanasundaram
, et al.
·
Algorithmica
·
12
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs
2022
·
Bhyravarapu, Sriram
, Kalyanasundaram, Subrahmanyam
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
12
PDF
Flexible list colorings: Maximizing the number of requests satisfied
2024
·
Hemanshu Kaul
, Rogers Mathew
, et al.
·
Journal of Graph Theory
·
11
PDF
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
2024
·
Prasad Krishnan
, Rogers Mathew
, et al.
·
IEEE Transactions on Information Theory
·
11
PDF
Boxicity and cubicity of product graphs
2015
·
L. Sunil Chandran
, Wilfried Imrich
, et al.
·
European Journal of Combinatorics
·
11
PDF
Fractional L-intersecting Families
2019
·
Niranjan Balachandran
, Rogers Mathew
, et al.
·
The Electronic Journal of Combinatorics
·
10
PDF
Separation Dimension of Graphs and Hypergraphs
2015
·
Manu Basavaraju
, L. Sunil Chandran
, et al.
·
Algorithmica
·
10
Boxicity and Separation Dimension
2014
·
Manu Basavaraju
, L. Sunil Chandran
, et al.
·
Lecture notes in computer science
·
9
PDF
Cubicity, degeneracy, and crossing number
2013
·
Abhijin Adiga
, L. Sunil Chandran
, et al.
·
European Journal of Combinatorics
·
9
Faster Algorithms for Online Topological Ordering
2007
·
Kavitha, Telikepalli
, Mathew, Rogers
·
arXiv (Cornell University)
·
9
PDF
The Induced Separation Dimension of a Graph
2017
·
Emile Ziedan
, Deepak Rajendraprasad
, et al.
·
Algorithmica
·
8
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number
2015
·
L. Sunil Chandran
, Rogers Mathew
, et al.
·
Discrete Mathematics
·
7
PDF
Domination in designs
2014
·
Goldberg, Felix
, Rajendraprasad, Deepak
, et al.
·
arXiv (Cornell University)
·
7
PDF
Pairwise Suitable Family of Permutations and Boxicity
2012
·
Basavaraju, Manu
, Chandran, L. Sunil
, et al.
·
arXiv (Cornell University)
·
7
PDF
Boxicity of Leaf Powers
2010
·
L. Sunil Chandran
, Mathew C. Francis
, et al.
·
Graphs and Combinatorics
·
7
PDF
Show more works
View as search
Works count:
68
Citation count:
551
H-index:
12
I10-index:
17
Year
Topic
Type