default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshwin Jacob
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Ashwin Jacob
, Michal Wlodarczyk, Meirav Zehavi:
Long directed detours: Reduction to 2-Disjoint Paths. Inf. Process. Lett. 186: 106491 (2024)- [i8]Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. CoRR abs/2405.10556 (2024) - [i7]Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi:
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. CoRR abs/2409.14209 (2024) - 2023
- [j6]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. Algorithms 16(3): 144 (2023) - [j5]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes. J. Comput. Syst. Sci. 136: 280-301 (2023) - [j4]Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to scattered graph classes I - Case of finite number of graph classes. J. Comput. Syst. Sci. 138: 103460 (2023) - [c8]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. ESA 2023: 65:1-65:17 - [i6]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR abs/2301.06105 (2023) - [i5]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. CoRR abs/2303.02687 (2023) - [i4]Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large. CoRR abs/2308.06145 (2023) - 2022
- [j3]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. Algorithmica 84(8): 2335-2357 (2022) - [i3]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes. CoRR abs/2201.03142 (2022) - 2021
- [j2]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Conflict-Free Set Cover. Theory Comput. Syst. 65(3): 515-540 (2021) - [c7]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. FCT 2021: 314-326 - [i2]Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman:
Deletion to Scattered Graph Classes I -- case of finite number of graph classes. CoRR abs/2105.04660 (2021) - 2020
- [j1]Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman:
Fixed-Parameter Tractability of (n - k) List Coloring. Theory Comput. Syst. 64(7): 1307-1316 (2020) - [c6]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Deletion to Scattered Graph Classes. IPEC 2020: 18:1-18:17 - [c5]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. IPEC 2020: 19:1-19:18 - [i1]Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Structural Parameterizations with Modulator Oblivion. CoRR abs/2002.09972 (2020)
2010 – 2019
- 2019
- [c4]Ashwin Jacob, Venkatesh Raman, Vibha Sahlot:
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. COCOON 2019: 325-337 - [c3]Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Parameterized Complexity of Conflict-Free Set Cover. CSR 2019: 191-202 - [c2]Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman:
Fixed-Parameter Tractability of (n-k) List Coloring. IWOCA 2019: 61-69 - 2018
- [c1]Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
Structural Parameterizations of Dominating Set Variants. CSR 2018: 157-168
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
