| Publication | Date of Publication | Type |
|---|
Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals
| 2024-08-22 | Paper |
New approximation algorithms for RNA secondary structures prediction problems by local search
Theoretical Computer Science | 2024-02-09 | Paper |
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
| 2022-07-18 | Paper |
Approximation algorithms for sorting by bounded singleton moves
Theoretical Computer Science | 2022-05-31 | Paper |
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
Theoretical Computer Science | 2021-09-27 | Paper |
Sorting a permutation by best short swaps
Algorithmica | 2021-06-30 | Paper |
On the solution bound of two-sided scaffold filling
Theoretical Computer Science | 2021-06-22 | Paper |
A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem
Journal of Computer and System Sciences | 2021-03-10 | Paper |
scientific article; zbMATH DE number 7286740 (Why is no real title available?)
| 2020-12-16 | Paper |
A 1.375-approximation algorithm for unsigned translocation sorting
Journal of Computer and System Sciences | 2020-06-09 | Paper |
An approximation algorithm for sorting by bounded singleton moves
| 2020-02-24 | Paper |
An approximation algorithm for genome sorting by reversals to recover all adjacencies
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling
Frontiers in Algorithmics | 2019-04-26 | Paper |
Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult
Mathematical Problems in Engineering | 2019-02-08 | Paper |
Can a breakpoint graph be decomposed into none other than 2-cycles?
Theoretical Computer Science | 2018-06-05 | Paper |
Complexity and approximation results for the min-sum and min-max disjoint paths problems
| 2018-04-05 | Paper |
A new approximation algorithm for unsigned translocation sorting
| 2018-03-23 | Paper |
A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction
| 2018-02-26 | Paper |
Genomic scaffold filling revisited
| 2017-10-17 | Paper |
Improved algorithms for intermediate dataset storage in a cloud-based dataflow
Theoretical Computer Science | 2017-02-06 | Paper |
Approximating Max NAE-\(k\)-SAT by anonymous local search
Theoretical Computer Science | 2017-02-06 | Paper |
A 1.5-approximation algorithm for two-sided scaffold filling
Algorithmica | 2016-03-23 | Paper |
A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
Theoretical Computer Science | 2015-12-08 | Paper |
A new algorithm for intermediate dataset storage in a cloud-based dataflow
Frontiers in Algorithmics | 2015-11-12 | Paper |
Local search to approximate MAX NAE-\(k\)-SAT tightly
Frontiers in Algorithmics | 2015-11-12 | Paper |
Approximation and nonapproximability for the one-sided scaffold filling problem
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Approximating the maximum internal spanning tree problem via a maximum path-cycle cover
Algorithms and Computation | 2015-09-11 | Paper |
An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
Algorithms and Computation | 2015-09-11 | Paper |
A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations
Frontiers in Algorithmics | 2014-09-02 | Paper |
Fast addition formulae for Montgomery ladder scalar multiplication on hyperelliptic curves
Journal of Software | 2014-06-30 | Paper |
On the toggling-branching recurrence of computability logic
Journal of Computer Science and Technology | 2014-02-06 | Paper |
Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
Theoretical Computer Science | 2014-01-10 | Paper |
Sorting genomes by generalized translocations
Theoretical Computer Science | 2013-12-17 | Paper |
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
Lecture Notes in Computer Science | 2013-06-11 | Paper |
The algorithm for the two-sided scaffold filling problem
Lecture Notes in Computer Science | 2013-05-28 | Paper |
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
Journal of Computer and System Sciences | 2012-08-17 | Paper |
A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves
Theoretical Computer Science | 2012-08-08 | Paper |
Minimum common string partition revisited
Journal of Combinatorial Optimization | 2012-07-17 | Paper |
On Editing Graphs into 2-Club Clusters
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
An approximation algorithm for the generalized \(k\)-multicut problem
Discrete Applied Mathematics | 2012-05-30 | Paper |
Parameterized complexity of control problems in Maximin election
Information Processing Letters | 2012-01-18 | Paper |
Tight bounds on local search to approximate the maximum satisfiability problems
Lecture Notes in Computer Science | 2011-08-17 | Paper |
A 14/11-approximation algorithm for sorting by short block-moves
Science China Information Sciences | 2011-06-17 | Paper |
A fast algorithm of constrained longest common subsequence
| 2010-11-05 | Paper |
Minimum common string partition revisited
Frontiers in Algorithmics | 2010-09-07 | Paper |
Faster algorithms for sorting by transpositions and sorting by block interchanges
ACM Transactions on Algorithms | 2010-08-14 | Paper |
Complexity and improved heuristic algorithms for binary fingerprints clustering
Journal of Software | 2010-02-12 | Paper |
Parameterized computational complexity of control problems in voting systems
Theoretical Computer Science | 2009-07-10 | Paper |
Polynomial-Time Algorithm for Sorting by Generalized Translocations
Lecture Notes in Computer Science | 2009-06-03 | Paper |
A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
Discrete Mathematics | 2008-07-11 | Paper |
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Prediction for RNA planar pseudoknots
Progress in Natural Science | 2007-09-03 | Paper |
A 1.75-approximation algorithm for unsigned translocation distance
Journal of Computer and System Sciences | 2007-08-27 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
On the complexity of unsigned translocation distance
Theoretical Computer Science | 2006-03-24 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
scientific article; zbMATH DE number 2165699 (Why is no real title available?)
| 2005-05-06 | Paper |
scientific article; zbMATH DE number 1919439 (Why is no real title available?)
| 2003-11-27 | Paper |
Hardness and methods to solve CLIQUE
Journal of Computer Science and Technology | 2002-10-17 | Paper |
scientific article; zbMATH DE number 1555927 (Why is no real title available?)
| 2001-01-24 | Paper |
scientific article; zbMATH DE number 221327 (Why is no real title available?)
| 1993-06-29 | Paper |
