| Publication | Date of Publication | Type |
|---|
| One-tape Turing machine and branching program lower bounds for MCSP | 2024-10-07 | Paper |
| Average sensitivity of dynamic programming | 2024-07-19 | Paper |
| The secretary problem with predictions | 2024-06-27 | Paper |
| Downsampling for testing and learning in product distributions | 2024-06-24 | Paper |
| Low degree testing over the reals | 2024-05-14 | Paper |
| Sublinear-time algorithms for \textsc{Max Cut, Max E2Lin}\((q)\), and unique label cover on expanders | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147292 | 2024-01-15 | Paper |
| Towards tight bounds for spectral sparsification of hypergraphs | 2023-11-14 | Paper |
| Weakly Submodular Function Maximization Using Local Submodularity Ratio. | 2023-11-14 | Paper |
| Average Sensitivity of Graph Algorithms | 2023-09-06 | Paper |
| EFFICACY OF CATEGORIES IN PHYSICAL THERAPY FOR IMPROVING MOTOR FUNCTION OF PATIENTS WITH STROKE | 2023-07-07 | Paper |
| Distribution-Free Testing of Linear Functions on ℝⁿ | 2023-02-03 | Paper |
| Online risk-averse submodular maximization | 2023-01-23 | Paper |
| Finding Cheeger cuts in hypergraphs via heat equation | 2022-08-25 | Paper |
| Property Testing | 2022-02-21 | Paper |
| Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model | 2022-02-09 | Paper |
| On the three graph invariants related to matching of finite simple graphs | 2021-12-30 | Paper |
| Polynomial-time algorithms for submodular Laplacian systems | 2021-10-21 | Paper |
| Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices | 2021-08-04 | Paper |
| Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002781 | 2021-07-28 | Paper |
| Hypergraph Clustering Based on PageRank | 2020-06-15 | Paper |
| Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time | 2020-04-01 | Paper |
| Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint | 2020-02-28 | Paper |
| Parameterized Testability | 2019-12-06 | Paper |
| A characterization of constant‐sample testable properties | 2019-10-16 | Paper |
| Spectral Sparsification of Hypergraphs | 2019-10-15 | Paper |
| Cheeger Inequalities for Submodular Transformations | 2019-10-15 | Paper |
| Conjunctive Filter: Breaking the Entropy Barrier | 2019-09-11 | Paper |
| Constant-Query Testability of Assignments to Constraint Satisfaction Problems | 2019-09-02 | Paper |
| Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint | 2019-08-29 | Paper |
| Deep Learning-Based Average Consensus | 2019-08-26 | Paper |
| Linear-Time FPT Algorithms via Network Flow | 2019-06-20 | Paper |
| Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues | 2019-03-28 | Paper |
| Ordered Graph Limits and Their Applications | 2018-11-05 | Paper |
| Maximizing monotone submodular functions over the integer lattice | 2018-10-26 | Paper |
| Finding Cheeger Cuts in Hypergraphs via Heat Equation | 2018-09-12 | Paper |
| Improved Approximation Algorithms for k-Submodular Function Maximization | 2018-07-16 | Paper |
| Non-convex Compressed Sensing with the Sum-of-Squares Method | 2018-07-16 | Paper |
| Gowers Norm, Function Limits, and Parameter Estimation | 2018-07-16 | Paper |
| Consideration of Treatment of the Boundary Between Different Media in Electromagnetic Field Analysis Using the Constrained Interpolation Profile Method | 2017-09-01 | Paper |
| Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems | 2017-05-19 | Paper |
| Parameterized testability | 2017-05-19 | Paper |
| Robust Approximation of Temporal CSP | 2017-03-22 | Paper |
| Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra | 2017-01-30 | Paper |
| Testing list \(H\)-homomorphisms | 2016-11-30 | Paper |
| Testing properties of functions on finite groups | 2016-11-09 | Paper |
| Linear programming, width-1 CSPs, and robust satisfaction | 2016-10-07 | Paper |
| Half-integrality, LP-branching, and FPT algorithms | 2016-08-26 | Paper |
| Maximizing monotone submodular functions over the integer lattice | 2016-08-10 | Paper |
| On the Equivalence among Problems of Bounded Width | 2015-11-19 | Paper |
| A query efficient non-adaptive long code test with perfect completeness | 2015-10-12 | Paper |
| Testing outerplanarity of bounded degree graphs | 2015-09-03 | Paper |
| A characterization of locally testable affine-invariant properties via decomposition theorems | 2015-06-26 | Paper |
| Testing the supermodular-cut condition | 2015-06-25 | Paper |
| Partially Symmetric Functions Are Efficiently Isomorphism Testable | 2015-06-02 | Paper |
| Generalized river crossing problems | 2015-05-29 | Paper |
| Generalized skew bisubmodularity: a characterization and a min-max theorem | 2015-04-09 | Paper |
| An improved constant-time approximation algorithm for maximum~matchings | 2015-02-04 | Paper |
| Testing \(k\)-edge-connectivity of digraphs | 2014-11-11 | Paper |
| Testing subdivision-freeness | 2014-08-07 | Paper |
| Testing Forest-Isomorphism in the Adjacency List Model | 2014-07-01 | Paper |
| Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP | 2014-06-05 | Paper |
| Semi-Strong Colouring of Intersecting Hypergraphs | 2014-05-02 | Paper |
| Property testing for cyclic groups and beyond | 2013-12-09 | Paper |
| Constant-Time Algorithms for Sparsity Matroids | 2013-08-12 | Paper |
| An Algebraic Characterization of Testable Boolean CSPs | 2013-08-06 | Paper |
| Testing Linear-Invariant Function Isomorphism | 2013-08-06 | Paper |
| Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems | 2012-11-29 | Paper |
| Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues | 2012-11-02 | Paper |
| Algorithms for finding a maximum non-\(k\)-linked graph | 2012-09-12 | Paper |
| Algorithms and Complexity of Generalized River Crossing Problems | 2012-08-22 | Paper |
| Constant-Time Approximation Algorithms for the Knapsack Problem | 2012-07-16 | Paper |
| Testing the \((s,t)\) connectivity of graphs and digraphs | 2012-06-25 | Paper |
| On the distance between non-isomorphic groups. | 2012-05-04 | Paper |
| Property testing on \(k\)-vertex-connectivity of graphs | 2012-04-26 | Paper |
| Algorithms for Finding a Maximum Non-k-linked Graph | 2011-09-16 | Paper |
| Property testing for cyclic groups and beyond | 2011-08-17 | Paper |
| Testing outerplanarity of bounded degree graphs | 2010-09-10 | Paper |
| A query efficient non-adaptive long code test with perfect completeness | 2010-09-10 | Paper |
| Property Testing on k-Vertex-Connectivity of Graphs | 2008-08-28 | Paper |
