default search action
Abhishek Sahu
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Abhishek Sahu
, Shubhankar Bhowmick
Investigation of diabatic imparity involving asymmetric convection in two-dimensional longitudinal fins using lattice Boltzmann solver. Comput. Math. Appl. 162: 79-93 (2024) - [j14]Satyabrata Jana
Partitioning subclasses of chordal graphs with few deletions. Theor. Comput. Sci. 983: 114288 (2024) - [c21]Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Minimum Consistent Subset in Trees and Interval Graphs. FSTTCS 2024: 7:1-7:15 - [c20]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024: 88:1-88:18 - [c19]Akanksha Agrawal, Satyabrata Jana
A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. LATIN (2) 2024: 208-222 - [c18]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) 2024: 223-237 - [c17]Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu:
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. MFCS 2024: 16:1-16:18 - [i9]Akanksha Agrawal, Satyabrata Jana
A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion. CoRR abs/2401.03415 (2024) - [i8]Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Conflict and Fairness in Resource Allocation. CoRR abs/2403.04265 (2024) - [i7]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR abs/2403.07328 (2024) - [i6]Abhishek Sahu, Peter H. Aaen, Praveen Damacharla:
An Automated Machine Learning Approach to Inkjet Printed Component Analysis: A Step Toward Smart Additive Manufacturing. CoRR abs/2404.04623 (2024) - [i5]Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Minimum Consistent Subset in Trees and Interval Graphs. CoRR abs/2404.15487 (2024) - [i4]Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities. CoRR abs/2410.20900 (2024) - 2023
- [j13]Abhishek Sahu, Saket Saurabh:
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. Theory Comput. Syst. 67(2): 221-233 (2023) - [j12]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM J. Discret. Math. 37(4): 2626-2669 (2023) - [j11]Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana
Parameterized complexity of perfectly matched sets. Theor. Comput. Sci. 958: 113861 (2023) - [j10]Abhishek Sahu
Design of On-Wafer Calibration Kit for Accurate Pyramid Probe Card-Based Surface Acoustic Wave Filter Measurements. IEEE Trans. Instrum. Meas. 72: 1-9 (2023) - [c16]Satyabrata Jana
Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC 2023: 293-307 - [c15]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - [i3]Ajaykrishnan E. S, Soumen Maity, Abhishek Sahu, Saket Saurabh:
An Improved Exact Algorithm for Knot-Free Vertex Deletion. CoRR abs/2303.10866 (2023) - 2022
- [j9]Akanksha Agrawal, Madhumita Kundu
Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84(10): 3075-3100 (2022) - [j8]Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. Algorithmica 84(11): 3246-3275 (2022) - [j7]Abhishek Sahu
Integrating Industry 4.0 and circular economy: a review. J. Enterp. Inf. Manag. 35(3): 885-917 (2022) - [j6]Saurabh Agrawal, Abhishek Sahu
A conceptual framework for the implementation of Industry 4.0 in legal informatics. Sustain. Comput. Informatics Syst. 33: 100650 (2022) - [c14]Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana
Parameterized Complexity of Perfectly Matched Sets. IPEC 2022: 2:1-2:13 - [c13]M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma:
An Exact Algorithm for Knot-Free Vertex Deletion. MFCS 2022: 78:1-78:15 - [c12]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS 2022: 39:1-39:20 - 2021
- [j5]Stéphane Bessy, Marin Bougeret
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83(5): 1393-1420 (2021) - [j4]Abhishek Sahu, Khair Al Shamaileh
A High-Frequency/Power Ratio Wilkinson Power Divider Based on Identical/Non-Identical Multi-T-Sections With Short-Circuited Stubs. IEEE Open J. Circuits Syst. 2: 34-45 (2021) - [c11]Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC 2021: 23:1-23:18 - 2020
- [c10]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Parameterized Complexity of Maximum Edge Colorable Subgraph. COCOON 2020: 615-626 - [c9]Abhishek Sahu, Saket Saurabh:
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. CSR 2020: 367-378 - [c8]Petr A. Golovach, R. Krithika
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN 2020: 104-115 - [i2]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. CoRR abs/2008.07953 (2020)
2010 – 2019
- 2019
- [j3]R. Krithika
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. Algorithmica 81(9): 3803-3841 (2019) - [c7]Jayakrishnan Madathil, Fahad Panolan
On the Complexity of Mixed Dominating Set. CSR 2019: 262-274 - [c6]Stéphane Bessy, Marin Bougeret
Packing Arc-Disjoint Cycles in Tournaments. MFCS 2019: 27:1-27:14 - 2018
- [j2]R. Krithika
Dynamic Parameterized Problems. Algorithmica 80(9): 2637-2655 (2018) - [c5]R. Krithika
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. LATIN 2018: 712-726 - [i1]R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. CoRR abs/1802.07090 (2018) - 2017
- [j1]Abhishek Sahu, Peter H. Aaen, Arkadiusz Lewandowski
Robust Microwave Characterization of Inkjet-Printed Coplanar Waveguides on Flexible Substrates. IEEE Trans. Instrum. Meas. 66(12): 3271-3279 (2017) - [c4]Osama Hussein, Khair Alshamaileh, Abhishek Sahu, Blen Keneni, Vijay Kumar Devabhaktuni:
Optimization of miniaturized single- and multiband CPW-based matching transformers for RF circuitry on LCP substrates. CCECE 2017: 1-3 - [c3]Abhishek Sahu, Osama Hussein, Blen Keneni, Khair Alshamaileh, Vijay Kumar Devabhaktuni:
A slow-wave substrate integrated waveguide dual-band filter. CCECE 2017: 1-3 - [c2]Pallavi Jain, Jayakrishnan Madathil
Mixed Dominating Set: A Parameterized Perspective. WG 2017: 330-343 - 2016
- [c1]R. Krithika
Dynamic Parameterized Problems. IPEC 2016: 19:1-19: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-12-08 01:31 CET 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: