| Publication | Date of Publication | Type |
|---|
| Constructing red-black spanners for mixed-charging vehicular networks | 2024-12-12 | Paper |
| Permutation-constrained common string partitions with applications | 2024-12-03 | Paper |
| The longest subsequence-repeated subsequence problem | 2024-09-16 | Paper |
| Guarding precise and imprecise polyhedral terrains with segments | 2024-09-16 | Paper |
| The longest letter-duplicated subsequence and related problems | 2024-08-24 | Paper |
| Red-black spanners for mixed-charging vehicular networks | 2024-08-22 | Paper |
| Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals | 2024-08-22 | Paper |
| Algorithms and hardness for the longest common subsequence of three strings and related problems | 2024-05-29 | Paper |
| On computing a center persistence diagram | 2024-05-29 | Paper |
| Beyond the longest letter-duplicated subsequence problem | 2024-05-06 | Paper |
| New approximation algorithms for RNA secondary structures prediction problems by local search | 2024-02-09 | Paper |
| Two-guarding a rectilinear polygon | 2024-01-29 | Paper |
| Three dimensional weak visibility: Complexity and applications | 2023-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874451 | 2023-02-07 | Paper |
| The Tandem Duplication Distance Is NP-Hard | 2023-02-07 | Paper |
| Dispersing and grouping points on segments in the plane | 2022-12-22 | Paper |
| Computing a consensus trajectory in a vehicular network | 2022-10-31 | Paper |
| Tandem Duplications, Segmental Duplications and Deletions, and Their Applications | 2022-10-19 | Paper |
| The complexity of finding common partitions of genomes with predefined block sizes | 2022-08-11 | Paper |
| A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem | 2022-07-18 | Paper |
| Permutation-constrained common string partitions with applications | 2022-06-15 | Paper |
| Computing the Tandem Duplication Distance is NP-Hard | 2022-01-07 | Paper |
| Dispersing and grouping points on planar segments | 2021-10-06 | Paper |
| Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs | 2021-09-27 | Paper |
| On the solution bound of two-sided scaffold filling | 2021-06-22 | Paper |
| A Retrospective on Genomic Preprocessing for Comparative Genomics | 2021-06-10 | Paper |
| On some matching problems under the color-spanning model | 2019-08-20 | Paper |
| Efficient algorithms for computing one or two discrete centers hitting a set of line segments | 2019-06-25 | Paper |
| The discrete and mixed minimax 2-center problems | 2019-06-25 | Paper |
| Finding Disjoint Dense Clubs in an Undirected Graph | 2019-04-26 | Paper |
| A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs | 2019-04-26 | Paper |
| On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model | 2019-04-26 | Paper |
| Genomic Scaffold Filling: A Progress Report | 2019-04-26 | Paper |
| A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications | 2018-10-04 | Paper |
| A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition | 2018-06-18 | Paper |
| Finding disjoint dense clubs in a social network | 2018-06-05 | Paper |
| Solving the maximum internal spanning tree problem on interval graphs in polynomial time | 2018-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608597 | 2018-03-21 | Paper |
| The connected disk covering problem | 2018-03-01 | Paper |
| Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction | 2017-10-23 | Paper |
| Guarding a terrain by two watchtowers | 2017-10-20 | Paper |
| Genomic Scaffold Filling Revisited. | 2017-10-17 | Paper |
| Improved algorithms for intermediate dataset storage in a cloud-based dataflow | 2017-02-06 | Paper |
| A Polynomial Time Solution for Permutation Scaffold Filling | 2017-02-01 | Paper |
| Following a curve with the discrete Fréchet distance | 2016-06-27 | Paper |
| Computing the optimal bridge between two convex polygons | 2016-06-16 | Paper |
| A 1.5-approximation algorithm for two-sided scaffold filling | 2016-03-23 | Paper |
| The Discrete and Mixed Minimax 2-Center Problem | 2016-02-05 | Paper |
| Improved parameterized and exact algorithms for cut problems on trees | 2015-12-11 | Paper |
| A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations | 2015-12-08 | Paper |
| A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow | 2015-11-12 | Paper |
| An incremental version of the \(k\)-center problem on boundary of a convex polygon | 2015-11-03 | Paper |
| On the Chain Pair Simplification Problem | 2015-10-30 | Paper |
| Algorithms for Cut Problems on Trees | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501791 | 2015-08-14 | Paper |
| Robust optimization for the hazardous materials transportation network design problem | 2015-07-28 | Paper |
| Complexity analysis and algorithms for the program download problem | 2015-07-10 | Paper |
| Weak visibility polygons of NURBS curves inside simple polygons | 2015-06-16 | Paper |
| On the Exact Block Cover Problem | 2015-05-20 | Paper |
| Expected computations on color spanning sets | 2015-05-11 | Paper |
| A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations | 2014-09-02 | Paper |
| On the approximability of the exemplar adjacency number problem for genomes with gene repetitions | 2014-08-26 | Paper |
| A note on visibility-constrained Voronoi diagrams | 2014-08-22 | Paper |
| A linear kernel for the complementary maximal strip recovery problem | 2014-06-10 | Paper |
| Voronoi diagram with visual restriction | 2014-04-15 | Paper |
| Expected Computations on Color Spanning Sets | 2014-04-03 | Paper |
| Radiation hybrid map construction problem parameterized | 2014-02-25 | Paper |
| Streaming with minimum space: an algorithm for covering by two congruent balls | 2014-01-16 | Paper |
| Tight Approximation Bounds for Connectivity with a Color-Spanning Set | 2014-01-14 | Paper |
| Largest area convex hull of imprecise data based on axis-aligned squares | 2013-12-09 | Paper |
| Baseline bounded half-plane Voronoi diagram | 2013-11-26 | Paper |
| On some geometric problems of color-spanning sets | 2013-08-02 | Paper |
| An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies | 2013-06-11 | Paper |
| The Program Download Problem: Complexity and Algorithms | 2013-06-11 | Paper |
| Radiation Hybrid Map Construction Problem Parameterized | 2012-11-02 | Paper |
| Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls | 2012-11-02 | Paper |
| A Linear Kernel for the Complementary Maximal Strip Recovery Problem | 2012-08-14 | Paper |
| A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves | 2012-08-08 | Paper |
| Minimum common string partition revisited | 2012-07-17 | Paper |
| Exact and approximation algorithms for the complementary maximal strip recovery problem | 2012-07-17 | Paper |
| Erratum: The Approximability of the Exemplar Breakpoint Distance Problem | 2012-07-16 | Paper |
| Voronoi Diagram with Visual Restriction | 2012-07-16 | Paper |
| Continuous-Time Moving Network Voronoi Diagram | 2012-03-09 | Paper |
| Fréchet-Distance on Road Networks | 2011-11-11 | Paper |
| Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data | 2011-08-17 | Paper |
| Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem | 2011-08-12 | Paper |
| Minimum Interval Cover and Its Application to Genome Sequencing | 2011-08-12 | Paper |
| Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies | 2011-06-29 | Paper |
| On Some Geometric Problems of Color-Spanning Sets | 2011-06-03 | Paper |
| On the red/blue spanning tree problem | 2011-05-18 | Paper |
| VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE | 2010-09-30 | Paper |
| Guarding a terrain by two watchtowers | 2010-09-16 | Paper |
| Minimum Common String Partition Revisited | 2010-09-07 | Paper |
| Breakpoint Distance and PQ-Trees | 2010-07-26 | Paper |
| A Linear Kernel for Co-Path/Cycle Packing | 2010-07-20 | Paper |
| Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery | 2010-07-20 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Parametric search: three new applications | 2010-02-26 | Paper |
| A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction | 2009-12-04 | Paper |
| On recovering syntenic blocks from comparative maps | 2009-12-02 | Paper |
| The Canadian Traveller Problem and its competitive analysis | 2009-11-16 | Paper |
| Efficient Algorithms for the Closest String and Distinguishing String Selection Problems | 2009-07-14 | Paper |
| On the Tractability of Maximal Strip Recovery | 2009-06-03 | Paper |
| Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems | 2009-06-03 | Paper |
| On the Red/Blue Spanning Tree Problem | 2009-06-03 | Paper |
| A simple factor-3 approximation for labeling points with circles | 2009-04-28 | Paper |
| Volume Computation Using a Direct Monte Carlo Method | 2009-03-06 | Paper |
| On Recovering Syntenic Blocks from Comparative Maps | 2009-01-27 | Paper |
| Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance | 2008-07-10 | Paper |
| Non-breaking Similarity of Genomes with Gene Repetitions | 2008-06-17 | Paper |
| On the inapproximability of the exemplar conserved interval distance problem of genomes | 2008-05-13 | Paper |
| Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. | 2008-04-25 | Paper |
| Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance | 2008-04-15 | Paper |
| A combinatorial theorem on labeling squares with points and its application | 2008-04-04 | Paper |
| The Approximability of the Exemplar Breakpoint Distance Problem | 2008-01-04 | Paper |
| RNA multiple structural alignment with longest common subsequences | 2007-10-12 | Paper |
| Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes | 2007-09-10 | Paper |
| Computational Science and Its Applications – ICCSA 2004 | 2007-07-19 | Paper |
| Computational Science and Its Applications – ICCSA 2004 | 2007-07-19 | Paper |
| On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction | 2007-01-09 | Paper |
| On a minimum linear classification problem | 2006-09-26 | Paper |
| A PTAS for a disc covering problem using width-bounded separators | 2006-08-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461495 | 2005-07-26 | Paper |
| EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING | 2005-06-10 | Paper |
| APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS | 2005-02-28 | Paper |
| New approximation algorithms for map labeling with sliding labels | 2005-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046482 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808663 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472484 | 2004-08-04 | Paper |
| On a minimum linear classification problem | 2003-08-21 | Paper |
| Polynomial time algorithms for three-label point labeling. | 2003-08-17 | Paper |
| Some problems on factorizations with constraints in bipartite graphs | 2003-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551354 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551359 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4538059 | 2002-07-11 | Paper |
| Fast range searching with Delaunay triangulations | 2002-06-02 | Paper |
| Some formal analysis of Rocchio's similarity-based relevance feedback algorithm | 2002-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753953 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729098 | 2001-10-23 | Paper |
| On some polyhedra covering problems | 2001-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525742 | 2001-01-24 | Paper |
| Three-dimensional weak visibility: Complexity and applications | 2000-08-21 | Paper |
| INTERSECTIONS OF RANDOM LINE SEGMENTS | 2000-06-21 | Paper |
| Computing the degree-4 shortest network under a given topology | 2000-06-07 | Paper |
| A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors | 2000-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766841 | 2000-01-01 | Paper |
| Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations | 1999-10-20 | Paper |
| A note on point location in Delaunay triangulations of random points | 1999-02-02 | Paper |
| Feasibility of design in stereolithography | 1998-02-04 | Paper |
| Guarding polyhedral terrains | 1997-03-18 | Paper |
| Computing the shortest diagonal of a monotone polygon in linear time | 1993-01-16 | Paper |
| Counting \(k\)-subsets and convex \(k\)-gons in the plane | 1992-06-26 | Paper |
