| On the parameterized complexity of biclique cover and partition S Chandran, D Issac, A Karrenbauer 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017 | 40 | 2017 |
| Rainbow vertex coloring bipartite graphs and chordal graphs P Heggernes, D Issac, J Lauri, PT Lima, EJ van Leeuwen 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 16 | 2018 |
| A color-blind 3-approximation for chromatic correlation clustering and improved heuristics N Klodt, L Seifert, A Zahn, K Casel, D Issac, T Friedrich Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021 | 10 | 2021 |
| Balanced crown decomposition for connectivity constraints K Casel, T Friedrich, D Issac, A Niklanovits, Z Zeif arXiv preprint arXiv:2011.04528, 2020 | 10 | 2020 |
| Spanning Tree Congestion and Computation of Generalized Gy\H {o} ri-Lov\'{a} sz Partition LS Chandran, YK Cheung, D Issac arXiv preprint arXiv:1802.07632, 2018 | 9 | 2018 |
| Algorithms and bounds for very strong rainbow coloring LS Chandran, A Das, D Issac, EJ van Leeuwen LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018 | 8 | 2018 |
| Fixed-parameter tractability of the weighted edge clique partition problem AE Feldmann, D Issac, A Rai arXiv preprint arXiv:2002.07761, 2020 | 5 | 2020 |
| Hadwiger’s conjecture for squares of 2-trees LS Chandran, D Issac, S Zhou European Journal of Combinatorics 76, 159-174, 2019 | 5 | 2019 |
| Sampling in Space Restricted Settings A Bhattacharya, D Issac, R Jaiswal, A Kumar COCOON 2015, 2014 | 5* | 2014 |
| Approximate max-flow min-multicut theorem for graphs of bounded treewidth T Friedrich, D Issac, N Kumar, N Mallek, Z Zeif Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1325-1334, 2023 | 4 | 2023 |
| Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition M Cooley, CS Greene, D Issac, M Pividori, BD Sullivan SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21 …, 2021 | 4 | 2021 |
| A primal-dual algorithm for multicommodity flows and multicuts in treewidth-2 graphs T Friedrich, D Issac, N Kumar, N Mallek, Z Zeif Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022 | 3 | 2022 |
| Connected -partition of -connected graphs and -claw-free graphs R Borndörfer, K Casel, D Issac, A Niklanovits, S Schwartz, Z Zeif arXiv preprint arXiv:2107.04837, 2021 | 3 | 2021 |
| Upper bounding rainbow connection number by forest number LS Chandran, D Issac, J Lauri, EJ van Leeuwen Discrete Mathematics 345 (7), 112829, 2022 | 2 | 2022 |
| On some covering, partition and connectivity problems in graphs D Issac Saarländische Universitäts-und Landesbibliothek, 2019 | 2 | 2019 |
| Optimal padded decomposition for bounded treewidth graphs A Filtser, T Friedrich, D Issac, N Kumar, H Le, N Mallek, Z Zeif arXiv preprint arXiv:2407.12230, 2024 | 1 | 2024 |
| Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs K Casel, T Friedrich, D Issac, A Niklanovits, Z Zeif International Workshop on Graph-Theoretic Concepts in Computer Science, 143-156, 2023 | 1 | 2023 |
| A Contraction Tree SAT Encoding for Computing Twin-Width Y Horev, S Shay, S Cohen, T Friedrich, D Issac, L Kamma, A Niklanovits, ... Pacific-Asia Conference on Knowledge Discovery and Data Mining, 444-456, 2024 | | 2024 |
| Improved and optimized drug repurposing for the SARS-CoV-2 pandemic S Cohen, M Hershcovitch, M Taraz, O Kißig, D Issac, A Wood, ... Plos one 18 (3), e0266572, 2023 | | 2023 |
| Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover S Angrick, B Bals, K Casel, S Cohen, T Friedrich, N Hastrich, T Hradilak, ... 21st International Symposium on Experimental Algorithms (SEA 2023), 2023 | | 2023 |
L. Sunil ChandranProfessor of Computer Science and Automation, Indian Institute of Science, Bangalore, India.Verified email at iisc.ac.in
