| Publication | Date of Publication | Type |
|---|
| Approximation algorithms for the maximally balanced connected graph tripartition problem | 2022-10-04 | Paper |
| A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem | 2021-05-03 | Paper |
| A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3307633 | 2020-08-12 | Paper |
| Balanced random constraint satisfaction: phase transition and hardness | 2020-07-07 | Paper |
| A group algebraic approach to NPN classification of Boolean functions | 2019-09-05 | Paper |
| Fractional Edge Cover Number of Model RB | 2019-04-26 | Paper |
| Maximum Edge Bicliques in Tree Convex Bipartite Graphs | 2019-04-26 | Paper |
| A high-accuracy protein structural class prediction algorithm using predicted secondary structural information | 2019-03-26 | Paper |
| A new probabilistic algorithm for approximate model counting | 2018-10-18 | Paper |
| A Bayesian algorithm for functional mapping of dynamic complex traits | 2018-08-20 | Paper |
| A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints | 2018-05-30 | Paper |
| Estimation and testing for semiparametric mixtures of partially linear models | 2017-10-27 | Paper |
| Statistical inference of partially linear panel data regression models with fixed individual and time effects | 2017-10-10 | Paper |
| Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs | 2016-10-20 | Paper |
| Circular convex bipartite graphs: feedback vertex sets | 2016-06-27 | Paper |
| Approximating the maximum multiple RNA interaction problem | 2016-06-27 | Paper |
| Improved parameterized and exact algorithms for cut problems on trees | 2015-12-11 | Paper |
| Union Closed Tree Convex Sets | 2015-11-12 | Paper |
| A 0.5358-approximation for Bandpass-2 | 2015-09-28 | Paper |
| Algorithms for Cut Problems on Trees | 2015-09-11 | Paper |
| Tractable connected domination for restricted bipartite graphs | 2015-07-10 | Paper |
| Restricted Bipartite Graphs: Comparison and Hardness Results | 2015-05-20 | Paper |
| Large hypertree width for sparse random hypergraphs | 2015-05-11 | Paper |
| Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth | 2014-09-02 | Paper |
| Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems | 2014-04-16 | Paper |
| Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs | 2014-04-03 | Paper |
| Large Hypertree Width for Sparse Random Hypergraphs | 2014-04-03 | Paper |
| Feedback vertex sets on restricted bipartite graphs | 2014-01-16 | Paper |
| Approximation Algorithms for the Maximum Multiple RNA Interaction Problem | 2013-12-10 | Paper |
| Circular Convex Bipartite Graphs: Feedback Vertex Set | 2013-12-10 | Paper |
| Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract) | 2013-06-11 | Paper |
| Feedback Vertex Sets on Tree Convex Bipartite Graphs | 2012-11-02 | Paper |
| Independent Domination on Tree Convex Bipartite Graphs | 2012-07-16 | Paper |
| Tractable Feedback Vertex Sets in Restricted Bipartite Graphs | 2011-08-12 | Paper |
| On Unique Games with Negative Weights | 2011-08-12 | Paper |
| A Note on Treewidth in Random Graphs | 2011-08-12 | Paper |
| Two Hardness Results on Feedback Vertex Sets | 2011-06-03 | Paper |
| Multilocus genomics of outcrossing plant populations | 2011-01-05 | Paper |
| On exponential time lower bound of Knapsack under backtracking | 2010-04-15 | Paper |
| Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model | 2007-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428135 | 2003-09-14 | Paper |
| Some structural properties of SAT | 2001-05-28 | Paper |
| A note on closeness between \(NP\)-hard sets and \(C_= P\) | 2000-04-27 | Paper |
| Exponential-time and subexponential-time sets | 1993-09-16 | Paper |
