- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j16 |      | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Cubicity and Bandwidth. Graphs and Combinatorics 29(1): 45-69 (2013) |
| 2011 | ||
| j15 | | L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan: Boxicity of line graphs. Discrete Mathematics 311(21): 2359-2367 (2011) |
| 2010 | ||
| j14 | | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. Algorithmica 56(2): 129-140 (2010) |
| i6 | | L. Sunil Chandran, Rogers Mathew, Naveen Sivadasan: Boxicity of Line Graphs. CoRR abs/1009.4471 (2010) |
| 2009 | ||
| j13 | | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the Cubicity of Interval Graphs. Graphs and Combinatorics 25(2): 169-179 (2009) |
| j12 | | L. Sunil Chandran, Anita Das, Naveen Sivadasan: On the cubicity of bipartite graphs. Inf. Process. Lett. 109(9): 432-435 (2009) |
| j11 | | Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. Math. Oper. Res. 34(2): 481-498 (2009) |
| c9 | | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. Graph Theory, Computational Intelligence and Thought 2009: 148-157 |
| c8 | | 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 | ||
| j10 | | L. Sunil Chandran, Naveen Sivadasan: The cubicity of hypercube graphs. Discrete Mathematics 308(23): 5795-5800 (2008) |
| j9 | | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Boxicity and maximum degree. J. Comb. Theory, Ser. B 98(2): 443-445 (2008) |
| i5 | | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the cubicity of AT-free graphs and circular-arc graphs. CoRR abs/0803.3670 (2008) |
| i4 | | 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) |
| i3 | | L. Sunil Chandran, Anita Das, Naveen Sivadasan: On the cubicity of bipartite graphs. CoRR abs/0810.2697 (2008) |
| 2007 | ||
| j8 | | L. Sunil Chandran, Naveen Sivadasan: On the Hadwiger's conjecture for graph products. Discrete Mathematics 307(2): 266-273 (2007) |
| j7 | | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: On the Cubicity of Interval Graphs. Electronic Notes in Discrete Mathematics 29: 315-319 (2007) |
| j6 | | N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan: A note on the Hadwiger number of circular arc graphs. Inf. Process. Lett. 104(1): 10-13 (2007) |
| j5 | | L. Sunil Chandran, Naveen Sivadasan: Boxicity and treewidth. J. Comb. Theory, Ser. B 97(5): 733-744 (2007) |
| 2006 | ||
| c7 | | L. Sunil Chandran, Naveen Sivadasan: Geometric Representation of Graphs in Low Dimension. COCOON 2006: 398-407 |
| i2 | | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Geometric representation of graphs in low dimension. CoRR abs/cs/0605013 (2006) |
| i1 | | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan: Representing graphs as the intersection of axis-parallel cubes. CoRR abs/cs/0607092 (2006) |
| 2005 | ||
| j4 | | L. Sunil Chandran, Naveen Sivadasan: On the Hadwiger number of hypercubes and its generalizations. Electronic Notes in Discrete Mathematics 19: 155-161 (2005) |
| j3 | | Guido Schäfer, Naveen Sivadasan: Topology matters: Smoothed competitiveness of metrical task systems. Theor. Comput. Sci. 341(1-3): 216-246 (2005) |
| c6 | | Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. Algorithms for Optimization with Incomplete Information 2005 |
| c5 | | Guido Schäfer, Naveen Sivadasan: Topology Matters: Smoothed Competitiveness of Metrical Task Systems. Algorithms for Optimization with Incomplete Information 2005 |
| 2004 | ||
| b1 | | Naveen Sivadasan: Online problems and two-player games: algorithms and analysis. Saarland University 2004, pp. 1-95 |
| c4 | | Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. ICALP 2004: 1111-1122 |
| c3 | | Guido Schäfer, Naveen Sivadasan: Topology Matters: Smoothed Competitiveness of Metrical Task Systems. STACS 2004: 489-500 |
| 2003 | ||
| j2 | | Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion In Graphs. Combinatorics, Probability & Computing 12(3): 225-244 (2003) |
| 2002 | ||
| j1 | | 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) |
| c2 | | René Beier, Peter Sanders, Naveen Sivadasan: Energy Optimal Routing in Radio Networks Using Geometric Data Structures. ICALP 2002: 366-376 |
| c1 | | Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912 |
Colors in the list of coauthors
Last update Mon May 20 05:44:50 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page