Frank Gurski

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