Follow
Frank Gurski
Title
Cited by
Cited by
Year
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
W Espelage, F Gurski, E Wanke
Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001
1632001
The Tree-Width of Clique-Width Bounded Graphs without Kn,n
F Gurski, E Wanke
International Workshop on Graph-Theoretic Concepts in Computer Science, 196-205, 2000
1102000
On the relationship between NLC-width and linear NLC-width
F Gurski, E Wanke
Theoretical Computer Science 347 (1-2), 76-89, 2005
552005
Deciding clique-width for graphs of bounded tree-width
W Espelage, F Gurski, E Wanke
J. Graph Algorithms Appl. 7 (2), 141-180, 2003
532003
Line graphs of bounded clique-width
F Gurski, E Wanke
Discrete Mathematics 307 (22), 2734-2754, 2007
452007
Vertex disjoint paths on clique-width bounded graphs
F Gurski, E Wanke
Theoretical Computer Science 359 (1-3), 188-199, 2006
372006
The behavior of clique-width under graph operations and graph transformations
F Gurski
Theory of Computing Systems 60, 346-376, 2017
312017
Directed NLC-width
F Gurski, E Wanke, E Yilmaz
Theoretical Computer Science 616, 1-17, 2016
292016
Knapsack problems: A parameterized point of view
F Gurski, C Rehs, J Rethmann
Theoretical Computer Science 775, 93-108, 2019
26*2019
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
F Gurski
Discrete Mathematics 306 (2), 271-277, 2006
262006
Linear layouts measuring neighbourhoods in graphs
F Gurski
Discrete Mathematics 306 (15), 1637-1650, 2006
242006
Minimizing NLC-width is NP-complete
F Gurski, E Wanke
Graph-Theoretic Concepts in Computer Science: 31st International Workshop …, 2005
232005
Exakte algorithmen für schwere graphenprobleme
F Gurski, I Rothe, J Rothe, E Wanke
Springer-Verlag, 2010
212010
Directed path-width and directed tree-width of directed co-graphs
F Gurski, C Rehs
Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 2018
182018
Dynamic programming algorithms on directed cographs
F Gurski
Statistics, Optimization & Information Computing 5 (1), 35-44, 2017
182017
The NLC-width and clique-width for powers of graphs of bounded tree-width
F Gurski, E Wanke
Discrete Applied Mathematics 157 (4), 583-595, 2009
182009
Graph operations on clique-width bounded graphs. CoRR, abs
F Gurski
arXiv preprint cs/0701185, 2007
182007
A comparison of two approaches for polynomial time algorithms computing basic graph parameters
F Gurski
arXiv preprint arXiv:0806.4073, 2008
172008
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
F Gurski, C Rehs
Mathematical Methods of Operations Research 89, 411-432, 2019
142019
On the Complexity of the FIFO stack-up problem
F Gurski, J Rethmann, E Wanke
Mathematical Methods of Operations Research 83 (1), 33-52, 2016
142016
The system can't perform the operation now. Try again later.
Articles 1–20