default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManu Basavaraju
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Ankur Naskar:
Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs. Electron. J. Comb. 31(1) (2024)- [j22]Nevil Anto
, Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva:
Upper bounds on the acyclic chromatic index of degenerate graphs. Discret. Math. 347(4): 113898 (2024) - 2023
- [j21]Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva:
Acyclic chromatic index of chordless graphs. Discret. Math. 346(8): 113434 (2023) - [i17]Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva:
Acyclic Chromatic Index of Chordless Graphs. CoRR abs/2302.01638 (2023) - [i16]Nevil Anto, Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva:
Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs. CoRR abs/2305.01948 (2023) - 2022
- [i15]Nevil Anto, Manu Basavaraju:
Gallai's Path Decomposition for 2-degenerate Graphs. CoRR abs/2211.07159 (2022) - 2021
- [i14]Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik Murali:
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths. CoRR abs/2111.13115 (2021) - 2020
- [c10]Huzaifa Abbasi, Manu Basavaraju, Eeshwar Gurushankar, Yash Jivani, Deepak Srikanth:
Ramsey Numbers for Line Graphs. CALDAM 2020: 197-208 - [c9]Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak:
The Linear Arboricity Conjecture for 3-Degenerate Graphs. WG 2020: 376-387 - [i13]Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak:
The linear arboricity conjecture for 3-degenerate graphs. CoRR abs/2007.06066 (2020)
2010 – 2019
- 2019
- [j20]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On induced colourful paths in triangle-free graphs. Discret. Appl. Math. 255: 109-116 (2019) - 2018
- [j19]Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
On the kernelization complexity of string problems. Theor. Comput. Sci. 730: 21-31 (2018) - [c8]Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA 2018: 2838-2850 - 2017
- [j18]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On Induced Colourful Paths in Triangle-free Graphs. Electron. Notes Discret. Math. 61: 69-75 (2017) - [i12]Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
On finding highly connected spanning subgraphs. CoRR abs/1701.02853 (2017) - 2016
- [j17]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Graphs and Hypergraphs. Algorithmica 75(1): 187-204 (2016) - [j16]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory 83(3): 231-250 (2016) - [j15]Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. SIAM J. Discret. Math. 30(3): 1401-1423 (2016) - 2015
- [j14]Manu Basavaraju, Mathew C. Francis:
Strong Chromatic Index of Chordless Graphs. J. Graph Theory 80(1): 58-68 (2015) - [j13]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Bounded Degree Graphs. SIAM J. Discret. Math. 29(1): 59-64 (2015) - 2014
- [j12]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number and Radius. Graphs Comb. 30(2): 275-285 (2014) - [j11]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. Graphs Comb. 30(6): 1363-1382 (2014) - [j10]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-Connecting outerplanar graphs without blowing up the pathwidth. Theor. Comput. Sci. 554: 119-134 (2014) - [c7]Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
On the Kernelization Complexity of String Problems. COCOON 2014: 141-153 - [c6]Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh:
Connecting Vertices by Independent Trees. FSTTCS 2014: 73-84 - [c5]Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms to Preserve Connectivity. ICALP (1) 2014: 800-811 - [c4]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Separation Dimension. WG 2014: 81-92 - [c3]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal Induced Matchings in Triangle-Free Graphs. WG 2014: 93-104 - [i11]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Naveen Sivadasan:
Approximating the Cubicity of Trees. CoRR abs/1402.6310 (2014) - [i10]Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of sparse graphs. CoRR abs/1404.4484 (2014) - [i9]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and separation dimension. CoRR abs/1404.4486 (2014) - [i8]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of bounded degree graphs. CoRR abs/1407.5075 (2014) - 2013
- [c2]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. COCOON 2013: 626-637 - [c1]Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. FSTTCS 2013: 67-78 - [i7]Manu Basavaraju, Mathew C. Francis:
Strong chromatic index of chordless graphs. CoRR abs/1305.2009 (2013) - [i6]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal induced matchings in triangle-free graphs. CoRR abs/1312.5180 (2013) - 2012
- [j9]Manu Basavaraju, L. Sunil Chandran, T. Karthick:
Maximum weight independent sets in hole- and dart-free graphs. Discret. Appl. Math. 160(16-17): 2364-2369 (2012) - [j8]Manu Basavaraju:
Acyclic Chromatic Index of Fully Subdivided Graphs and Halin Graphs. Discret. Math. Theor. Comput. Sci. 14(2): 165-172 (2012) - [j7]Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of 2-degenerate graphs. J. Graph Theory 69(1): 1-27 (2012) - [j6]Manu Basavaraju, L. Sunil Chandran:
Acyclic Edge Coloring of Triangle-Free Planar Graphs. J. Graph Theory 71(4): 365-385 (2012) - [i5]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. CoRR abs/1212.6382 (2012) - 2011
- [j5]Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller:
Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discret. Math. 25(2): 463-478 (2011) - [i4]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. CoRR abs/1104.4190 (2011) - 2010
- [j4]Manu Basavaraju, L. Sunil Chandran, Manoj Kummini:
d-Regular graphs of acyclic chromatic index at least d+2. J. Graph Theory 63(3): 226-230 (2010) - [i3]Manu Basavaraju, L. Sunil Chandran:
Acyclic Edge Coloring of Triangle Free Planar Graphs. CoRR abs/1007.2282 (2010) - [i2]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number and Radius. CoRR abs/1011.0620 (2010)
2000 – 2009
- 2009
- [j3]Manu Basavaraju, L. Sunil Chandran:
A note on acyclic edge coloring of complete bipartite graphs. Discret. Math. 309(13): 4646-4648 (2009) - [j2]Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of graphs with maximum degree 4. J. Graph Theory 61(3): 192-209 (2009) - [i1]Manu Basavaraju, L. Sunil Chandran:
Acyclic Edge coloring of Planar Graphs. CoRR abs/0908.2237 (2009) - 2008
- [j1]Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of subcubic graphs. Discret. Math. 308(24): 6650-6653 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
