Naveen Sivadasan

J. Comput. Biol., 2019

Read Mapping on Genome Variation Graphs.

[BibT_eX]

[DOI]

Naga Sai Kavya Vaddadi

Rajgopal Srinivasan

Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

2017

Dichotomy Results on the Hardness of H-free Edge Modification Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

On Polynomial Kernelization of H-free Edge Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Kmerlight: fast and accurate k-mer abundance estimation.

[BibT_eX]

[DOI]

Rajgopal Srinivasan

Kshama Goyal

CoRR, 2016

QR-code based chipless RFID system for unique identification.

[BibT_eX]

[DOI]

G. SriHarsha Vardhan

Ashudeb Dutta

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.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

The chromatic discrepancy of graphs.

[BibT_eX]

[DOI]

Subrahmanyam Kalyanasundaram

Discret. Appl. Math., 2015

Subgraph Similarity Search in Large Graphs.

[BibT_eX]

[DOI]

Kanigalpula Samanvi

CoRR, 2015

Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Approximating the Cubicity of Trees.

[BibT_eX]

[DOI]

Jasine Babu

Manu Basavaraju

Deepak Rajendraprasad

CoRR, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Lower bounds for boxicity.

[BibT_eX]

[DOI]

Abhijin Adiga

Comb., 2014

On Polynomial Kernelization of <i>H</i> -free Edge Deletion.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

GPU accelerated three dimensional unstructured geometric multigrid solver.

[BibT_eX]

[DOI]

Jin Sebastian

Raja Banerjee

Proceedings of the International Conference on High Performance Computing & Simulation, 2014

Parallel AMG solver for three dimensional unstructured grids using GPU.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on High Performance Computing, 2014

2013

Cubicity and Bandwidth.

[BibT_eX]

[DOI]

Graphs Comb., 2013

2011

Boxicity of line graphs.

[BibT_eX]

[DOI]

Rogers Mathew

Discret. Math., 2011

2010

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

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

Online Scheduling with Bounded Migration.

[BibT_eX]

[DOI]

Peter Sanders

Martin Skutella

Math. Oper. Res., 2009

On the cubicity of bipartite graphs.

[BibT_eX]

[DOI]

Anita Das

Inf. Process. Lett., 2009

JDATATRANS for array obfuscation in Java source codes to defeat reverse engineering from decompiled codes.

[BibT_eX]

[DOI]

Praveen Sivadasan

P. Sojan Lal

Proceedings of the 2nd Bangalore Annual Compute Conference, Compute 2009, 2009

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theory, 2009

2008

Boxicity and maximum degree.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2008

The cubicity of hypercube graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

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

[BibT_eX]

[DOI]

Praveen Sivadasan

P. Sojan Lal

CoRR, 2008

2007

Boxicity and treewidth.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2007

A note on the Hadwiger number of circular arc graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

On the Cubicity of Interval Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

On the Hadwiger's conjecture for graph products.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

Representing graphs as the intersection of axis-parallel cubes

[BibT_eX]

[DOI]

CoRR, 2006

Geometric representation of graphs in low dimension

[BibT_eX]

[DOI]

CoRR, 2006

Geometric Representation of Graphs in Low Dimension.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Topology matters: Smoothed competitiveness of metrical task systems.

[BibT_eX]

[DOI]

Guido Schäfer

Theor. Comput. Sci., 2005

On the Hadwiger number of hypercubes and its generalizations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

Online problems and two-player games: algorithms and analysis.

[BibT_eX]

[DOI]

PhD thesis, 2004

2003

Randomized Pursuit-Evasion In Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

All-pairs shortest-paths computation in the presence of negative cycles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Energy Optimal Routing in Radio Networks Using Geometric Data Structures.

[BibT_eX]

[DOI]

René Beier

Peter Sanders