default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDalu Jacob
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Dhanyamol Antony
, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva:
Spanning caterpillar in biconvex bipartite graphs. Discret. Appl. Math. 356: 32-36 (2024)- [j5]L. Sunil Chandran, Talha Hashim, Dalu Jacob, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh:
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring. Discret. Math. 347(4): 113894 (2024) - [c3]Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob:
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness. LATIN (1) 2024: 97-113 - [i8]Dhanyamol Antony, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva:
Graph Burning: Bounds and Hardness. CoRR abs/2402.18984 (2024) - 2023
- [j4]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. Algorithmica 85(6): 1522-1559 (2023) - [j3]Mathew C. Francis, Dalu Jacob:
The lexicographic method for the threshold cover problem. Discret. Math. 346(6): 113364 (2023) - [i7]Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob:
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness. CoRR abs/2307.12073 (2023) - [i6]Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob, Raji R. Pillai:
χ-binding functions for squares of bipartite graphs and its subclasses. CoRR abs/2312.08759 (2023) - [i5]Dhanyamol Antony, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva:
Spanning caterpillar in biconvex bipartite graphs. CoRR abs/2312.10956 (2023) - 2022
- [j2]Suresh Dara, Mathew C. Francis, Dalu Jacob, N. Narayanan:
Extending some results on the second neighborhood conjecture. Discret. Appl. Math. 311: 1-17 (2022) - 2021
- [c2]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. ISAAC 2021: 17:1-17:17 - [i4]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. CoRR abs/2107.08278 (2021) - 2020
- [c1]Mathew C. Francis, Dalu Jacob:
The Lexicographic Method for the Threshold Cover Problem. CALDAM 2020: 41-52
2010 – 2019
- 2019
- [i3]Mathew C. Francis, Dalu Jacob:
The Lexicographic Method for the Threshold Cover Problem. CoRR abs/1912.05819 (2019) - 2018
- [j1]Mathew C. Francis, Dalu Jacob, Satyabrata Jana:
Uniquely Restricted Matchings in Interval Graphs. SIAM J. Discret. Math. 32(1): 148-172 (2018) - [i2]Suresh Dara, Mathew C. Francis, Dalu Jacob, N. Narayanan:
The Second Neighborhood Conjecture for some Special Classes of Graphs. CoRR abs/1808.02247 (2018) - 2016
- [i1]Mathew C. Francis, Dalu Jacob, Satyabrata Jana:
Uniquely Restricted Matchings in Interval Graphs. CoRR abs/1604.07016 (2016)
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-07 21:12 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:
