The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. - Frank Gurski; Egon Wanke (WG, 2000)

How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. - Wolfgang Espelage; Frank Gurski; Egon Wanke (WG, 2001)

Deciding Clique-Width for Graphs of Bounded Tree-Width. - Wolfgang Espelage; Frank Gurski; Egon Wanke (J. Graph Algorithms Appl., 2003)

Effiziente Algorithmen für baumstrukturierte Graphklassen. - Frank Gurski (2003)

Minimizing NLC-Width is NP-Complete. - Frank Gurski; Egon Wanke (WG, 2005)

On the relationship between NLC-width and linear NLC-width. - Frank Gurski; Egon Wanke (Theor. Comput. Sci., 2005)

Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. - Frank Gurski (Discret. Math., 2006)

Linear layouts measuring neighbourhoods in graphs. - Frank Gurski (Discret. Math., 2006)

Vertex disjoint paths on clique-width bounded graphs. - Frank Gurski; Egon Wanke (Theor. Comput. Sci., 2006)

The Clique-Width of Tree-Power and Leaf-Power Graphs. - Frank Gurski; Egon Wanke (WG, 2007)

A note on module-composed graphs - Frank Gurski (CoRR, 2007)

Graph Operations on Clique-Width Bounded Graphs - Frank Gurski (CoRR, 2007)

A local characterization of bounded clique-width for line graphs. - Frank Gurski; Egon Wanke (Discret. Math., 2007)

Line graphs of bounded clique-width. - Frank Gurski; Egon Wanke (Discret. Math., 2007)

Characterizations for restricted graphs of NLC-width 2. - Frank Gurski (Theor. Comput. Sci., 2007)

A comparison of two approaches for polynomial time algorithms computing basic graph parameters - Frank Gurski (CoRR, 2008)

Graph parameters measuring neighbourhoods in graphs - Bounds and applications. - Frank Gurski (Discret. Appl. Math., 2008)

Polynomial algorithms for protein similarity search for restricted mRNA structures. - Frank Gurski (Inf. Process. Lett., 2008)

On Module-Composed Graphs. - Frank Gurski; Egon Wanke (WG, 2009)

The NLC-width and clique-width for powers of graphs of bounded tree-width. - Frank Gurski; Egon Wanke (Discret. Appl. Math., 2009)

Exakte Algorithmen für schwere Graphenprobleme. - Frank Gurski; Irene Rothe; Jörg Rothe; Egon Wanke (Springer, 2010)

Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues. - Frank Gurski; Jochen Rethmann; Egon Wanke (OR, 2013)

Algorithms for Controlling Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (OR, 2014)

Capital Budgeting Problems: A Parameterized Point of View. - Frank Gurski; Jochen Rethmann; Eda Yilmaz (OR, 2014)

Binary linear programming solutions and non-approximability for control problems in voting systems. - Frank Gurski; Magnus Roos (Discret. Appl. Math., 2014)

Directed Pathwidth and Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (COCOA, 2015)

A Practical Approach for the FIFO Stack-Up Problem. - Frank Gurski; Jochen Rethmann; Egon Wanke (MCO (2), 2015)

An Experimental Study of Algorithms for Controlling Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (OR, 2015)

Computing Partitions with Applications to Capital Budgeting Problems. - Frank Gurski; Jochen Rethmann; Eda Yilmaz (OR, 2015)

Linear Programming Formulations for Computing Graph Layout Parameters. - Frank Gurski (Comput. J., 2015)

Integer Programming Models and Parameterized Algorithms for Controlling Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (CoRR, 2015)

Distributed Solving of Mixed-Integer Programs with GLPK and Thrift. - Frank Gurski; Jochen Rethmann (OR, 2016)

On-Line Algorithms for Controlling Palletizers. - Frank Gurski; Jochen Rethmann; Egon Wanke (OR, 2016)

Knapsack Problems: A Parameterized Point of View. - Carolin Albrecht; Frank Gurski; Jochen Rethmann; Eda Yilmaz (CoRR, 2016)

Neighbourhood-width of trees. - Frank Gurski; Stefan Neidig; Eda Yilmaz (Discret. Math., 2016)

On the complexity of the FIFO stack-up problem. - Frank Gurski; Jochen Rethmann; Egon Wanke (Math. Methods Oper. Res., 2016)

Directed NLC-width. - Frank Gurski; Egon Wanke; Eda Yilmaz (Theor. Comput. Sci., 2016)

A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time. - Carolin Rehs; Frank Gurski (OR, 2017)

Counting and Enumerating Independent Sets with Applications to Knapsack Problems. - Frank Gurski; Carolin Rehs (CoRR, 2017)

Interval Routing Schemes for Circular-Arc Graphs. - Frank Gurski; Patrick Gwydion Poullie (Int. J. Found. Comput. Sci., 2017)

Change-making problems revisited: a parameterized point of view. - Steffen Goebbels; Frank Gurski; Jochen Rethmann; Eda Yilmaz (J. Comb. Optim., 2017)

