Search the dblp DataBase

Publications of Author

1. L. Sunil Chandran, Naveen Sivadasan
   Geometric Representation of Graphs in Low Dimension. [Citation Graph (0, 0)][DBLP]
   COCOON, 2006, pp:398-407 [Conf]
   
2. Peter Sanders, Naveen Sivadasan, Martin Skutella
   Online Scheduling with Bounded Migration. [Citation Graph (0, 0)][DBLP]
   Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
   
3. Guido Schäfer, Naveen Sivadasan
   Topology Matters: Smoothed Competitiveness of Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
   Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
   
4. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
   Randomized Pursuit-Evasion in Graphs. [Citation Graph (0, 0)][DBLP]
   ICALP, 2002, pp:901-912 [Conf]
   
5. René Beier, Peter Sanders, Naveen Sivadasan
   Energy Optimal Routing in Radio Networks Using Geometric Data Structures. [Citation Graph (0, 0)][DBLP]
   ICALP, 2002, pp:366-376 [Conf]
   
6. Peter Sanders, Naveen Sivadasan, Martin Skutella
   Online Scheduling with Bounded Migration. [Citation Graph (0, 0)][DBLP]
   ICALP, 2004, pp:1111-1122 [Conf]
   
7. Guido Schäfer, Naveen Sivadasan
   Topology Matters: Smoothed Competitiveness of Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
   STACS, 2004, pp:489-500 [Conf]
   
8. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
   Randomized Pursuit-Evasion In Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
   
9. L. Sunil Chandran, Naveen Sivadasan
   On the Hadwiger's conjecture for graph products. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:2, pp:266-273 [Journal]
   
10. Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan
    All-pairs shortest-paths computation in the presence of negative cycles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:6, pp:341-343 [Journal]
    
11. Guido Schäfer, Naveen Sivadasan
    Topology matters: Smoothed competitiveness of metrical task systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:216-246 [Journal]
    
12. L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
    Geometric representation of graphs in low dimension [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
13. L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
    Representing graphs as the intersection of axis-parallel cubes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
14. N. S. Narayanaswamy, N. Belkale, L. Sunil Chandran, Naveen Sivadasan
    A note on the Hadwiger number of circular arc graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:1, pp:10-13 [Journal]
    
15. L. Sunil Chandran, Naveen Sivadasan
    Boxicity and treewidth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:5, pp:733-744 [Journal]
    
16. 
    On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    JDATATRANS for array obfuscation in Java source codes to defeat reverse engineering from decompiled codes. [Citation Graph (, )][DBLP]
    
    
18. 
    Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. [Citation Graph (, )][DBLP]
    
    
19. 
    On the cubicity of AT-free graphs and circular-arc graphs [Citation Graph (, )][DBLP]
    
    
20. 
    JDATATRANS for Array Obfuscation in Java Source Code to Defeat Reverse Engineering from Decompiled Codes [Citation Graph (, )][DBLP]
    
    
21. 
    On the cubicity of bipartite graphs [Citation Graph (, )][DBLP]
    
    
22. 
    The cubicity of hypercube graphs. [Citation Graph (, )][DBLP]