| Publication | Date of Publication | Type |
|---|
| Exact algorithms and hardness result for the Boolean connectivity problem of k-Horn formulas | 2026-09-23 | Paper |
The complexity of pre-assignment problem for unique minimum vertex cover on bipartite graphs
Theory of Computing Systems | 2026-04-27 | Paper |
| Hardness of pre-assignment problem for unique minimum vertex cover on planar graphs with maximum degree 3 | 2026-02-26 | Paper |
On gapped repeats in a cyclic Fibonacci word
(available as arXiv preprint) | 2026-01-01 | Paper |
Hardness of Forcing Unique Perfect Matchings in Bipartite Graphs of Maximum Degree 3
(available as arXiv preprint) | 2026-01-01 | Paper |
| Shortest cover after edit | 2025-12-02 | Paper |
| Optimal LZ-end parsing is hard | 2024-10-21 | Paper |
On the complexity of finding a spanning even tree in a graph
(available as arXiv preprint) | 2024-01-01 | Paper |
Internal longest palindrome queries in optimal time
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Finding top-k longest palindromes in substrings
Theoretical Computer Science | 2023-10-26 | Paper |
Satisfiability algorithm for syntactic read-\(k\)-times branching programs
Theory of Computing Systems | 2021-06-11 | Paper |
| Satisfiability algorithm for syntactic read-\(k\)-times branching programs | 2020-11-25 | Paper |
An Introduction to Lower Bounds on Resolution Proof Systems
Interdisciplinary Information Sciences | 2020-11-19 | Paper |
Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
Journal of Computer and System Sciences | 2019-08-07 | Paper |
A moderately exponential time algorithm for k-IBDD satisfiability
Algorithmica | 2018-07-26 | Paper |
| Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression | 2018-03-21 | Paper |
| Improved exact algorithms for mildly sparse instances of MAX SAT | 2017-09-29 | Paper |
Improved exact algorithms for mildly sparse instances of MAX SAT
Theoretical Computer Science | 2017-09-28 | Paper |
Solving sparse instances of Max SAT via width reduction and greedy restriction
Theory of Computing Systems | 2016-01-28 | Paper |
A moderately exponential time algorithm for \(k\)-IBDD satisfiability
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Solving sparse instances of Max SAT via width reduction and greedy restriction
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Efficient algorithms for sorting k-sets in bins
Algorithms and Computation | 2014-02-18 | Paper |
A satisfiability algorithm and average-case hardness for formulas over the full binary basis
Computational Complexity | 2013-07-19 | Paper |
Improved randomized algorithms for 3-SAT
Algorithms and Computation | 2010-12-09 | Paper |
The complexity of the Hajós calculus for planar graphs
Theoretical Computer Science | 2010-03-09 | Paper |
