| Publication | Date of Publication | Type |
|---|
On the parameterized complexity of diverse SAT
Theoretical Computer Science | 2025-12-17 | Paper |
| Parameterized approximation scheme for feedback vertex set | 2024-12-03 | Paper |
Parameterized approximation algorithms for weighted vertex cover
Theoretical Computer Science | 2024-11-18 | Paper |
| Parameterized complexity of untangling knots | 2024-06-24 | Paper |
| Parameterized approximation algorithms for weighted vertex cover | 2024-05-31 | Paper |
| scientific article; zbMATH DE number 7803596 (Why is no real title available?) | 2024-02-12 | Paper |
scientific article; zbMATH DE number 7764108 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-13 | Paper |
Parameterized inapproximability of independent set in \(H\)-free graphs
Algorithmica | 2023-04-11 | Paper |
Parameterized inapproximability of independent set in \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
| Parameterized complexity of set-restricted disjoint paths on chordal graphs | 2022-11-11 | Paper |
| Quick separation in chordal and split graphs | 2022-07-18 | Paper |
A polynomial kernel for diamond-free editing
Algorithmica | 2022-02-01 | Paper |
Belief-invariant and quantum equilibria in games of incomplete information
Theoretical Computer Science | 2021-11-18 | Paper |
| Parameterized complexity of untangling knots | 2021-11-09 | Paper |
A Polynomial Kernel for Diamond-Free Editing
(available as arXiv preprint) | 2021-08-04 | Paper |
Parameterized and exact algorithms for class domination coloring
Discrete Applied Mathematics | 2021-03-25 | Paper |
A testable prediction of the no-signalling condition using a variant of the EPR-Bohm example
Physics Letters. A | 2020-01-13 | Paper |
Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities
Quantum Information Processing | 2019-03-15 | Paper |
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
Algorithmica | 2019-01-11 | Paper |
On the kernelization complexity of string problems
Theoretical Computer Science | 2018-05-17 | Paper |
| Lossy kernels for graph contraction problems | 2018-04-19 | Paper |
| Strong parameterized deletion: bipartite graphs | 2018-04-19 | Paper |
Generalized pseudoforest deletion: algorithms and uniform kernel
SIAM Journal on Discrete Mathematics | 2018-04-18 | Paper |
Bivariate complexity analysis of \textsc{Almost Forest Deletion}
Theoretical Computer Science | 2017-12-20 | Paper |
Parameterized and exact algorithms for class domination coloring
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
A parameterized algorithm for mixed-cut
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Bivariate complexity analysis of \textsc{Almost Forest Deletion}
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Generalized pseudoforest deletion: algorithms and uniform kernel
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Faster parameterized algorithms for deletion to split graphs
Algorithmica | 2015-06-25 | Paper |
On the kernelization complexity of string problems
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Bound on tri-partite Hardy's nonlocality respecting all bi-partite principles
Quantum Information Processing | 2013-09-20 | Paper |
Local simulation of singlet statistics for a restricted set of measurements
Journal of Physics A: Mathematical and Theoretical | 2012-12-17 | Paper |
On the kernelization complexity of problems on graphs without long odd cycles
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Faster parameterized algorithms for deletion to split graphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Optimal free will on one side in reproducing the singlet correlation
Journal of Physics A: Mathematical and Theoretical | 2012-06-12 | Paper |
Propagation of spikes in nonresonant atomic media: the reduced Maxwell-Duffing model
Journal of Nonlinear Mathematical Physics | 2012-03-01 | Paper |
A complementary relation between classical bits and randomness in local part in the simulating singlet state
Journal of Physics A: Mathematical and Theoretical | 2011-05-13 | Paper |
Local randomness in Hardy's correlations: implications from the information causality principle
Journal of Physics A: Mathematical and Theoretical | 2010-12-03 | Paper |
