| Publication | Date of Publication | Type |
|---|
| Edge searching and fast searching with constraints | 2024-03-01 | Paper |
| Fast searching on cactus graphs | 2023-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091731 | 2022-07-27 | Paper |
| A randomized approximation algorithm for metric triangle packing | 2021-05-11 | Paper |
| A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem | 2021-03-10 | Paper |
| The one-cop-moves game on graphs with some special structures | 2020-11-06 | Paper |
| A randomized approximation algorithm for metric triangle packing | 2020-05-13 | Paper |
| The one-cop-moves game on graphs of small treewidth | 2020-05-13 | Paper |
| Approximation algorithms for the maximum weight internal spanning tree problem | 2019-10-17 | Paper |
| Designing and implementing algorithms for the closest string problem | 2019-08-20 | Paper |
| Positive semidefinite zero forcing numbers of two classes of graphs | 2019-08-20 | Paper |
| Designing and Implementing Algorithms for the Closest String Problem | 2019-04-26 | Paper |
| Better Approximation Algorithms for Scaffolding Problems | 2019-04-26 | Paper |
| Approximation algorithms for the scaffolding problem and its generalizations | 2018-06-05 | Paper |
| An approximation algorithm for maximum internal spanning tree | 2018-04-13 | Paper |
| Approximation algorithms for the maximum weight internal spanning tree problem | 2017-10-23 | Paper |
| An approximation algorithm for maximum internal spanning tree | 2017-05-05 | Paper |
| The parameterized complexity of the shared center problem | 2017-03-27 | Paper |
| A polynomial time approximation scheme for the closest shared center problem | 2017-03-06 | Paper |
| Finding similar regions in many strings | 2016-09-29 | Paper |
| An Improved Approximation Algorithm for rSPR Distance | 2016-09-02 | Paper |
| Aligning sequences via an evolutionary tree | 2016-09-01 | Paper |
| Parameterized and approximation algorithms for finding two disjoint matchings | 2016-06-27 | Paper |
| Randomized fixed-parameter algorithms for the closest string problem | 2016-03-23 | Paper |
| A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations | 2015-12-08 | Paper |
| On the closest string and substring problems | 2015-10-30 | Paper |
| Faster exact computation of rSPR distance | 2015-05-11 | Paper |
| Near optimal multiple alignment within a band in polynomial time | 2014-09-26 | Paper |
| Discovering almost any hidden motif from multiple sequences | 2014-09-09 | Paper |
| A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations | 2014-09-02 | Paper |
| Randomized and Parameterized Algorithms for the Closest String Problem | 2014-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5412744 | 2014-04-25 | Paper |
| Faster Exact Computation of rSPR Distance | 2014-04-03 | Paper |
| Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings | 2013-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2856760 | 2013-10-30 | Paper |
| Constant time approximation scheme for largest well predicted subset | 2013-06-28 | Paper |
| Near optimal solutions for maximum quasi-bicliques | 2013-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5299365 | 2013-06-25 | Paper |
| A Polynomial Time Approximation Scheme for the Closest Shared Center Problem | 2013-06-11 | Paper |
| A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring | 2013-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3144357 | 2012-12-07 | Paper |
| An Improved Approximation Algorithm for the Bandpass-2 Problem | 2012-11-02 | Paper |
| An improved approximation algorithm for the complementary maximal strip recovery problem | 2012-08-17 | Paper |
| The Parameterized Complexity of the Shared Center Problem | 2012-08-14 | Paper |
| Exact and approximation algorithms for the complementary maximal strip recovery problem | 2012-07-17 | Paper |
| A three-string approach to the closest string problem | 2012-05-11 | Paper |
| On the ordering of benzenoid chains and cyclo-polyphenacenes with respect to their numbers of clar aromatic sextets | 2011-07-21 | Paper |
| An approximation algorithm for the minimum co-path set problem | 2011-07-01 | Paper |
| An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem | 2011-06-03 | Paper |
| On Constrained Minimum Pseudotriangulations | 2011-03-18 | Paper |
| Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences | 2010-12-03 | Paper |
| Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing | 2010-10-11 | Paper |
| Beyond evolutionary trees | 2010-09-16 | Paper |
| Near Optimal Solutions for Maximum Quasi-bicliques | 2010-07-20 | Paper |
| Constant Time Approximation Scheme for Largest Well Predicted Subset | 2010-07-20 | Paper |
| A Three-String Approach to the Closest String Problem | 2010-07-20 | Paper |
| A Linear Kernel for Co-Path/Cycle Packing | 2010-07-20 | Paper |
| Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive | 2010-07-20 | Paper |
| A polynomial time approximation scheme for embedding a directed hypergraph on a ring | 2009-12-18 | Paper |
| Improved deterministic approximation algorithms for max TSP | 2009-12-04 | Paper |
| Approximation algorithms for reconstructing the duplication history of tandem repeats | 2009-11-25 | Paper |
| Approximation Algorithms for Biclustering Problems | 2009-08-20 | Paper |
| Efficient Algorithms for the Closest String and Distinguishing String Selection Problems | 2009-07-14 | Paper |
| An improved randomized approximation algorithm for maximum triangle packing | 2009-06-30 | Paper |
| On bipartite graphs with minimal energy | 2009-06-30 | Paper |
| Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability | 2009-06-03 | Paper |
| On the Tractability of Maximal Strip Recovery | 2009-06-03 | Paper |
| Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats | 2009-03-06 | Paper |
| An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem | 2009-01-27 | Paper |
| An improved approximation algorithm for maximum edge 2-coloring in simple graphs | 2008-08-08 | Paper |
| Quasi-bicliques: Complexity and Binding Pairs | 2008-07-10 | Paper |
| An Improved Randomized Approximation Algorithm for Maximum Triangle Packing | 2008-07-10 | Paper |
| Space efficient algorithms for ordered tree comparison | 2008-07-01 | Paper |
| Identification of Distinguishing Motifs | 2008-06-17 | Paper |
| Finding Additive Biclusters with Random Background | 2008-06-17 | Paper |
| On partitioning simple bipartite graphs in vertex-disjoint paths | 2008-06-03 | Paper |
| Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences | 2008-05-27 | Paper |
| On packing and coloring hyperedges in a cycle | 2007-09-21 | Paper |
| Some approximation algorithms for the clique partition problem in weighted interval graphs | 2007-09-03 | Paper |
| A 1.75-approximation algorithm for unsigned translocation distance | 2007-08-27 | Paper |
| Near optimal multiple alignment within a band in polynomial time | 2007-08-23 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Optimal relay location for resource-limited energy-efficient wireless communication | 2006-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5471182 | 2006-06-06 | Paper |
| On the complexity of unsigned translocation distance | 2006-03-24 | Paper |
| Maximizing profits of routing in WDM networks | 2006-02-08 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| An improved randomized approximation algorithm for Max TSP | 2005-12-14 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Decomposing toroidal graphs into circuits and edges | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024817 | 2005-07-04 | Paper |
| On the complexity of finding emerging patterns | 2005-06-10 | Paper |
| Exact matching of RNA secondary structure patterns | 2005-06-10 | Paper |
| On \(k\)-coloring of weighted circular-arc graphs | 2005-03-14 | Paper |
| Removable edges in a cycle of a 4-connected graph | 2004-11-18 | Paper |
| Minimum \(k\) arborescences with bandwidth constraints | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737204 | 2004-08-11 | Paper |
| \(k\)-resonance of open-ended carbon nanotubes | 2004-06-11 | Paper |
| Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids | 2004-01-08 | Paper |
| Genetic Design of Drugs Without Side-Effects | 2003-09-28 | Paper |
| A complete solution to a conjecture on the \({\beta}\)-polynomials of graphs | 2003-08-25 | Paper |
| Approximate sequencing for variable length tasks. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410119 | 2003-07-02 | Paper |
| Center and distinguisher for strings with unbounded alphabet | 2003-06-09 | Paper |
| Finding similar regions in many sequences | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551389 | 2002-09-05 | Paper |
| Computing similarity between RNA structures | 2002-07-15 | Paper |
| An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane | 2002-07-14 | Paper |
| Approximations for a bottleneck Steiner tree problem | 2002-05-21 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2002-03-03 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2001-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525729 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945794 | 2000-11-06 | Paper |
| Fixed topology alignment with recombination | 2000-11-06 | Paper |
| A More Efficient Approximation Scheme for Tree Alignment | 2000-10-18 | Paper |
| On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247446 | 2000-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246778 | 2000-02-20 | Paper |
| Fitting distances by tree metrics with increment error | 1999-10-04 | Paper |
| Fixed topology Steiner trees and spanning forests | 1999-04-28 | Paper |
| Graph traversals, genes and matroids: An efficient case of the travelling salesman problem | 1999-03-22 | Paper |
| Improved Approximation Algorithms for Tree Alignment | 1998-09-08 | Paper |
| On the complexity of comparing evolutionary trees | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344454 | 1997-07-15 | Paper |
| Approximation algorithms for tree alignment with a given phylogeny | 1997-05-25 | Paper |
| On the completeness of incidence calculus | 1997-04-13 | Paper |
| Alignment of trees -- an alternative to tree edit | 1997-02-28 | Paper |
| A NON-NUMERIC APPROACH TO UNCERTAIN REASONING | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712905 | 1992-06-25 | Paper |
