| 2009 |
|---|
| 23 | EE | Praveen Sivadasan,
P. Sojan Lal,
Naveen Sivadasan:
JDATATRANS for array obfuscation in Java source codes to defeat reverse engineering from decompiled codes.
Bangalore Compute Conf. 2009: 13 |
| 2008 |
|---|
| 22 | EE | L. Sunil Chandran,
Mathew C. Francis,
Naveen Sivadasan:
On the cubicity of AT-free graphs and circular-arc graphs
CoRR abs/0803.3670: (2008) |
| 21 | EE | Praveen Sivadasan,
P. Sojan Lal,
Naveen Sivadasan:
JDATATRANS for Array Obfuscation in Java Source Code to Defeat Reverse Engineering from Decompiled Codes
CoRR abs/0809.3503: (2008) |
| 20 | EE | L. Sunil Chandran,
Anita Das,
Naveen Sivadasan:
On the cubicity of bipartite graphs
CoRR abs/0810.2697: (2008) |
| 19 | EE | L. Sunil Chandran,
Naveen Sivadasan:
The cubicity of hypercube graphs.
Discrete Mathematics 308(23): 5795-5800 (2008) |
| 18 | EE | L. Sunil Chandran,
Mathew C. Francis,
Naveen Sivadasan:
Boxicity and maximum degree.
J. Comb. Theory, Ser. B 98(2): 443-445 (2008) |
| 2007 |
|---|
| 17 | EE | L. Sunil Chandran,
Naveen Sivadasan:
On the Hadwiger's conjecture for graph products.
Discrete Mathematics 307(2): 266-273 (2007) |
| 16 | EE | L. Sunil Chandran,
Mathew C. Francis,
Naveen Sivadasan:
On the Cubicity of Interval Graphs.
Electronic Notes in Discrete Mathematics 29: 315-319 (2007) |
| 15 | EE | N. S. Narayanaswamy,
N. Belkale,
L. Sunil Chandran,
Naveen Sivadasan:
A note on the Hadwiger number of circular arc graphs.
Inf. Process. Lett. 104(1): 10-13 (2007) |
| 14 | EE | L. Sunil Chandran,
Naveen Sivadasan:
Boxicity and treewidth.
J. Comb. Theory, Ser. B 97(5): 733-744 (2007) |
| 2006 |
|---|
| 13 | EE | L. Sunil Chandran,
Naveen Sivadasan:
Geometric Representation of Graphs in Low Dimension.
COCOON 2006: 398-407 |
| 12 | EE | L. Sunil Chandran,
Mathew C. Francis,
Naveen Sivadasan:
Geometric representation of graphs in low dimension
CoRR abs/cs/0605013: (2006) |
| 11 | EE | L. Sunil Chandran,
Mathew C. Francis,
Naveen Sivadasan:
Representing graphs as the intersection of axis-parallel cubes
CoRR abs/cs/0607092: (2006) |
| 2005 |
|---|
| 10 | EE | Peter Sanders,
Naveen Sivadasan,
Martin Skutella:
Online Scheduling with Bounded Migration.
Algorithms for Optimization with Incomplete Information 2005 |
| 9 | EE | Guido Schäfer,
Naveen Sivadasan:
Topology Matters: Smoothed Competitiveness of Metrical Task Systems.
Algorithms for Optimization with Incomplete Information 2005 |
| 8 | EE | L. Sunil Chandran,
Naveen Sivadasan:
On the Hadwiger number of hypercubes and its generalizations.
Electronic Notes in Discrete Mathematics 19: 155-161 (2005) |
| 7 | EE | Guido Schäfer,
Naveen Sivadasan:
Topology matters: Smoothed competitiveness of metrical task systems.
Theor. Comput. Sci. 341(1-3): 216-246 (2005) |
| 2004 |
|---|
| 6 | EE | Peter Sanders,
Naveen Sivadasan,
Martin Skutella:
Online Scheduling with Bounded Migration.
ICALP 2004: 1111-1122 |
| 5 | EE | Guido Schäfer,
Naveen Sivadasan:
Topology Matters: Smoothed Competitiveness of Metrical Task Systems.
STACS 2004: 489-500 |
| 2003 |
|---|
| 4 | | Micah Adler,
Harald Räcke,
Naveen Sivadasan,
Christian Sohler,
Berthold Vöcking:
Randomized Pursuit-Evasion In Graphs.
Combinatorics, Probability & Computing 12(3): (2003) |
| 2002 |
|---|
| 3 | EE | René Beier,
Peter Sanders,
Naveen Sivadasan:
Energy Optimal Routing in Radio Networks Using Geometric Data Structures.
ICALP 2002: 366-376 |
| 2 | EE | Micah Adler,
Harald Räcke,
Naveen Sivadasan,
Christian Sohler,
Berthold Vöcking:
Randomized Pursuit-Evasion in Graphs.
ICALP 2002: 901-912 |
| 1 | EE | Kurt Mehlhorn,
Volker Priebe,
Guido Schäfer,
Naveen Sivadasan:
All-pairs shortest-paths computation in the presence of negative cycles.
Inf. Process. Lett. 81(6): 341-343 (2002) |
