Soumen Maity

Hitendra Kumar

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2024

Covering Array on the Cartesian Product of Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., August, 2024

On Structural Parameterizations of the Harmless Set Problem.

[BibT_eX]

[DOI]

Algorithmica, May, 2024

Offensive alliances in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Kernelization Algorithms for the Eigenvalue Deletion Problems.

[BibT_eX]

[DOI]

Hitendra Kumar

CoRR, 2024

2023

An Improved Exact Algorithm for Knot-Free Vertex Deletion.

[BibT_eX]

[DOI]

CoRR, 2023

Parameterized Complexity of the Th+1-Free Edge Deletion Problem.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Further parameterized algorithms for the F-free edge deletion problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Defensive alliances in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Globally minimal defensive alliances.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Mixed covering arrays on graphs of small treewidth.

[BibT_eX]

[DOI]

Charles J. Colbourn

Discret. Math. Algorithms Appl., 2022

Parameterized Algorithms for Locally Minimal Defensive Alliance.

[BibT_eX]

[DOI]

Saket Saurabh

CoRR, 2022

Parameterized Complexity of Upper Edge Domination.

[BibT_eX]

[DOI]

CoRR, 2022

Maximum Minimal Feedback Vertex Set: A Parameterized Perspective.

[BibT_eX]

[DOI]

CoRR, 2022

Globally Minimal Defensive Alliances: A Parameterized Perspective.

[BibT_eX]

[DOI]

CoRR, 2022

On the Harmless Set Problem Parameterized by Treewidth.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Parameterized Intractability of Defensive Alliance Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

The Small Set Vertex Expansion Problem.

[BibT_eX]

[DOI]

Garima Agrawal

Theor. Comput. Sci., 2021

The Harmless Set Problem.

[BibT_eX]

[DOI]

CoRR, 2021

Edge Deletion to Restrict the Size of an Epidemic.

[BibT_eX]

[DOI]

CoRR, 2021

The Balanced Satisfactory Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Parameterized Complexity of Defensive and Offensive Alliances in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Internet Technology, 2021

On Structural Parameterizations of the Offensive Alliance Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

Parameterized Complexity of Locally Minimal Defensive Alliances.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

The Satisfactory Partition Problem.

[BibT_eX]

[DOI]

CoRR, 2020

Parameterized Complexity of Fair Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2020

The Small Set Vertex Expansion Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

Parameterized Complexity of Satisfactory Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

2018

Improved Strength Four Covering Arrays with Three Symbols.

[BibT_eX]

[DOI]

Reshma C. Chandrasekharan

Charles J. Colbourn

Graphs Comb., 2018

2017

Covering Arrays on Product Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Mixed covering arrays on 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Generating Test Suites with High 3-Way Coverage for Software Testing.

[BibT_eX]

[DOI]

Reshma C. Chandrasekharan

Proceedings of the 2016 IEEE International Conference on Computer and Information Technology, 2016

2015

Improved Strength Four Covering Arrays with Three Symbols.

[BibT_eX]

[DOI]

Reshma C. Chandrasekharan

CoRR, 2015

2013

A New Construction of Resilient Boolean Functions with High Nonlinearity.

[BibT_eX]

Chrisil Arackaparambil

Kezhasono Meyase

Ars Comb., 2013

2012

3-Way Software Testing with Budget Constraints.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2012

Software Testing with Budget Constraints.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Information Technology: New Generations, 2012

2009

Permutation Polynomials modulo pn.

[BibT_eX]

[DOI]

Rajesh P. Singh

IACR Cryptol. ePrint Arch., 2009

2007

Characterization, testing and reconfiguration of faults in mesh networks.

[BibT_eX]

[DOI]

S. Ramsundar

Integr., 2007

2006

Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity.

[BibT_eX]

[DOI]

Chrisil Arackaparambil

Kezhasono Meyase

Proceedings of the Sequences and Their Applications, 2006

On Fault Tolerance of Two-Dimensional Mesh Networks.

[BibT_eX]

[DOI]

S. Ramsundar

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

On Reliability Analysis of Forward Loop Forward Hop Networks.

[BibT_eX]

[DOI]

S. Ramsundar

Proceedings of the Distributed Computing and Internet Technology, 2006

2005

Improved Test Generation Algorithms for Pair-Wise Testing.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Software Reliability Engineering (ISSRE 2005), 2005

2004

Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

On characterization of catastrophic faults in two-dimensional VLSI arrays.

[BibT_eX]

[DOI]

Integr., 2004

Reliability of VLSI Linear Arrays with Redundant Links.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 2004

Minimum Distance between Bent and 1-Resilient Boolean Functions.

[BibT_eX]

[DOI]

Subhamoy Maitra

Proceedings of the Fast Software Encryption, 11th International Workshop, 2004

2002

On enumeration of catastrophic fault patterns.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Construction of Cryptographically Important Boolean Functions.

[BibT_eX]

[DOI]

Thomas Johansson

Proceedings of the Progress in Cryptology, 2002

2001

Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links.

[BibT_eX]

[DOI]