The Behavior of Clique-Width under Graph Operations and Graph Transformations. - Frank Gurski (Theory Comput. Syst., 2017)

Directed Path-Width of Sequence Digraphs. - Frank Gurski; Carolin Rehs; Jochen Rethmann (COCOA, 2018)

Directed Path-Width and Directed Tree-Width of Directed Co-graphs. - Frank Gurski; Carolin Rehs (COCOON, 2018)

The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width. - Frank Gurski; Carolin Rehs (OR, 2018)

Computing directed path-width and directed tree-width of recursively defined digraphs. - Frank Gurski; Carolin Rehs (CoRR, 2018)

Characterizations for Special Directed Co-graphs. - Frank Gurski; Dominique Komander; Carolin Rehs (COCOA, 2019)

Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). - Frank Gurski; Dominique Komander; Carolin Rehs (FCT, 2019)

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. - Frank Gurski; Stefan Hoffmann 002; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (OR, 2019)

Subset Sum Problems with Special Digraph Constraints. - Frank Gurski; Dominique Komander; Carolin Rehs (OR, 2019)

Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. - Frank Gurski; Carolin Rehs (SOFSEM, 2019)

Oriented Coloring on Recursively Defined Digraphs. - Frank Gurski; Dominique Komander; Carolin Rehs (Algorithms, 2019)

Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. - Frank Gurski; Carolin Rehs (Math. Methods Oper. Res., 2019)

Comparing Linear Width Parameters for Directed Graphs. - Frank Gurski; Carolin Rehs (Theory Comput. Syst., 2019)

Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. - Frank Gurski; Carolin Rehs; Jochen Rethmann; Egon Wanke (OR Spectr., 2019)

Knapsack problems: A parameterized point of view. - Frank Gurski; Carolin Rehs; Jochen Rethmann (Theor. Comput. Sci., 2019)

On the hardness of palletizing bins using FIFO queues. - Frank Gurski; Carolin Rehs; Jochen Rethmann (Theor. Comput. Sci., 2019)

Oriented Coloring of msp-Digraphs and Oriented Co-graphs (Extended Abstract). - Frank Gurski; Dominique Komander; Marvin Lindemann (COCOA, 2020)

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). - Frank Gurski; Stefan Hoffmann 002; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (SOFSEM, 2020)

Acyclic coloring of special digraphs. - Frank Gurski; Dominique Komander; Carolin Rehs (CoRR, 2020)

Solutions for subset sum problems with special digraph constraints. - Frank Gurski; Dominique Komander; Carolin Rehs (Math. Methods Oper. Res., 2020)

Counting and enumerating independent sets with applications to combinatorial optimization problems. - Frank Gurski; Carolin Rehs (Math. Methods Oper. Res., 2020)

Acyclic Coloring Parameterized by Directed Clique-Width. - Frank Gurski; Dominique Komander; Carolin Rehs (CALDAM, 2021)

Directed Width Parameters on Semicomplete Digraphs. - Frank Gurski; Dominique Komander; Carolin Rehs; Sebastian Wiederrecht (COCOA, 2021)

The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs. - Steffen Goebbels; Frank Gurski; Dominique Komander (OR, 2021)

Oriented Vertex and Arc Coloring of Edge Series-Parallel Digraphs. - Frank Gurski; Dominique Komander; Marvin Lindemann (OR, 2021)

Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. - Frank Gurski; Dominique Komander; Marvin Lindemann (WALCOM, 2021)

On characterizations for subclasses of directed co-graphs. - Frank Gurski; Dominique Komander; Carolin Rehs (J. Comb. Optim., 2021)

Efficient computation of the oriented chromatic number of recursively defined digraphs. - Frank Gurski; Dominique Komander; Marvin Lindemann (Theor. Comput. Sci., 2021)

How to compute digraph width measures on directed co-graphs. - Frank Gurski; Dominique Komander; Carolin Rehs (Theor. Comput. Sci., 2021)

Efficient computation of oriented vertex and arc colorings of special digraphs. - Frank Gurski; Dominique Komander; Marvin Lindemann (CoRR, 2022)

Computing directed Steiner path covers. - Frank Gurski; Dominique Komander; Carolin Rehs; Jochen Rethmann; Egon Wanke (J. Comb. Optim., 2022)

The knapsack problem with special neighbor constraints. - Steffen Goebbels; Frank Gurski; Dominique Komander (Math. Methods Oper. Res., 2022)

Correction to: Solutions for subset sum problems with special digraph constraints. - Frank Gurski; Dominique Komander; Carolin Rehs (Math. Methods Oper. Res., 2022)

Characterizations and Directed Path-Width of Sequence Digraphs. - Frank Gurski; Carolin Rehs; Jochen Rethmann (Theory Comput. Syst., 2023)

The Behavior of Tree-Width and Path-Width under Graph Operations and Graph Transformations. - Frank Gurski; Robin Weishaupt (CoRR, 2024)

Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. - Frank Gurski; Jörg Rothe; Robin Weishaupt (Theory Comput. Syst., 2024)