| Publication | Date of Publication | Type |
|---|
| Exponential time analysis of confluent and boundary eNCE graph languages | 2024-01-05 | Paper |
| Bounded tree-width and LOGCFL | 2024-01-05 | Paper |
| A note on the complexity of \(k\)\textsc{-metric dimension} | 2023-09-11 | Paper |
| An approximation algorithm for stacking up bins from a conveyer onto pallets | 2022-08-19 | Paper |
| Computing directed Steiner path covers | 2022-04-13 | Paper |
| Competitive analysis of on-line stack-up algorithms | 2021-12-20 | Paper |
| Exact solutions for the Steiner path cover problem on special graph classes | 2021-08-30 | Paper |
| Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) | 2020-07-20 | Paper |
| The fault-tolerant metric dimension of cographs | 2020-01-30 | Paper |
| Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms | 2020-01-15 | Paper |
| Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components | 2019-10-15 | Paper |
| Polynomial time analysis of toroidal periodic graphs | 2019-04-29 | Paper |
| The Fault-Tolerant Metric Dimension of Cographs | 2019-04-07 | Paper |
| The bounded degree problem for non-obstructing eNCE graph grammars | 2019-01-10 | Paper |
| Computing the metric dimension by decomposing graphs into extended biconnected components | 2018-06-27 | Paper |
| Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements | 2018-05-25 | Paper |
| An Experimental Study of Algorithms for Controlling Palletizers | 2017-12-01 | Paper |
| On-Line Algorithms for Controlling Palletizers | 2017-12-01 | Paper |
| A Practical Approach for the FIFO Stack-Up Problem | 2017-09-12 | Paper |
| Algorithms for Controlling Palletizers | 2016-05-19 | Paper |
| A linear time algorithm for metric dimension of cactus block graphs | 2016-05-02 | Paper |
| On the complexity of the FIFO stack-up problem | 2016-03-24 | Paper |
| Directed Pathwidth and Palletizers | 2016-02-05 | Paper |
| Directed NLC-width | 2016-01-21 | Paper |
| Exakte Algorithmen für schwere Graphenprobleme | 2010-07-19 | Paper |
| On Module-Composed Graphs | 2010-01-21 | Paper |
| The NLC-width and clique-width for powers of graphs of bounded tree-width | 2009-06-30 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| The Clique-Width of Tree-Power and Leaf-Power Graphs | 2008-07-01 | Paper |
| Line graphs of bounded clique-width | 2007-11-27 | Paper |
| A local characterization of bounded clique-width for line graphs | 2007-03-02 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Vertex disjoint paths on clique-width bounded graphs | 2006-09-14 | Paper |
| On the relationship between NLC-width and linear NLC-width | 2005-12-29 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| A linear time approximation algorithm for movement minimization in conveyor flow shop processing | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448752 | 2004-02-18 | Paper |
| Deciding Clique-Width for Graphs of Bounded Tree-Width | 2003-11-30 | Paper |
| Movement optimization in flow shop processing with buffers. | 2003-10-16 | Paper |
| The combinatorial complexity of masterkeying | 2003-08-07 | Paper |
| Movement minimization for unit distances in conveyor flow shop processing | 2003-06-26 | Paper |
| Node replacements in embedding normal form. | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779158 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778545 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766682 | 2002-07-09 | Paper |
| Stack-up algorithms for palletizing at delivery industry | 2001-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502804 | 2000-09-12 | Paper |
| An approximation algorithm for the stack-up problem | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952621 | 2000-05-10 | Paper |
| Polynomial-Time Analysis of Toroidal Periodic Graphs | 2000-03-16 | Paper |
| Storage controlled pile-up systems, theoretical foundations | 1999-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266530 | 1999-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260370 | 1999-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233344 | 1999-03-16 | Paper |
| The bounded degree problem for eNCE graph grammars | 1997-08-11 | Paper |
| Minimum Cost Paths in Periodic Graphs | 1996-06-09 | Paper |
| Emptiness problems of eNCE graph languages | 1996-02-26 | Paper |
| Undecidability of restricted uniform recurrence equations | 1995-11-19 | Paper |
| \(k\)-NLC graphs and polynomial algorithms | 1994-11-03 | Paper |
| On the decidability of certain integer subgraph problems on context-free graph languages | 1994-09-13 | Paper |
| Bounded Tree-Width and LOGCFL | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281576 | 1994-03-10 | Paper |
| The complexity of connectivity problems on context-free graph languages | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140457 | 1993-12-15 | Paper |
| Efficient decision procedures for graph properties on context-free graph languages | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037298 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995732 | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974888 | 1992-06-26 | Paper |
| Algorithms for graph problems on BNLC structured garphs | 1992-06-25 | Paper |
| Undecidability of the bandwidth problem on linear graph languages | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795251 | 1988-01-01 | Paper |
| Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830538 | 1988-01-01 | Paper |
