default search action
Vibha Sahlot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c8]Tereza Klimosová, Vibha Sahlot:
3-Coloring C4 or C3-Free Diameter Two Graphs. WADS 2023: 547-560 - [i3]Tereza Klimosová, Vibha Sahlot:
3-Coloring C4 or C3-free Diameter Two Graphs. CoRR abs/2307.15036 (2023) - 2022
- [j6]Ashwin Jacob
, Fahad Panolan
Structural Parameterizations with Modulator Oblivion. Algorithmica 84(8): 2335-2357 (2022) - [j5]Sukanya Pandey
Role coloring bipartite graphs. Discret. Appl. Math. 322: 276-285 (2022) - 2021
- [c7]Sukanya Pandey, Venkatesh Raman, Vibha Sahlot:
Parameterizing Role Coloring on Forests. SOFSEM 2021: 308-321 - [i2]Sukanya Pandey, Vibha Sahlot:
Role Coloring Bipartite Graphs. CoRR abs/2102.01124 (2021) - 2020
- [j4]Aritra Banik, Fahad Panolan
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82(1): 1-19 (2020) - [j3]Aritra Banik, Vibha Sahlot
Approximation algorithms for geometric conflict free covering problems. Comput. Geom. 89: 101591 (2020) - [j2]Pratibha Choudhary
Vertex deletion on split graphs: Beyond 4-hitting set. Theor. Comput. Sci. 845: 21-37 (2020) - [c6]Ashwin Jacob
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
- [c5]Pratibha Choudhary, Pallavi Jain, R. Krithika
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. CIAC 2019: 161-173 - [c4]Ashwin Jacob
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. COCOON 2019: 325-337 - 2018
- [j1]Aritra Banik, Fahad Panolan
Fréchet Distance Between a Line and Avatar Point Set. Algorithmica 80(9): 2616-2636 (2018) - [c3]Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh:
Hitting and Covering Partially. COCOON 2018: 751-763 - 2017
- [c2]Aritra Banik, Fahad Panolan
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS 2017: 61-72 - 2016
- [c1]Aritra Banik, Fahad Panolan
Fréchet Distance Between a Line and Avatar Point Set. FSTTCS 2016: 32:1-32:14
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:18 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: