| Publication | Date of Publication | Type |
|---|
| Stability, vertex stability, and unfrozenness for special graph classes | 2024-02-09 | Paper |
| Characterizations and directed path-width of sequence digraphs | 2023-05-02 | Paper |
| Oriented coloring of msp-digraphs and oriented co-graphs (extended abstract) | 2023-03-21 | Paper |
| Directed width parameters on semicomplete digraphs | 2022-06-29 | Paper |
| Computing directed Steiner path covers | 2022-04-13 | Paper |
| The knapsack problem with special neighbor constraints | 2022-04-08 | Paper |
| Acyclic coloring parameterized by directed clique-width | 2022-03-24 | Paper |
| Efficient computation of the oriented chromatic number of recursively defined digraphs | 2021-10-21 | Paper |
| Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs | 2021-10-04 | Paper |
| Exact solutions for the Steiner path cover problem on special graph classes | 2021-08-30 | Paper |
| Subset sum problems with special digraph constraints | 2021-08-30 | Paper |
| On characterizations for subclasses of directed co-graphs | 2021-05-11 | Paper |
| How to compute digraph width measures on directed co-graphs | 2021-01-25 | Paper |
| Efficient computation of the oriented chromatic number of recursively defined digraphs | 2020-12-26 | Paper |
| Solutions for subset sum problems with special digraph constraints | 2020-12-15 | Paper |
| Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs | 2020-10-22 | Paper |
| Counting and enumerating independent sets with applications to combinatorial optimization problems | 2020-08-03 | Paper |
| Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) | 2020-07-20 | Paper |
| Characterizations for special directed co-graphs | 2020-05-13 | Paper |
| Computing digraph width measures on directed co-graphs (extended abstract) | 2020-01-30 | Paper |
| Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms | 2020-01-15 | Paper |
| On the hardness of palletizing bins using FIFO queues | 2019-10-18 | Paper |
| Directed path-width of sequence digraphs | 2019-10-11 | Paper |
| Comparing linear width parameters for directed graphs | 2019-09-05 | Paper |
| Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width | 2019-07-10 | Paper |
| Oriented coloring on recursively defined digraphs | 2019-07-08 | Paper |
| Knapsack problems: a parameterized point of view | 2019-05-29 | Paper |
| A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time | 2018-10-09 | Paper |
| Directed path-width and directed tree-width of directed co-graphs | 2018-10-04 | Paper |
| Computing directed path-width and directed tree-width of recursively defined digraphs | 2018-06-12 | Paper |
| An Experimental Study of Algorithms for Controlling Palletizers | 2017-12-01 | Paper |
| Computing Partitions with Applications to Capital Budgeting Problems | 2017-12-01 | Paper |
| On-Line Algorithms for Controlling Palletizers | 2017-12-01 | Paper |
| Distributed Solving of Mixed-Integer Programs with GLPK and Thrift | 2017-12-01 | Paper |
| Change-making problems revisited: a parameterized point of view | 2017-11-09 | Paper |
| A Practical Approach for the FIFO Stack-Up Problem | 2017-09-12 | Paper |
| Interval Routing Schemes for Circular-Arc Graphs | 2017-04-26 | Paper |
| The behavior of clique-width under graph operations and graph transformations | 2017-03-31 | Paper |
| Algorithms for Controlling Palletizers | 2016-05-19 | Paper |
| Capital Budgeting Problems: A Parameterized Point of View | 2016-05-19 | 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 |
| Neighbourhood-width of trees | 2015-10-08 | Paper |
| Binary linear programming solutions and non-approximability for control problems in voting systems | 2014-09-12 | Paper |
| Exakte Algorithmen für schwere Graphenprobleme | 2010-07-19 | Paper |
| Polynomial algorithms for protein similarity search for restricted mRNA structures | 2010-03-24 | 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 |
| Graph parameters measuring neighbourhoods in graphs-bounds and applications | 2008-09-10 | 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 |
| Characterizations for restricted graphs of NLC-width 2 | 2007-03-15 | 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 |
| Linear layouts measuring neighbourhoods in graphs | 2006-09-13 | Paper |
| Characterizations for co-graphs defined by restricted NLC-width or clique-width operations | 2006-03-29 | Paper |
| On the relationship between NLC-width and linear NLC-width | 2005-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448752 | 2004-02-18 | Paper |
| Deciding Clique-Width for Graphs of Bounded Tree-Width | 2003-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778545 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766682 | 2002-07-09 | Paper |
