default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Gurski
Person information
- affiliation: Heinrich-Heine-Universität Düsseldorf, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b2]Frank Gurski, Irene Rothe, Jörg Rothe, Egon Wanke:
Exakte Algorithmen für schwere Graphenprobleme. eXamen.press, Springer 2010, ISBN 978-3-642-04499-1, pp. I-XII, 1-331- 2003
- [b1]Frank Gurski:
Effiziente Algorithmen für baumstrukturierte Graphklassen. University of Düsseldorf, Germany, 2003, pp. 1-137
Journal Articles
- 2024
- [j35]Frank Gurski, Jörg Rothe, Robin Weishaupt:
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. Theory Comput. Syst. 68(1): 75-102 (2024) - 2023
- [j34]Frank Gurski
, Carolin Rehs, Jochen Rethmann:
Characterizations and Directed Path-Width of Sequence Digraphs. Theory Comput. Syst. 67(2): 310-347 (2023) - 2022
- [j33]Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing directed Steiner path covers. J. Comb. Optim. 43(2): 402-431 (2022) - [j32]Steffen Goebbels, Frank Gurski, Dominique Komander:
The knapsack problem with special neighbor constraints. Math. Methods Oper. Res. 95(1): 1-34 (2022) - [j31]Frank Gurski, Dominique Komander, Carolin Rehs:
Correction to: Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. 96(2): 313 (2022) - 2021
- [j30]Frank Gurski, Dominique Komander, Carolin Rehs:
On characterizations for subclasses of directed co-graphs. J. Comb. Optim. 41(1): 234-266 (2021) - [j29]Frank Gurski, Dominique Komander, Carolin Rehs:
How to compute digraph width measures on directed co-graphs. Theor. Comput. Sci. 855: 161-185 (2021) - [j28]Frank Gurski, Dominique Komander, Marvin Lindemann:
Efficient computation of the oriented chromatic number of recursively defined digraphs. Theor. Comput. Sci. 890: 16-35 (2021) - 2020
- [j27]Frank Gurski, Carolin Rehs:
Counting and enumerating independent sets with applications to combinatorial optimization problems. Math. Methods Oper. Res. 91(3): 439-463 (2020) - [j26]Frank Gurski, Dominique Komander, Carolin Rehs:
Solutions for subset sum problems with special digraph constraints. Math. Methods Oper. Res. 92(2): 401-433 (2020) - 2019
- [j25]Frank Gurski, Dominique Komander, Carolin Rehs:
Oriented Coloring on Recursively Defined Digraphs. Algorithms 12(4): 87 (2019) - [j24]Frank Gurski, Carolin Rehs:
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. Math. Methods Oper. Res. 89(3): 411-432 (2019) - [j23]Frank Gurski, Carolin Rehs:
Comparing Linear Width Parameters for Directed Graphs. Theory Comput. Syst. 63(6): 1358-1387 (2019) - [j22]Frank Gurski, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. OR Spectr. 41(2): 581-611 (2019) - [j21]Frank Gurski, Carolin Rehs, Jochen Rethmann:
Knapsack problems: A parameterized point of view. Theor. Comput. Sci. 775: 93-108 (2019) - [j20]Frank Gurski, Carolin Rehs, Jochen Rethmann:
On the hardness of palletizing bins using FIFO queues. Theor. Comput. Sci. 795: 100-107 (2019) - 2017
- [j19]Frank Gurski, Patrick Gwydion Poullie:
Interval Routing Schemes for Circular-Arc Graphs. Int. J. Found. Comput. Sci. 28(1): 39-60 (2017) - [j18]Steffen Goebbels, Frank Gurski, Jochen Rethmann, Eda Yilmaz:
Change-making problems revisited: a parameterized point of view. J. Comb. Optim. 34(4): 1218-1236 (2017) - [j17]Frank Gurski:
The Behavior of Clique-Width under Graph Operations and Graph Transformations. Theory Comput. Syst. 60(2): 346-376 (2017) - 2016
- [j16]Frank Gurski, Stefan Neidig, Eda Yilmaz:
Neighbourhood-width of trees. Discret. Math. 339(1): 222-226 (2016) - [j15]Frank Gurski, Jochen Rethmann, Egon Wanke:
On the complexity of the FIFO stack-up problem. Math. Methods Oper. Res. 83(1): 33-52 (2016) - [j14]Frank Gurski, Egon Wanke, Eda Yilmaz:
Directed NLC-width. Theor. Comput. Sci. 616: 1-17 (2016) - 2015
- [j13]Frank Gurski:
Linear Programming Formulations for Computing Graph Layout Parameters. Comput. J. 58(11): 2921-2927 (2015) - 2014
- [j12]Frank Gurski, Magnus Roos:
Binary linear programming solutions and non-approximability for control problems in voting systems. Discret. Appl. Math. 162: 391-398 (2014) - 2009
- [j11]Frank Gurski, Egon Wanke:
The NLC-width and clique-width for powers of graphs of bounded tree-width. Discret. Appl. Math. 157(4): 583-595 (2009) - 2008
- [j10]Frank Gurski:
Graph parameters measuring neighbourhoods in graphs - Bounds and applications. Discret. Appl. Math. 156(10): 1865-1874 (2008) - [j9]Frank Gurski:
Polynomial algorithms for protein similarity search for restricted mRNA structures. Inf. Process. Lett. 105(5): 170-176 (2008) - 2007
- [j8]Frank Gurski, Egon Wanke:
A local characterization of bounded clique-width for line graphs. Discret. Math. 307(6): 756-759 (2007) - [j7]Frank Gurski, Egon Wanke:
Line graphs of bounded clique-width. Discret. Math. 307(22): 2734-2754 (2007) - [j6]Frank Gurski:
Characterizations for restricted graphs of NLC-width 2. Theor. Comput. Sci. 372(1): 108-114 (2007) - 2006
- [j5]Frank Gurski:
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. Discret. Math. 306(2): 271-277 (2006) - [j4]Frank Gurski:
Linear layouts measuring neighbourhoods in graphs. Discret. Math. 306(15): 1637-1650 (2006) - [j3]Frank Gurski, Egon Wanke:
Vertex disjoint paths on clique-width bounded graphs. Theor. Comput. Sci. 359(1-3): 188-199 (2006) - 2005
- [j2]Frank Gurski, Egon Wanke:
On the relationship between NLC-width and linear NLC-width. Theor. Comput. Sci. 347(1-2): 76-89 (2005) - 2003
- [j1]Wolfgang Espelage, Frank Gurski, Egon Wanke:
Deciding Clique-Width for Graphs of Bounded Tree-Width. J. Graph Algorithms Appl. 7(2): 141-180 (2003)
Conference and Workshop Papers
- 2021
- [c32]Frank Gurski, Dominique Komander, Carolin Rehs:
Acyclic Coloring Parameterized by Directed Clique-Width. CALDAM 2021: 95-108 - [c31]Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht:
Directed Width Parameters on Semicomplete Digraphs. COCOA 2021: 615-628 - [c30]Steffen Goebbels, Frank Gurski, Dominique Komander:
The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs. OR 2021: 95-100 - [c29]Frank Gurski, Dominique Komander, Marvin Lindemann:
Oriented Vertex and Arc Coloring of Edge Series-Parallel Digraphs. OR 2021: 101-106 - [c28]Frank Gurski, Dominique Komander, Marvin Lindemann:
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. WALCOM 2021: 182-194 - 2020
- [c27]Frank Gurski, Dominique Komander, Marvin Lindemann:
Oriented Coloring of msp-Digraphs and Oriented Co-graphs (Extended Abstract). COCOA 2020: 743-758 - [c26]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: 556-565 - 2019
- [c25]Frank Gurski, Dominique Komander, Carolin Rehs:
Characterizations for Special Directed Co-graphs. COCOA 2019: 252-264 - [c24]Frank Gurski, Dominique Komander, Carolin Rehs:
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). FCT 2019: 292-305 - [c23]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: 331-338 - [c22]Frank Gurski, Dominique Komander, Carolin Rehs:
Subset Sum Problems with Special Digraph Constraints. OR 2019: 339-346 - [c21]Frank Gurski, Carolin Rehs:
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. SOFSEM 2019: 234-246 - 2018
- [c20]Frank Gurski, Carolin Rehs, Jochen Rethmann:
Directed Path-Width of Sequence Digraphs. COCOA 2018: 79-93 - [c19]Frank Gurski, Carolin Rehs:
Directed Path-Width and Directed Tree-Width of Directed Co-graphs. COCOON 2018: 255-267 - [c18]Frank Gurski, Carolin Rehs:
The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width. OR 2018: 259-265 - 2017
- [c17]Carolin Rehs, Frank Gurski:
A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time. OR 2017: 295-301 - 2016
- [c16]Frank Gurski, Jochen Rethmann, Egon Wanke:
On-Line Algorithms for Controlling Palletizers. OR 2016: 119-125 - [c15]Frank Gurski, Jochen Rethmann:
Distributed Solving of Mixed-Integer Programs with GLPK and Thrift. OR 2016: 599-605 - 2015
- [c14]Frank Gurski, Jochen Rethmann, Egon Wanke:
Directed Pathwidth and Palletizers. COCOA 2015: 31-44 - [c13]Frank Gurski, Jochen Rethmann, Egon Wanke:
A Practical Approach for the FIFO Stack-Up Problem. MCO (2) 2015: 141-152 - [c12]Frank Gurski, Jochen Rethmann, Egon Wanke:
An Experimental Study of Algorithms for Controlling Palletizers. OR 2015: 27-34 - [c11]Frank Gurski, Jochen Rethmann, Eda Yilmaz:
Computing Partitions with Applications to Capital Budgeting Problems. OR 2015: 79-85 - 2014
- [c10]Frank Gurski, Jochen Rethmann, Egon Wanke:
Algorithms for Controlling Palletizers. OR 2014: 197-203 - [c9]Frank Gurski, Jochen Rethmann, Eda Yilmaz:
Capital Budgeting Problems: A Parameterized Point of View. OR 2014: 205-211 - 2013
- [c8]Frank Gurski, Jochen Rethmann, Egon Wanke:
Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues. OR 2013: 185-191 - 2009
- [c7]Frank Gurski, Egon Wanke:
On Module-Composed Graphs. WG 2009: 166-177 - 2007
- [c6]Frank Gurski, Egon Wanke:
The Clique-Width of Tree-Power and Leaf-Power Graphs. WG 2007: 76-85 - 2005
- [c5]Frank Gurski, Egon Wanke:
Minimizing NLC-Width is NP-Complete. WG 2005: 69-80 - 2004
- [c4]Frank Gurski, Egon Wanke:
Vertex Disjoint Paths on Clique-Width Bounded Graphs. LATIN 2004: 119-128 - 2001
- [c3]Wolfgang Espelage, Frank Gurski, Egon Wanke:
Deciding Clique-Width for Graphs of Bounded Tree-Width. WADS 2001: 87-98 - [c2]Wolfgang Espelage, Frank Gurski, Egon Wanke:
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. WG 2001: 117-128 - 2000
- [c1]Frank Gurski, Egon Wanke:
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. WG 2000: 196-205
Informal and Other Publications
- 2024
- [i20]Frank Gurski, Robin Weishaupt:
The Behavior of Tree-Width and Path-Width under Graph Operations and Graph Transformations. CoRR abs/2406.08985 (2024) - 2022
- [i19]Frank Gurski, Dominique Komander, Marvin Lindemann:
Efficient computation of oriented vertex and arc colorings of special digraphs. CoRR abs/2202.10195 (2022) - 2020
- [i18]Frank Gurski, Dominique Komander, Carolin Rehs:
Solutions for Subset Sum Problems with Special Digraph Constraints. CoRR abs/2004.04712 (2020) - [i17]Frank Gurski, Dominique Komander, Carolin Rehs:
Acyclic coloring of special digraphs. CoRR abs/2006.13911 (2020) - [i16]Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing Directed Steiner Path Covers. CoRR abs/2012.12232 (2020) - [i15]Frank Gurski, Dominique Komander, Marvin Lindemann:
Efficient computation of the oriented chromatic number of recursively defined digraphs. CoRR abs/2012.13764 (2020) - 2019
- [i14]Frank Gurski, Dominique Komander, Carolin Rehs:
Oriented coloring on recursively defined digraphs. CoRR abs/1904.01570 (2019) - [i13]Frank Gurski, Dominique Komander, Carolin Rehs:
On Characterizations for Subclasses of Directed Co-Graphs. CoRR abs/1907.00801 (2019) - 2018
- [i12]Frank Gurski, Carolin Rehs:
Computing directed path-width and directed tree-width of recursively defined digraphs. CoRR abs/1806.04457 (2018) - [i11]Frank Gurski, Carolin Rehs, Jochen Rethmann:
Characterizations and Directed Path-Width of Sequence Digraphs. CoRR abs/1811.02259 (2018) - [i10]Frank Gurski, Carolin Rehs:
Comparing Linear Width Parameters for Directed Graphs. CoRR abs/1812.06653 (2018) - 2017
- [i9]Frank Gurski, Carolin Rehs:
Counting and Enumerating Independent Sets with Applications to Knapsack Problems. CoRR abs/1710.08953 (2017) - 2016
- [i8]Carolin Albrecht, Frank Gurski, Jochen Rethmann, Eda Yilmaz:
Knapsack Problems: A Parameterized Point of View. CoRR abs/1611.07724 (2016) - 2015
- [i7]Frank Gurski, Jochen Rethmann, Egon Wanke:
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers. CoRR abs/1509.07278 (2015) - 2013
- [i6]Frank Gurski, Jochen Rethmann, Egon Wanke:
Complexity of the FIFO Stack-Up Problem. CoRR abs/1307.1915 (2013) - 2012
- [i5]Frank Gurski, Patrick Gwydion Poullie:
Interval Routing Schemes for Circular-Arc Graphs. CoRR abs/1202.4160 (2012) - 2008
- [i4]Frank Gurski:
A comparison of two approaches for polynomial time algorithms computing basic graph parameters. CoRR abs/0806.4073 (2008) - 2007
- [i3]Frank Gurski:
Polynomial algorithms for protein similarity search for restricted mRNA structures. CoRR abs/0704.3496 (2007) - [i2]Frank Gurski:
A note on module-composed graphs. CoRR abs/0705.1521 (2007) - [i1]Frank Gurski:
Graph Operations on Clique-Width Bounded Graphs. CoRR abs/cs/0701185 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
