| Publication | Date of Publication | Type |
|---|
Approximation algorithms for the maximally balanced connected graph tripartition problem
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem
Journal of Combinatorial Optimization | 2021-05-03 | Paper |
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
| 2020-11-25 | Paper |
Parameter estimation of MCEM algorithm based on logit-normal model
| 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
Theory of Computing Systems | 2019-09-05 | Paper |
Maximum Edge Bicliques in Tree Convex Bipartite Graphs
Frontiers in Algorithmics | 2019-04-26 | Paper |
Fractional edge cover number of Model RB
Frontiers in Algorithmics | 2019-04-26 | Paper |
A high-accuracy protein structural class prediction algorithm using predicted secondary structural information
Journal of Theoretical Biology | 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
Algorithms | 2018-08-20 | Paper |
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
European Journal of Operational Research | 2018-05-30 | Paper |
Estimation and testing for semiparametric mixtures of partially linear models
Communications in Statistics: Theory and Methods | 2017-10-27 | Paper |
Statistical inference of partially linear panel data regression models with fixed individual and time effects
Communications in Statistics: Theory and Methods | 2017-10-10 | Paper |
Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
Circular convex bipartite graphs: feedback vertex sets
Theoretical Computer Science | 2016-06-27 | Paper |
Approximating the maximum multiple RNA interaction problem
Theoretical Computer Science | 2016-06-27 | Paper |
Improved parameterized and exact algorithms for cut problems on trees
Theoretical Computer Science | 2015-12-11 | Paper |
Union closed tree convex sets
Frontiers in Algorithmics | 2015-11-12 | Paper |
A 0.5358-approximation for Bandpass-2
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
Algorithms for cut problems on trees
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Tractable connected domination for restricted bipartite graphs
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Restricted Bipartite Graphs: Comparison and Hardness Results
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Large hypertree width for sparse random hypergraphs
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
Frontiers in Algorithmics | 2014-09-02 | Paper |
Set cover, set packing and hitting set for tree convex and tree-like set systems
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Large hypertree width for sparse random hypergraphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Feedback vertex sets on restricted bipartite graphs
Theoretical Computer Science | 2014-01-16 | Paper |
Approximation algorithms for the maximum multiple RNA interaction problem
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Circular convex bipartite graphs: feedback vertex set
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Tractable connected domination for restricted bipartite graphs (extended abstract)
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Feedback Vertex Sets on Tree Convex Bipartite Graphs
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Independent domination on tree convex bipartite graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Tractable feedback vertex sets in restricted bipartite graphs
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
A note on treewidth in random graphs
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
On unique games with negative weights
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Two Hardness Results on Feedback Vertex Sets
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Multilocus genomics of outcrossing plant populations
Theoretical Population Biology | 2011-01-05 | Paper |
On exponential time lower bound of Knapsack under backtracking
Theoretical Computer Science | 2010-04-15 | Paper |
Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model
Lecture Notes in Computer Science | 2007-11-13 | Paper |
scientific article; zbMATH DE number 1979755 (Why is no real title available?)
| 2003-09-14 | Paper |
Some structural properties of SAT
Journal of Computer Science and Technology | 2001-05-28 | Paper |
A note on closeness between \(NP\)-hard sets and \(C_= P\)
Journal of Computer Science and Technology | 2000-04-27 | Paper |
Exponential-time and subexponential-time sets
Theoretical Computer Science | 1993-09-16 | Paper |
