Frank Gurski

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 59

Top Venues

CoRR

Math. Methods Oper. Res.

Theor. Comput. Sci.

University of Düsseldorf, Germany (PHD)

Education History

University of Düsseldorf, Germany

PHD

Publications

Frank Gurski, Robin Weishaupt
The Behavior of Tree-Width and Path-Width under Graph Operations and Graph Transformations. CoRR (2024)
Frank Gurski, Jörg Rothe, Robin Weishaupt
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. Theory Comput. Syst. 68 (1) (2024)
Frank Gurski, Carolin Rehs, Jochen Rethmann
Characterizations and Directed Path-Width of Sequence Digraphs. Theory Comput. Syst. 67 (2) (2023)
Frank Gurski, Dominique Komander, Carolin Rehs
Correction to: Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. 96 (2) (2022)
Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
Computing directed Steiner path covers. J. Comb. Optim. 43 (2) (2022)
Frank Gurski, Dominique Komander, Marvin Lindemann
Efficient computation of oriented vertex and arc colorings of special digraphs. CoRR (2022)
Steffen Goebbels, Frank Gurski, Dominique Komander
The knapsack problem with special neighbor constraints. Math. Methods Oper. Res. 95 (1) (2022)
Frank Gurski, Dominique Komander, Marvin Lindemann
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. WALCOM (2021)
Frank Gurski, Dominique Komander, Carolin Rehs
On characterizations for subclasses of directed co-graphs. J. Comb. Optim. 41 (1) (2021)
Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht
Directed Width Parameters on Semicomplete Digraphs. COCOA (2021)
Frank Gurski, Dominique Komander, Marvin Lindemann
Efficient computation of the oriented chromatic number of recursively defined digraphs. Theor. Comput. Sci. 890 (2021)
Frank Gurski, Dominique Komander, Marvin Lindemann
Oriented Vertex and Arc Coloring of Edge Series-Parallel Digraphs. OR (2021)
Frank Gurski, Dominique Komander, Carolin Rehs
How to compute digraph width measures on directed co-graphs. Theor. Comput. Sci. 855 (2021)
Steffen Goebbels, Frank Gurski, Dominique Komander
The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs. OR (2021)
Frank Gurski, Dominique Komander, Carolin Rehs
Acyclic Coloring Parameterized by Directed Clique-Width. CALDAM (2021)
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). SOFSEM (2020)
Frank Gurski, Dominique Komander, Carolin Rehs
Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. 92 (2) (2020)
Frank Gurski, Dominique Komander, Marvin Lindemann
Oriented Coloring of msp-Digraphs and Oriented Co-graphs (Extended Abstract). COCOA (2020)
Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
Computing Directed Steiner Path Covers. CoRR (2020)
Frank Gurski, Dominique Komander, Carolin Rehs
Solutions for Subset Sum Problems with Special Digraph Constraints. CoRR (2020)
Frank Gurski, Dominique Komander, Marvin Lindemann
Efficient computation of the oriented chromatic number of recursively defined digraphs. CoRR (2020)
Frank Gurski, Dominique Komander, Carolin Rehs
Acyclic coloring of special digraphs. CoRR (2020)
Frank Gurski, Carolin Rehs
Counting and enumerating independent sets with applications to combinatorial optimization problems. Math. Methods Oper. Res. 91 (3) (2020)
Frank Gurski, Carolin Rehs, Jochen Rethmann
Knapsack problems: A parameterized point of view. Theor. Comput. Sci. 775 (2019)
Frank Gurski, Carolin Rehs, Jochen Rethmann, Egon Wanke
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. OR Spectr. 41 (2) (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Characterizations for Special Directed Co-graphs. COCOA (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Subset Sum Problems with Special Digraph Constraints. OR (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). FCT (2019)
Frank Gurski, Carolin Rehs
Comparing Linear Width Parameters for Directed Graphs. Theory Comput. Syst. 63 (6) (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
On Characterizations for Subclasses of Directed Co-Graphs. CoRR (2019)
Frank Gurski, Carolin Rehs
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. SOFSEM (2019)
Frank Gurski, Carolin Rehs
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. Math. Methods Oper. Res. 89 (3) (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Oriented Coloring on Recursively Defined Digraphs. Algorithms 12 (4) (2019)
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke
Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes. OR (2019)
Frank Gurski, Carolin Rehs, Jochen Rethmann
On the hardness of palletizing bins using FIFO queues. Theor. Comput. Sci. 795 (2019)
Frank Gurski, Dominique Komander, Carolin Rehs
Oriented coloring on recursively defined digraphs. CoRR (2019)
Frank Gurski, Carolin Rehs
Comparing Linear Width Parameters for Directed Graphs. CoRR (2018)
Frank Gurski, Carolin Rehs, Jochen Rethmann
Characterizations and Directed Path-Width of Sequence Digraphs. CoRR (2018)
Frank Gurski, Carolin Rehs, Jochen Rethmann
Directed Path-Width of Sequence Digraphs. COCOA (2018)
Frank Gurski, Carolin Rehs
Computing directed path-width and directed tree-width of recursively defined digraphs. CoRR (2018)
Frank Gurski, Carolin Rehs
The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width. OR (2018)
Frank Gurski, Carolin Rehs
Directed Path-Width and Directed Tree-Width of Directed Co-graphs. COCOON (2018)
Frank Gurski, Carolin Rehs
Counting and Enumerating Independent Sets with Applications to Knapsack Problems. CoRR (2017)
Frank Gurski
The Behavior of Clique-Width under Graph Operations and Graph Transformations. Theory Comput. Syst. 60 (2) (2017)
Steffen Goebbels, Frank Gurski, Jochen Rethmann, Eda Yilmaz
Change-making problems revisited: a parameterized point of view. J. Comb. Optim. 34 (4) (2017)
Frank Gurski, Patrick Gwydion Poullie
Interval Routing Schemes for Circular-Arc Graphs. Int. J. Found. Comput. Sci. 28 (1) (2017)
Carolin Rehs, Frank Gurski
A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time. OR (2017)
Frank Gurski, Jochen Rethmann, Egon Wanke
On-Line Algorithms for Controlling Palletizers. OR (2016)
Carolin Albrecht, Frank Gurski, Jochen Rethmann, Eda Yilmaz
Knapsack Problems: A Parameterized Point of View. CoRR (2016)
Frank Gurski, Stefan Neidig, Eda Yilmaz
Neighbourhood-width of trees. Discret. Math. 339 (1) (2016)
Frank Gurski, Egon Wanke, Eda Yilmaz
Directed NLC-width. Theor. Comput. Sci. 616 (2016)
Frank Gurski, Jochen Rethmann
Distributed Solving of Mixed-Integer Programs with GLPK and Thrift. OR (2016)
Frank Gurski, Jochen Rethmann, Egon Wanke
On the complexity of the FIFO stack-up problem. Math. Methods Oper. Res. 83 (1) (2016)
Frank Gurski, Jochen Rethmann, Egon Wanke
An Experimental Study of Algorithms for Controlling Palletizers. OR (2015)
Frank Gurski
Linear Programming Formulations for Computing Graph Layout Parameters. Comput. J. 58 (11) (2015)
Frank Gurski, Jochen Rethmann, Egon Wanke
Directed Pathwidth and Palletizers. COCOA (2015)
Frank Gurski, Jochen Rethmann, Eda Yilmaz
Computing Partitions with Applications to Capital Budgeting Problems. OR (2015)
Frank Gurski, Jochen Rethmann, Egon Wanke
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers. CoRR (2015)
Frank Gurski, Jochen Rethmann, Egon Wanke
A Practical Approach for the FIFO Stack-Up Problem. MCO (2) (2015)
Frank Gurski, Magnus Roos
Binary linear programming solutions and non-approximability for control problems in voting systems. Discret. Appl. Math. 162 (2014)
Frank Gurski, Jochen Rethmann, Egon Wanke
Algorithms for Controlling Palletizers. OR (2014)
Frank Gurski, Jochen Rethmann, Eda Yilmaz
Capital Budgeting Problems: A Parameterized Point of View. OR (2014)
Frank Gurski, Jochen Rethmann, Egon Wanke
Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues. OR (2013)
Frank Gurski, Jochen Rethmann, Egon Wanke
Complexity of the FIFO Stack-Up Problem. CoRR (2013)
Frank Gurski, Patrick Gwydion Poullie
Interval Routing Schemes for Circular-Arc Graphs CoRR (2012)
Frank Gurski, Egon Wanke
The NLC-width and clique-width for powers of graphs of bounded tree-width. Discret. Appl. Math. 157 (4) (2009)
Frank Gurski, Egon Wanke
On Module-Composed Graphs. WG (2009)
Frank Gurski
A comparison of two approaches for polynomial time algorithms computing basic graph parameters CoRR (2008)
Frank Gurski
Polynomial algorithms for protein similarity search for restricted mRNA structures. Inf. Process. Lett. 105 (5) (2008)
Frank Gurski
Graph parameters measuring neighbourhoods in graphs - Bounds and applications. Discret. Appl. Math. 156 (10) (2008)
Frank Gurski, Egon Wanke
The Clique-Width of Tree-Power and Leaf-Power Graphs. WG (2007)
Frank Gurski
Characterizations for restricted graphs of NLC-width 2. Theor. Comput. Sci. 372 (1) (2007)
Frank Gurski
Polynomial algorithms for protein similarity search for restricted mRNA structures CoRR (2007)
Frank Gurski
Graph Operations on Clique-Width Bounded Graphs CoRR (2007)
Frank Gurski
A note on module-composed graphs CoRR (2007)
Frank Gurski, Egon Wanke
A local characterization of bounded clique-width for line graphs. Discret. Math. 307 (6) (2007)
Frank Gurski, Egon Wanke
Line graphs of bounded clique-width. Discret. Math. 307 (22) (2007)
Frank Gurski, Egon Wanke
Vertex disjoint paths on clique-width bounded graphs. Theor. Comput. Sci. 359 (1-3) (2006)
Frank Gurski
Linear layouts measuring neighbourhoods in graphs. Discret. Math. 306 (15) (2006)
Frank Gurski
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. Discret. Math. 306 (2) (2006)
Frank Gurski, Egon Wanke
Minimizing NLC-Width is NP-Complete. WG (2005)
Frank Gurski, Egon Wanke
On the relationship between NLC-width and linear NLC-width. Theor. Comput. Sci. 347 (1-2) (2005)
Frank Gurski, Egon Wanke
Vertex Disjoint Paths on Clique-Width Bounded Graphs. LATIN (2004)
Wolfgang Espelage, Frank Gurski, Egon Wanke
Deciding Clique-Width for Graphs of Bounded Tree-Width. J. Graph Algorithms Appl. 7 (2) (2003)
Wolfgang Espelage, Frank Gurski, Egon Wanke
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. WG (2001)
Wolfgang Espelage, Frank Gurski, Egon Wanke
Deciding Clique-Width for Graphs of Bounded Tree-Width. WADS (2001)
Frank Gurski, Egon Wanke
. WG (2000)

Frank Gurski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frank Gurski