Manu Basavaraju

According to our database1, Manu Basavaraju authored at least 34 papers between 2008 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Upper bounds on the acyclic chromatic index of degenerate graphs.
Discret. Math., April, 2024

Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs.
Electron. J. Comb., 2024

2023
Acyclic chromatic index of chordless graphs.
Discret. Math., August, 2023

2022
Gallai's Path Decomposition for 2-degenerate Graphs.
CoRR, 2022

2021
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths.
CoRR, 2021

2020
The Linear Arboricity Conjecture for 3-Degenerate Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Ramsey Numbers for Line Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2018
On the kernelization complexity of string problems.
Theor. Comput. Sci., 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
On Induced Colourful Paths in Triangle-free Graphs.
Electron. Notes Discret. Math., 2017

On finding highly connected spanning subgraphs.
CoRR, 2017

2016
Partially Polynomial Kernels for Set Cover and Test Cover.
SIAM J. Discret. Math., 2016

Maximal Induced Matchings in Triangle-Free Graphs.
J. Graph Theory, 2016

Separation Dimension of Graphs and Hypergraphs.
Algorithmica, 2016

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

Strong Chromatic Index of Chordless Graphs.
J. Graph Theory, 2015

2014
2-Connecting outerplanar graphs without blowing up the pathwidth.
Theor. Comput. Sci., 2014

Rainbow Connection Number of Graph Power and Graph Products.
Graphs Comb., 2014

Rainbow Connection Number and Radius.
Graphs Comb., 2014

Separation dimension of sparse graphs.
CoRR, 2014

Approximating the Cubicity of Trees.
CoRR, 2014

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

Parameterized Algorithms to Preserve Connectivity.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Connecting Vertices by Independent Trees.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2012
Acyclic Edge Coloring of Triangle-Free Planar Graphs.
J. Graph Theory, 2012

Acyclic edge coloring of 2-degenerate graphs.
J. Graph Theory, 2012

Acyclic Chromatic Index of Fully Subdivided Graphs and Halin Graphs.
Discret. Math. Theor. Comput. Sci., 2012

Maximum weight independent sets in hole- and dart-free graphs.
Discret. Appl. Math., 2012

2011
Acyclic Edge-Coloring of Planar Graphs.
SIAM J. Discret. Math., 2011

2010
<i>d</i>-Regular graphs of acyclic chromatic index at least <i>d</i>+2.
J. Graph Theory, 2010

2009
Acyclic edge coloring of graphs with maximum degree 4.
J. Graph Theory, 2009

A note on acyclic edge coloring of complete bipartite graphs.
Discret. Math., 2009

Acyclic Edge coloring of Planar Graphs
CoRR, 2009

2008
Acyclic edge coloring of subcubic graphs.
Discret. Math., 2008


  Loading...