| 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 |
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants | 2024-05-29 | Paper |
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants | 2024-05-06 | Paper |
| Compatibility of convergence algorithms for autonomous mobile robots (extended abstract) | 2024-01-11 | 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 |
| Finding dense subgraphs | 2023-03-21 | Paper |
| Greedily finding a dense subgraph | 2022-12-09 | Paper |
| Monotonic self-stabilization and its application to robust and adaptive pattern formation | 2022-10-06 | Paper |
| Upper and lower degree-constrained graph orientation with minimum penalty | 2021-12-22 | Paper |
| Parameterized algorithms for the happy set problem | 2021-09-30 | 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 |
| Graph orientation with splits | 2018-08-17 | Paper |
| Optimal approximation algorithms for maximum distance-bounded subgraph problems | 2018-06-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 |
| 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 |
| (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation | 2013-12-09 | Paper |
| How to collect balls moving in the Euclidean plane | 2013-08-30 | 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 |
| NP-hardness of the sorting buffer problem on the uniform metric | 2012-06-18 | Paper |
| \((1 + \epsilon )\)-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 |
| 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 |
| 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 |
| How to collect balls moving in the Euclidean plane | 2007-01-09 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046537 | 2004-08-12 | Paper |
| Complexity of finding dense subgraphs | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331288 | 2002-05-15 | Paper |
| Greedily Finding a Dense Subgraph | 2000-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687264 | 1996-12-11 | Paper |
