| Publication | Date of Publication | Type |
|---|
Covering array on the Cartesian product of hypergraphs
Graphs and Combinatorics | 2024-08-01 | Paper |
| Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem | 2024-05-29 | Paper |
On Structural Parameterizations of the Harmless Set Problem
Algorithmica | 2024-04-24 | Paper |
Offensive alliances in graphs
Theoretical Computer Science | 2024-02-20 | Paper |
Parameterized intractability of defensive alliance problem
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
Parameterized complexity of satisfactory partition problem
Combinatorial Optimization and Applications | 2023-03-21 | Paper |
| The small set vertex expansion problem | 2023-03-21 | Paper |
Parameterized Complexity of Fair Feedback Vertex Set Problem
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Defensive alliances in graphs
Theoretical Computer Science | 2022-10-07 | Paper |
Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
Theoretical Computer Science | 2022-09-27 | Paper |
| On the harmless set problem parameterized by treewidth | 2022-07-13 | Paper |
On structural parameterizations of the offensive alliance problem
(available as arXiv preprint) | 2022-06-29 | Paper |
Globally minimal defensive alliances
Information Processing Letters | 2022-06-03 | Paper |
Parameterized complexity of locally minimal defensive alliances
(available as arXiv preprint) | 2022-03-24 | Paper |
| The balanced satisfactory partition problem | 2022-03-24 | Paper |
Mixed covering arrays on graphs of small treewidth
Discrete Mathematics, Algorithms and Applications | 2022-03-17 | Paper |
Parameterized complexity of satisfactory partition problem
Theoretical Computer Science | 2022-02-21 | Paper |
The small set vertex expansion problem
Theoretical Computer Science | 2021-10-06 | Paper |
Parameterized complexity of fair feedback vertex set problem
Theoretical Computer Science | 2021-04-15 | Paper |
| The Satisfactory Partition Problem | 2020-07-28 | Paper |
Improved strength four covering arrays with three symbols
Graphs and Combinatorics | 2018-03-22 | Paper |
Mixed covering arrays on 3-uniform hypergraphs
Discrete Applied Mathematics | 2017-10-17 | Paper |
Covering arrays on product graphs
Graphs and Combinatorics | 2017-10-11 | Paper |
Covering arrays of strength four and software testing
Springer Proceedings in Mathematics & Statistics | 2015-11-04 | Paper |
| A new construction of resilient Boolean functions with high nonlinearity | 2014-02-19 | Paper |
| Minimum distance between bent and 1-resilient Boolean functions. | 2012-02-20 | Paper |
Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
Information Processing Letters | 2009-08-27 | Paper |
Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity
Sequences and Their Applications – SETA 2006 | 2008-11-27 | Paper |
| Construction of cryptographically significant Boolean functions | 2007-04-02 | Paper |
Fast Software Encryption
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
| scientific article; zbMATH DE number 1955795 (Why is no real title available?) | 2003-07-29 | Paper |
On enumeration of catastrophic fault patterns
Information Processing Letters | 2002-07-14 | Paper |
Construction of some classes of optimal repeated measurements designs
Calcutta Statistical Association Bulletin | 2002-06-10 | Paper |
| scientific article; zbMATH DE number 1735657 (Why is no real title available?) | 2002-04-29 | Paper |
Enumerating catastrophic fault patterns in VLSI arrays with both uni- and bidirectional links
Integration. The VLSI Journal | 2002-03-03 | Paper |
