ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Journal / Conference

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 14.

Chakraborty, D and Chandran, LS and Padinhatteeri, S and Pillai, RR (2024) s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. In: Discrete Applied Mathematics, 345 (345). pp. 170-189.

Chakraborty, D and Das, S and Mukherjee, S and Sahoo, UK and Sen, S (2023) Triangle-free projective-planar graphs with diameter two: Domination and characterization. In: Discrete Applied Mathematics, 331 . pp. 11-24.

Chandran, LS and Lahiri, A and Singh, N (2021) Improved approximation for maximum edge colouring problem. In: Discrete Applied Mathematics .

Babu, J and Chandran, LS and Francis, M and Prabhakaran, V and Rajendraprasad, D and Warrier, NJ (2021) On graphs whose eternal vertex cover number and vertex cover number coincide. In: Discrete Applied Mathematics .

Epstein, D and Golumbic, MC and Lahiri, A and Morgenstern, G (2020) Hardness and approximation for L-EPG and B1-EPG graphs. In: Discrete Applied Mathematics, 281 . pp. 224-228.

Govindarajan, S and Maheshwari, A (2020) Preface: CALDAM 2016. In: Discrete Applied Mathematics, 280 . p. 1.

Basavaraju, M and Chandran, LS and Karthick, T (2012) Maximum weight independent sets in hole- and dart-free graphs. In: Discrete Applied Mathematics, 160 (16-17). pp. 2364-2369.

Panda, BS and Das, Anita (2010) Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms. In: Discrete Applied Mathematics, 158 (17). pp. 1913-1935.

Adiga, Abhijin and Bhowmick, Diptendu and Chandran, Sunil L (2010) The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. In: Discrete Applied Mathematics, 158 (16). pp. 1719-1726.

Kavitha, Telikepalli and Nasre, Meghana (2009) Optimal popular matchings. In: Discrete Applied Mathematics, 157 (14). pp. 3181-3186.

Mahajan, Meena and Subramanya, PR and Vinay, V (2004) The combinatorial approach yields an NC algorithm for computing Pfaffians. In: Discrete Applied Mathematics, 143 (1-3). pp. 1-16.

Chandru, Vijay and DattaSharma, Abhi and Kumar, Anil VS (2003) The algorithmics of folding proteins on lattices. In: Discrete Applied Mathematics, 127 (1). pp. 145-161.

Kumar, PS and Madhavan, CEV (2002) Clique tree generalization and new subclasses of chordal graphs. In: Discrete Applied Mathematics, 117 (1-3). pp. 109-131.

Kumar, P Sreenivasa and Madhavan, C E Veni (1998) Minimal vertex separators of chordal graphs. In: Discrete Applied Mathematics, 89 (1-3). pp. 155-168.

This list was generated on Sun Mar 3 18:57:59 2024 IST.