| Publication | Date of Publication | Type |
|---|
| Quasipolynomial-time deterministic kernelization and (gammoid) representation | 2026-08-05 | Paper |
| Parallel complexity of geometric bipartite matching | 2026-06-12 | Paper |
| Fractional linear matroid matching is in quasi-NC | 2026-05-26 | Paper |
| Linearly representable submodular functions: an algebraic algorithm for minimization | 2026-03-18 | Paper |
| Border complexity of symbolic determinant under rank one restriction | 2024-11-19 | Paper |
| A deterministic parallel reduction from weighted matroid intersection search to decision | 2024-07-19 | Paper |
A deterministic parallel reduction from weighted matroid intersection search to decision
Algorithmica | 2024-04-02 | Paper |
| scientific article; zbMATH DE number 7768386 (Why is no real title available?) | 2023-11-20 | Paper |
| Improved Explicit Hitting-Sets for ROABPs | 2023-10-31 | Paper |
Pseudorandom Bits for Oblivious Branching Programs
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
The complexity of poset games
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
On the number of circuits in regular matroids (with connections to lattices and codes)
SIAM Journal on Discrete Mathematics | 2021-08-20 | Paper |
| Isolating a vertex via lattices: polytopes with totally unimodular faces | 2021-07-28 | Paper |
Bipartite perfect matching is in quasi-NC
SIAM Journal on Computing | 2021-06-29 | Paper |
Linear matroid intersection is in quasi-NC
Computational Complexity | 2021-05-25 | Paper |
Isolating a vertex via lattices: polytopes with totally unimodular faces
SIAM Journal on Computing | 2021-04-14 | Paper |
Planarizing gadgets for perfect matching do not exist
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Exact perfect matching in complete graphs
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
On the number of circuits in regular matroids (with connections to lattices and codes)
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Deterministic identity testing for sum of read-once oblivious arithmetic branching programs | 2018-01-24 | Paper |
Derandomizing isolation lemma for \(K_{3,3}\)-free and \(K_5\)-free bipartite graphs
(available as arXiv preprint) | 2018-01-24 | Paper |
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
Computational Complexity | 2017-12-18 | Paper |
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
Computational Complexity | 2017-12-18 | Paper |
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
Theory of Computing | 2017-10-11 | Paper |
| Identity testing for constant-width, and commutative, read-once oblivious ABPs | 2017-10-10 | Paper |
Bipartite perfect matching is in quasi-NC
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Bipartite perfect matching is in quasi-NC
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Linear matroid intersection is in quasi-NC
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Extended Formulations for Polytopes of Regular Matroids | 2016-12-31 | Paper |
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
SIAM Journal on Computing | 2015-06-08 | Paper |
Planarizing Gadgets for Perfect Matching Do Not Exist
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
