Abhishek Sahu

Orcid: 0000-0001-6481-6728

According to our database1, Abhishek Sahu authored at least 29 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Partitioning subclasses of chordal graphs with few deletions.
Theor. Comput. Sci., February, 2024

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.
CoRR, 2024

Conflict and Fairness in Resource Allocation.
CoRR, 2024

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems.
SIAM J. Discret. Math., December, 2023

Parameterized complexity of perfectly matched sets.
Theor. Comput. Sci., May, 2023

Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs.
Theory Comput. Syst., April, 2023

Design of On-Wafer Calibration Kit for Accurate Pyramid Probe Card-Based Surface Acoustic Wave Filter Measurements.
IEEE Trans. Instrum. Meas., 2023

An Improved Exact Algorithm for Knot-Free Vertex Deletion.
CoRR, 2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
A conceptual framework for the implementation of Industry 4.0 in legal informatics.
Sustain. Comput. Informatics Syst., 2022

Integrating Industry 4.0 and circular economy: a review.
J. Enterp. Inf. Manag., 2022

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
Algorithmica, 2022

Parameterized Complexity of Maximum Edge Colorable Subgraph.
Algorithmica, 2022

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

An Exact Algorithm for Knot-Free Vertex Deletion.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
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., 2021

Packing Arc-Disjoint Cycles in Tournaments.
Algorithmica, 2021

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.
Algorithmica, 2019

On the Complexity of Mixed Dominating Set.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments.
CoRR, 2018

Dynamic Parameterized Problems.
Algorithmica, 2018

2017
Robust Microwave Characterization of Inkjet-Printed Coplanar Waveguides on Flexible Substrates.
IEEE Trans. Instrum. Meas., 2017

Mixed Dominating Set: A Parameterized Perspective.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

A slow-wave substrate integrated waveguide dual-band filter.
Proceedings of the 30th IEEE Canadian Conference on Electrical and Computer Engineering, 2017

Optimization of miniaturized single- and multiband CPW-based matching transformers for RF circuitry on LCP substrates.
Proceedings of the 30th IEEE Canadian Conference on Electrical and Computer Engineering, 2017


  Loading...