Naveen Sivadasan

According to our database1, Naveen Sivadasan authored at least 42 papers between 2002 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Multi-label classification for biomedical literature: an overview of the BioCreative VII LitCovid Track for COVID-19 literature topic annotations.
CoRR, 2022

2021
Adiabatic Quantum Feature Selection for Sparse Linear Regression.
Proceedings of the Computational Science - ICCS 2021, 2021

2019
Sequence Alignment on Directed Graphs.
J. Comput. Biol., 2019

Read Mapping on Genome Variation Graphs.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

2017
Dichotomy Results on the Hardness of H-free Edge Modification Problems.
SIAM J. Discret. Math., 2017

On Polynomial Kernelization of H-free Edge Deletion.
Algorithmica, 2017

2016
Kmerlight: fast and accurate k-mer abundance estimation.
CoRR, 2016

QR-code based chipless RFID system for unique identification.
Proceedings of the IEEE International Conference on RFID Technology and Applications, 2016

Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
The chromatic discrepancy of graphs.
Discret. Appl. Math., 2015

Subgraph Similarity Search in Large Graphs.
CoRR, 2015

Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Approximating the Cubicity of Trees.
CoRR, 2014

On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion.
CoRR, 2014

Lower bounds for boxicity.
Comb., 2014

On Polynomial Kernelization of <i>H</i> -free Edge Deletion.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

GPU accelerated three dimensional unstructured geometric multigrid solver.
Proceedings of the International Conference on High Performance Computing & Simulation, 2014

Parallel AMG solver for three dimensional unstructured grids using GPU.
Proceedings of the 21st International Conference on High Performance Computing, 2014

2013
Cubicity and Bandwidth.
Graphs Comb., 2013

2011
Boxicity of line graphs.
Discret. Math., 2011

2010
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes.
Algorithmica, 2010

2009
Online Scheduling with Bounded Migration.
Math. Oper. Res., 2009

On the cubicity of bipartite graphs.
Inf. Process. Lett., 2009

JDATATRANS for array obfuscation in Java source codes to defeat reverse engineering from decompiled codes.
Proceedings of the 2nd Bangalore Annual Compute Conference, Compute 2009, 2009

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs.
Proceedings of the Graph Theory, 2009

2008
Boxicity and maximum degree.
J. Comb. Theory, Ser. B, 2008

The cubicity of hypercube graphs.
Discret. Math., 2008

JDATATRANS for Array Obfuscation in Java Source Code to Defeat Reverse Engineering from Decompiled Codes
CoRR, 2008

2007
Boxicity and treewidth.
J. Comb. Theory, Ser. B, 2007

A note on the Hadwiger number of circular arc graphs.
Inf. Process. Lett., 2007

On the Cubicity of Interval Graphs.
Electron. Notes Discret. Math., 2007

On the Hadwiger's conjecture for graph products.
Discret. Math., 2007

2006
Representing graphs as the intersection of axis-parallel cubes
CoRR, 2006

Geometric representation of graphs in low dimension
CoRR, 2006

Geometric Representation of Graphs in Low Dimension.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Topology matters: Smoothed competitiveness of metrical task systems.
Theor. Comput. Sci., 2005

On the Hadwiger number of hypercubes and its generalizations.
Electron. Notes Discret. Math., 2005

2004
Online problems and two-player games: algorithms and analysis.
PhD thesis, 2004

2003
Randomized Pursuit-Evasion In Graphs.
Comb. Probab. Comput., 2003

2002
All-pairs shortest-paths computation in the presence of negative cycles.
Inf. Process. Lett., 2002

Energy Optimal Routing in Radio Networks Using Geometric Data Structures.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002


  Loading...