| Publication | Date of Publication | Type |
|---|
| Approximation algorithms for the longest run subsequence problem | 2024-10-21 | Paper |
| Shortest longest-path graph orientations | 2024-08-22 | Paper |
| Approximation algorithms for covering vertices by long paths | 2024-08-13 | Paper |
| Approximation algorithms for covering vertices by long paths | 2024-08-06 | Paper |
| A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops | 2024-05-30 | Paper |
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants | 2024-05-29 | Paper |
| On computing a center persistence diagram | 2024-05-29 | Paper |
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants | 2024-05-06 | Paper |
| Happy set problem on subclasses of co-comparability graphs | 2023-11-17 | Paper |
| Path cover problems with length cost | 2023-11-17 | 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 |
| Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles | 2022-12-22 | Paper |
| Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing | 2022-08-26 | Paper |
| Happy set problem on subclasses of co-comparability graphs | 2022-07-13 | Paper |
| Path cover problems with length cost | 2022-07-13 | Paper |
| Upper and lower degree-constrained graph orientation with minimum penalty | 2021-12-22 | Paper |
| Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing | 2021-12-20 | 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 |
| Graph classes and approximability of the happy set problem | 2021-04-21 | Paper |
| Graph Orientation with Edge Modifications | 2021-04-19 | Paper |
| Complexity and approximability of the happy set problem | 2021-04-14 | Paper |
| How to pack directed acyclic graphs into small blocks | 2020-11-02 | Paper |
| Graph orientation with splits | 2020-10-21 | 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 |
| Exact algorithms for the bounded repetition longest common subsequence problem | 2020-05-13 | Paper |
| Graph orientation with edge modifications | 2019-10-11 | Paper |
| A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan | 2019-04-26 | Paper |
| Graph orientation with splits | 2018-08-17 | Paper |
| Complexity of the maximum \(k\)-path vertex cover problem | 2018-06-15 | Paper |
| An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops | 2018-06-05 | Paper |
| Optimal approximation algorithms for maximum distance-bounded subgraph problems | 2018-06-01 | Paper |
| Improved approximation algorithms for the maximum happy vertices and edges problems | 2018-05-18 | Paper |
| Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs | 2017-05-05 | Paper |
| Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs | 2017-02-01 | Paper |
| Degree-constrained graph orientation: maximum satisfaction and minimum violation | 2016-03-21 | Paper |
| Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems | 2016-02-05 | Paper |
| Graph Orientations Optimizing the Number of Light or Heavy Vertices | 2015-10-29 | Paper |
| Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes | 2015-05-20 | Paper |
| Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation | 2014-09-02 | Paper |
| Complexity of finding maximum regular induced subgraphs with prescribed degree | 2014-08-26 | Paper |
| Optimal approximability of bookmark assignments | 2014-04-10 | Paper |
| Distance-\(d\) independent set problems for bipartite and chordal graphs | 2014-02-25 | Paper |
| (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation | 2013-12-09 | Paper |
| Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree | 2013-08-16 | Paper |
| Graph Orientations Optimizing the Number of Light or Heavy Vertices | 2012-11-02 | Paper |
| Distance-d Independent Set Problems for Bipartite and Chordal Graphs | 2012-11-02 | Paper |
| Optimal distortion embedding of complete binary trees into lines | 2012-07-20 | Paper |
| NP-hardness of the sorting buffer problem on the uniform metric | 2012-06-18 | Paper |
| (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation | 2011-08-17 | Paper |
| Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree | 2011-06-17 | Paper |
| GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE | 2011-05-10 | Paper |
| Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree | 2011-04-19 | Paper |
| Weighted nearest neighbor algorithms for the graph exploration problem on cycles | 2010-09-02 | Paper |
| Approximating Maximum Diameter-Bounded Subgraphs | 2010-04-27 | Paper |
| Drawing borders efficiently | 2009-08-06 | Paper |
| On Approximation of Bookmark Assignments | 2008-09-17 | Paper |
| Grasp and delivery for moving objects on broken lines | 2008-04-11 | Paper |
| Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles | 2008-03-07 | Paper |
| Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree | 2008-01-04 | Paper |
| Drawing Borders Efficiently | 2007-11-15 | Paper |
| How to Pack Directed Acyclic Graphs into Small Blocks | 2007-05-02 | Paper |
| GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE | 2007-04-25 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size | 2002-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331308 | 2002-05-15 | Paper |
| New bounds for oblivious mesh routing | 2002-01-07 | Paper |
| A lower bound for elementary oblivious routing on three-dimensional meshes | 2001-12-12 | Paper |
| Efficient randomized routing algorithms on the two-dimensional mesh of buses | 2001-08-20 | Paper |
| Oblivious routing algorithms on the mesh of buses | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252322 | 2000-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937847 | 2000-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937193 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218425 | 1998-11-11 | Paper |
| Better approximations of non-Hamiltonian graphs | 1998-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687264 | 1996-12-11 | Paper |
| Routing Problems on the Mesh of Buses | 1996-08-21 | Paper |
