Publications
Book
Exakte Algorithmen für schwere Graphenprobleme.
F. Gurski, I. Rothe, J. Rothe, and E. Wanke.
eXamen.press, Springer-Verlag, Berlin, Heidelberg, xii+331 pages, 2010.
Refereed Journal Publications
Binary Linear Programming Solutions and Non-Approximability for Control Problems in Voting Systems.
F. Gurski and M. Roos.
Discrete Applied Mathematics, vol. 162, pp. 391-398, January 2014.
The NLC-Width and Clique-Width for Powers of Graphs of Bounded Tree-Width.
F. Gurski and E. Wanke.
Discrete Applied Mathematics, vol. 157, no. 4, pp. 583-595, 2009.
Polynomial Algorithms for Protein Similarity Search for Restricted mRNA Structures.
F. Gurski.
Information Processing Letters, vol. 105, no. 5, pp. 170-176, 2008.
Graph Parameters Measuring Neighbourhoods in Graphs - Bounds and Applications.
F. Gurski.
Discrete Applied Mathematics, vol. 156, no. 10, pp. 1865-1874, 2008.
A Local Characterization of Bounded Clique-Width for Line Graphs.
F. Gurski and E. Wanke.
Discrete Mathematics, vol. 307, no. 6, pp. 756-759, 2007.
Characterizations for Restricted Graphs of NLC-Width 2.
F. Gurski.
Theoretical Computer Science, vol. 372, no. 1, pp. 108-114, 2007.
Line Graphs of Bounded Clique-Width.
F. Gurski and E. Wanke.
Discrete Mathematics, vol. 307, no. 22, pp. 2734-2754, 2007.
Vertex Disjoint Paths on Clique-Width Bounded Graphs.
F. Gurski and E. Wanke.
Theoretical Computer Science, vol. 359, no. 1-3, pp. 188-199, 2006.
Linear Layouts Measuring Neighbourhoods in Graphs.
F. Gurski.
Discrete Mathematics, vol. 306, no. 15, pp. 1637-1650, 2006.
Characterizations for co-Graphs Defined by Restricted NLC-Width or Clique-Width Operations.
F. Gurski.
Discrete Mathematics, vol. 306, no. 2, pp. 271-277, 2006.
On the Relationship Between NLC-Width and Linear NLC-Width.
F. Gurski and E. Wanke.
Theoretical Computer Science, vol. 347, no. 1-2, pp. 76-85, 2005.
Deciding Clique-Width for Graphs of Bounded Tree-Width.
W. Espelage, F. Gurski, and E. Wanke.
Journal of Graph Algorithms and Applications, vol. 7, no. 2, pp. 141-180, 2003.
Refereed Publications in Conference Proceedings
On Module-Composed Graphs.
F. Gurski and E. Wanke.
Proceedings of the 35th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), Montpellier, France. Springer-Verlag Lecture Notes in Computer Science 5911, pages 166-177, June 2009.
The Clique-Width of Tree Powers and Leaf Powers (Extended Abstract).
F. Gurski and E. Wanke.
Proceedings of the 33th Workshop on Graph-Theoretic Concepts in Computer Science
(WG 2007), Dornburg, Germany. Springer-Verlag Lecture Notes in Computer Science 4769, pages 76-85, 2007.
Minimizing NLC-Width is NP-Complete (Extended Abstract).
F. Gurski and E. Wanke.
Proceedings of the 31th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Metz, France. Springer-Verlag Lecture Notes in Computer Science 3787, pages 69-80, 2005.
Vertex Disjoint Paths on Clique-Width Bounded Graphs (Extended Abstract).
F. Gurski and E. Wanke.
Proceedings of the 6th Latin American Theortical Informatics (LATIN 2004), Buenos Aires, Argentina. Springer-Verlag Lecture Notes in Computer Science 2976, pages 119-128, 2004.
Deciding Clique-Width for Graphs of Bounded Tree-Width (Extended Abstract).
W. Espelage, F. Gurski, and E. Wanke.
Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), Providence, RI, USA. Springer-Verlag Lecture Notes in Computer Science 2125, pages 87-98, 2001.
How to Solve NP-Hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.
W. Espelage, F. Gurski, and E. Wanke.
Proceedings of the 27th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), Boltenhagen, Germany. Springer-Verlag Lecture Notes in Computer Science 2204, pages 117-128, 2001.
The Tree-Width of Clique-Width Bounded Graphs Without K_{n,n}.
F. Gurski and E. Wanke.
Proceedings of the 26th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), Konstanz, Germany. Springer-Verlag Lecture Notes in Computer Science 1928, pages 196-205, 2000.
Habilitationsschrift
The Expressive Power and Algorithmic Use of Graph Parameters.
F. Gurski.
Habilitationsschrift. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 149 pages, October 2007.
PhD Thesis
Effiziente Algorithmen für baumstrukturierte Graphklassen.
F. Gurski.
PhD Thesis. Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 142 pages, July 2003.
Diploma Thesis
Algorithmische Charakterisierungen spezieller Graphklassen.
F. Gurski.
Diploma Thesis. Mathematisches Institut, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany, 94 pages, September 1998.