Ashwin Jacob

Navedeno

	Vse	Od leta 2019
Navedbe	54	53
indeks h	5	4
indeks i10	1	1

20182019202020212022202320241 2 3 8 6 23 9

Javni dostop

Prikaži vse

3 članki

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Venkatesh RamanProfessor, IMSc ChennaiPreverjeni e-poštni naslov na imsc.res.in
Diptapriyo MajumdarIndraprastha Institute of Information Technology Delhi, IndiaPreverjeni e-poštni naslov na iiitd.ac.in
Vibha SahlotInstitute of Mathematical Sciences, ChennaiPreverjeni e-poštni naslov na iitj.ac.in
Meirav ZehaviBen-Gurion University of the NegevPreverjeni e-poštni naslov na bgu.ac.il
Michal WlodarczykUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Fahad PanolanSchool of Computing, University of LeedsPreverjeni e-poštni naslov na leeds.ac.uk
Aritra BanikAssistant professor, NISERPreverjeni e-poštni naslov na niser.ac.in
Vijay Kumar PaliwalIndian Institute of Technology JodhpurPreverjeni e-poštni naslov na iitj.ac.in
Dishant GoyalResearch Scholar IIT DelhiPreverjeni e-poštni naslov na cse.iitd.ac.in

Spremljaj

Ashwin Jacob

Assistant Professor, Computer Science and Engineering, National Institute of Technology Calicut

Preverjeni e-poštni naslov na nitc.ac.in

Parameterized Algorithms


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Structural parameterizations with modulator oblivion A Jacob, F Panolan, V Raman, V Sahlot Algorithmica 84 (8), 2335-2357, 2022	10	2022
Parameterized complexity of conflict-free set cover A Jacob, D Majumdar, V Raman Theory of Computing Systems 65, 515-540, 2021	7	2021
Fixed-parameter tractability of (n− k) list coloring A Banik, A Jacob, VK Paliwal, V Raman Theory of Computing Systems 64 (7), 1307-1316, 2020	7	2020
Parameterized complexity of deletion to scattered graph classes A Jacob, D Majumdar, V Raman 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020	7	2020
Deconstructing parameterized hardness of fair vertex deletion problems A Jacob, V Raman, V Sahlot International Computing and Combinatorics Conference, 325-337, 2019	5	2019
Long directed detours: Reduction to 2-disjoint paths A Jacob, M Włodarczyk, M Zehavi Information Processing Letters 186, 106491, 2024	4	2024
Structural parameterizations of dominating set variants D Goyal, A Jacob, K Kumar, D Majumdar, V Raman International Computer Science Symposium in Russia, 157-168, 2018	4	2018
Deletion to scattered graph classes I-Case of finite number of graph classes A Jacob, JJH de Kroon, D Majumdar, V Raman Journal of Computer and System Sciences 138, 103460, 2023	3	2023
Deletion to scattered graph classes II-improved FPT algorithms for deletion to pairs of graph classes A Jacob, D Majumdar, V Raman Journal of Computer and System Sciences 136, 280-301, 2023	3	2023
Faster FPT algorithms for deletion to pairs of graph classes A Jacob, D Majumdar, V Raman Fundamentals of Computation Theory: 23rd International Symposium, FCT 2021 …, 2021	3	2021
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing A Jacob, D Majumdar, V Raman Algorithms 16 (3), 144, 2023	1	2023
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large A Jacob, M Włodarczyk, M Zehavi arXiv preprint arXiv:2308.06145, 2023		2023
New Directions in Parameterized deletion problems [HBNI Th216] A Jacob The Institute of Mathematical Sciences, 2022		2022
New Directions in Parameterized Deletion Problems A Jacob Mumbai, 0

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–14

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji