| Publication | Date of Publication | Type |
|---|
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants | 2024-05-06 | Paper |
| Approximating the directed path partition problem | 2024-03-27 | Paper |
| Path cover problems with length cost | 2023-11-17 | Paper |
| Approximation algorithms and a hardness result for the three-machine proportionate mixed shop | 2023-10-16 | Paper |
| Independent set under a change constraint from an initial solution | 2023-10-04 | Paper |
| Corrigendum to: ``Complexity and approximability of the happy set problem | 2023-09-21 | Paper |
| Approximation algorithms for the directed path partition problems | 2023-08-10 | Paper |
| Improved approximation algorithms for multiprocessor scheduling with testing | 2023-08-10 | Paper |
| Planar graphs are acyclically edge $(\Delta + 5)$-colorable | 2023-06-27 | Paper |
| Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles | 2022-12-22 | Paper |
| A local search 4/3-approximation algorithm for the minimum 3-path partition problem | 2022-10-31 | Paper |
| Approximation algorithms for the maximally balanced connected graph tripartition problem | 2022-10-04 | Paper |
| A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling | 2022-08-26 | Paper |
| Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing | 2022-08-26 | Paper |
| Path cover problems with length cost | 2022-07-13 | Paper |
| Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph | 2022-04-13 | Paper |
| Approximation algorithms for maximally balanced connected graph partition | 2022-01-18 | Paper |
| An improved approximation algorithm for the minimum common integer partition problem | 2021-11-25 | Paper |
| Parameterized algorithms for the happy set problem | 2021-09-30 | Paper |
| Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles | 2021-08-11 | Paper |
| Improved hardness and approximation results for single allocation hub location | 2021-07-05 | Paper |
| A randomized approximation algorithm for metric triangle packing | 2021-05-11 | Paper |
| A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem | 2021-05-03 | Paper |
| Graph classes and approximability of the happy set problem | 2021-04-21 | Paper |
| Complexity and approximability of the happy set problem | 2021-04-14 | Paper |
| Improved hardness and approximation results for single allocation hub location problems | 2021-04-08 | Paper |
| Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments | 2020-12-11 | Paper |
| A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem | 2020-11-25 | Paper |
| Improved approximation algorithms for path vertex covers in regular graphs | 2020-10-12 | Paper |
| Exact algorithms for the repetition-bounded longest common subsequence problem | 2020-09-01 | Paper |
| Parameterized algorithms for the happy set problem | 2020-07-22 | Paper |
| A randomized approximation algorithm for metric triangle packing | 2020-05-13 | Paper |
| Approximation algorithms for maximally balanced connected graph partition | 2020-05-13 | Paper |
| Exact algorithms for the bounded repetition longest common subsequence problem | 2020-05-13 | Paper |
| Single-machine scheduling with job-dependent machine deterioration | 2020-02-12 | Paper |
| Open-shop scheduling for unit jobs under precedence constraints | 2019-12-27 | Paper |
| Approximation algorithms for the three-machine proportionate mixed shop scheduling | 2019-12-27 | Paper |
| Approximation algorithms for the maximum weight internal spanning tree problem | 2019-10-17 | Paper |
| Open-shop scheduling for unit jobs under precedence constraints | 2019-10-11 | Paper |
| A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem | 2019-10-11 | Paper |
| Rescheduling due to machine disruption to minimize the total weighted completion time | 2019-08-08 | Paper |
| An approximation algorithm for genome sorting by reversals to recover all adjacencies | 2019-06-25 | Paper |
| An improved approximation algorithm for the minimum 3-path partition problem | 2019-06-25 | Paper |
| A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops | 2019-06-06 | Paper |
| A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan | 2019-04-26 | Paper |
| Algorithms for communication scheduling in data gathering network with data compression | 2019-01-11 | Paper |
| Single machine scheduling with job delivery to multiple customers | 2018-11-07 | Paper |
| Approximation algorithms for two-machine flow-shop scheduling with a conflict graph | 2018-10-04 | Paper |
| An approximation framework for bounded facility location problems | 2018-10-04 | Paper |
| Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments | 2018-07-25 | Paper |
| The Steiner traveling salesman problem with online advanced edge blockages | 2018-07-12 | Paper |
| An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops | 2018-06-05 | Paper |
| Improved approximation algorithms for the maximum happy vertices and edges problems | 2018-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636539 | 2018-04-19 | Paper |
| Approximation algorithms for the maximum weight internal spanning tree problem | 2017-10-23 | Paper |
| Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem | 2017-06-13 | Paper |
| Machine scheduling with a maintenance interval and job delivery coordination | 2017-03-28 | Paper |
| An FPTAS for the parallel two-stage flowshop problem | 2017-02-06 | Paper |
| The Steiner traveling salesman problem with online edge blockages | 2016-10-06 | Paper |
| Approximating the maximum multiple RNA interaction problem | 2016-06-27 | Paper |
| Steiner tree problem with minimum number of Steiner points and bounded edge-length | 2016-06-16 | Paper |
| An improved two-machine flowshop scheduling with intermediate transportation | 2016-04-13 | Paper |
| A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines | 2016-02-23 | Paper |
| Improved parameterized and exact algorithms for cut problems on trees | 2015-12-11 | Paper |
| Smoothed heights of tries and patricia tries | 2015-12-11 | Paper |
| Competitive algorithms for unbounded one-way trading | 2015-12-08 | Paper |
| Machine Scheduling with a Maintenance Interval and Job Delivery Coordination | 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 |
| An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem | 2015-09-11 | Paper |
| Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights | 2015-05-20 | Paper |
| Approximating the minimum independent dominating set in perturbed graphs | 2014-10-06 | Paper |
| On the Smoothed Heights of Trie and Patricia Index Trees | 2014-09-26 | Paper |
| On the approximability of the exemplar adjacency number problem for genomes with gene repetitions | 2014-08-26 | Paper |
| Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems | 2014-04-16 | Paper |
| Approximation Algorithms for the Maximum Multiple RNA Interaction Problem | 2013-12-10 | Paper |
| Approximating the Minimum Independent Dominating Set in Perturbed Graphs | 2013-06-11 | Paper |
| DIAMETER-CONSTRAINED STEINER TREES | 2012-08-27 | Paper |
| An improved approximation algorithm for the complementary maximal strip recovery problem | 2012-08-17 | Paper |
| Exact and approximation algorithms for the complementary maximal strip recovery problem | 2012-07-17 | Paper |
| An Improved Approximation Algorithm for the Bandpass Problem | 2012-07-16 | Paper |
| Solving haplotype inference problem with non-genotyped founders via integer linear programming | 2012-07-10 | Paper |
| An approximation algorithm for the minimum co-path set problem | 2011-07-01 | Paper |
| On the bandpass problem | 2011-06-17 | Paper |
| An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem | 2011-06-03 | Paper |
| The three column bandpass problem is solvable in linear time | 2011-02-02 | Paper |
| Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem | 2011-01-28 | Paper |
| Diameter-Constrained Steiner Tree | 2011-01-10 | Paper |
| Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering | 2011-01-08 | Paper |
| Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive | 2010-07-20 | Paper |
| Linear time construction of 5-phylogenetic roots for tree chordal graphs | 2010-03-09 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors | 2010-01-29 | Paper |
| Vertex covering by paths on trees with its applications in machine translation | 2009-12-18 | Paper |
| A 3.4713-approximation algorithm for the capacitated multicast tree routing problem | 2009-11-25 | Paper |
| Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders | 2009-11-13 | Paper |
| Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting | 2009-07-07 | Paper |
| Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem | 2009-07-07 | Paper |
| On the upper bounds of the minimum number of rows of disjunct matrices | 2009-06-17 | Paper |
| An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem | 2009-01-27 | Paper |
| Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem | 2007-12-20 | Paper |
| In memoriam: Yong He (1969--2005) | 2007-10-12 | Paper |
| The longest common subsequence problem for arc-annotated sequences | 2007-04-26 | Paper |
| Strictly chordal graphs are leaf powers | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2006-06-23 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| An improved approximation algorithm for multicast \(k\)-tree routing | 2005-12-14 | Paper |
| Clustering binary oligonucleotide fingerprint vectors for DNA clone classification analysis | 2005-06-08 | Paper |
| A further improved approximation algorithm for breakpoint graph decomposition | 2005-03-15 | Paper |
| 3-partitioning problems for maximizing the minimum load | 2005-01-17 | Paper |
| A space-efficient algorithm for sequence alignment with inversions and reversals | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472526 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408109 | 2003-07-02 | Paper |
| Computing Phylogenetic Roots with Bounded Degrees and Errors | 2003-06-19 | Paper |
| Approximation algorithms for NMR spectral peak assignment. | 2003-05-25 | Paper |
| The longest common subsequence problem for sequences with nested arc annotations. | 2003-05-14 | Paper |
| Methods for reconstructing the history of tandem repeats and their application to the human genome. | 2003-05-14 | Paper |
| On the terminal Steiner tree problem. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778572 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766831 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535038 | 2002-06-12 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2002-03-03 | Paper |
| Reducing the Steiner problem in four uniform orientations | 2001-12-12 | Paper |
| On minimum-weight \(k\)-edge connected Steiner networks on metric spaces | 2001-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723948 | 2001-07-08 | Paper |
| Decision tree complexity of graph properties with dimension at most 5 | 2001-05-28 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2001-03-20 | Paper |
| Grade of service Steiner minimum trees in the Euclidean plane | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515737 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938658 | 2000-10-03 | Paper |
| On Rearrangeability of Multirate Clos Networks | 1999-10-28 | Paper |
| Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times | 1999-02-18 | Paper |
| K-center and K-median problems in graded distances | 1999-01-12 | Paper |
| The exact bound of Lee's MLPT | 1998-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4368203 | 1998-06-08 | Paper |
| Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times | 1998-03-18 | Paper |
