Zum Inhalt springenZur Suche springen

Publikationen

Journals, Contributions to Conferences, and Books

2021 

  • F. Gurski, D. Komander, and M. Lindemann, Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs. In Proceedings of the 15th International Conference and Workshop on Algorithms and Computation (WALCOM 2021), volume 12635 of Lecture Notes in Computer Science, pages 182-194. Springer-Verlag, 2021.
  • F. Gurski, D. Komander, and C. Rehs, Acyclic coloring parameterized by directed clique-width (Extended Abstract). In Proceedings of the 7th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2021), volume 12601 of Lecture Notes in Computer Science, pages 95-108. Springer-Verlag, 2021.
  • F. Gurski, D. Komander, and C. Rehs, How to compute Digraph Width Measures on Directed Co-Graphs. Theoretical Computer Science, 855, 161-185, 2021. Online Version
  • F. Gurski, D. Komander, and C. Rehs, On Characterizations for Subclasses of Directed Co-Graphs. Journal of Combinatorial Optimization, 41(1), 234-266, 2021. Online Version

2020

  • F. Gurski, D. Komander, and M. Lindemann, Oriented coloring of msp-digraphs and oriented co-graphs (Extended Abstract). In Proceedings of the 14th International Conference on Combinatorial Optimization and Applications (COCOA 2020), volume 12577 of Lecture Notes in Computer Science, pages 743-758. Springer-Verlag, 2020.
  • F. Gurski, D. Komander, and C. Rehs, Solutions for Subset Sum Problems with Special Digraph Constraints. Mathematical Methods of Operations Research, 92(2), 401-433, 2020. Online Version
  • F. Gurski and C. Rehs, Counting and Enumerating Independent Sets with Applications to Combinatorial Optimization Problems. Mathematical Methods of Operations Research, 91(3), 439-463, 2020. Online Version
  • F. Gurski, S. Hoffmann, D. Komander, C. Rehs, J. Rethmann, and E. Wanke, Computing Directed Steiner Path Covers for Directed Co-Graphs (Extended Abstract). In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), volume 12011 of Lecture Notes in Computer Science, pages 556-565. Springer-Verlag, 2020.
  • N. Morawietz, C. Rehs, and M. Weller. A Timecop’s Work is Harder Than You Think. In Proceedings of the 45th International Symposium on  Mathematical Foundations of Computer Science (MFCS 2020), volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 71:1--71:14, 2020.
  • F. Gurski, D. Komander, C. Rehs, J. Rethmann, and E. Wanke, Computing Directed Steiner Path Covers. Technical Report, ACM Computing Research Repository (CoRR), 21 pages, 2020. abs/2012.12232
  • F. Gurski, D. Komander, and M. Lindemann, Efficient computation of the oriented chromatic number of recursively defined digraphs. ACM Computing Research Repository (CoRR), 25 pages, 2020. abs/2012.13764
  • F. Gurski, D. Komander, and C. Rehs, Acyclic coloring of special digraphs. Technical Report, ACM Computing Research Repository (CoRR), 16 pages, 2020. abs/2006.13911
  • F. Gurski, D. Komander, and C. Rehs, Solutions for Subset Sum Problems with Special Digraph Constraints. Technical Report, ACM Computing Research Repository (CoRR), 22 pages, 2020. abs/2004.04712

2019

  • F. Gurski, D. Komander, and C. Rehs, Characterizations for special directed co-graphs (Extended Abstract). In Proceedings of the 13th International Conference on Combinatorial Optimization and Applications (COCOA 2019), volume 11949 of Lecture Notes in Computer Science, pages 252-264. Springer-Verlag, 2019.
  • F. Gurski, D. Komander, and C. Rehs, Subset Sum Problems with Special Digraph Constraints. In Proceedings of the International Conference on Operations Research (OR 2019), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Springer Verlag, pages 339-346, 2020.
  • F. Gurski, S. Hoffmann, D. Komander, C. Rehs, J. Rethmann, and E. Wanke, Exact Solutions for the Steiner Path Problem on Special Graph Classes. In Proceedings of the International Conference on Operations Research (OR 2019), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Springer Verlag, pages 331-338, 2020.
  • F. Gurski, C. Rehs, and J. Rethmann, On the hardness of palletizing bins using FIFO queues. Theoretical Computer Science, 795, 100-107, 2019. Online Version
  • F. Gurski, D. Komander, and C. Rehs, Computing Digraph Width Measures on Directed Co-Graphs (Extended Abstract). In Proceedings of the 22th International Symposium on Fundamentals of Computation Theory (FCT 2019), volume 11651 of Lecture Notes in Computer Science, pages 292-305. Springer-Verlag, 2019.
  • F. Gurski and C. Rehs, Comparing Linear Width Parameters for Directed Graphs. Theory of Computing Systems, 63(6), 1358-1387, 2019. Online Version
  • F. Gurski and C. Rehs, Solutions for the Knapsack Problem with Conflict and Forcing Graphs of bounded Clique-width. Mathematical Methods of Operations Research, 89(3), 411-432, 2019. Online Version
  • F. Gurski, D. Komander, and C. Rehs, Oriented coloring on recursively defined digraphs. Algorithms, 12(4), 87, 2019. Online Version
  • F. Gurski, C. Rehs, and J. Rethmann, Knapsack Problems: A Parameterized Point of View. Theoretical Computer Science, 775, 93-108, 2019. Online Version
  • F. Gurski, C. Rehs, J. Rethmann, and E. Wanke, Controlling Distribution Conveyors and Multi-Line Palletizers: Theoretical Foundations and Online Algorithms. OR Spectrum, 41(2), 581-611, 2019. Online Version
  • F. Gurski and C. Rehs, Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-like Digraphs. In Proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2019), volume 11376 of Lecture Notes in Computer Science, pages 234-246. Springer-Verlag, 2019.
  • F. Gurski, D. Komander, and C. Rehs, On Characterizations for Subclasses of Directed Co-Graphs. Technical Report, ACM Computing Research Repository (CoRR), 25 pages, 2019. abs/1907.00801
  • F. Gurski, D. Komander, and C. Rehs, Oriented coloring on recursively defined digraphs. Technical Report, ACM Computing Research Repository (CoRR), 14 pages, 2019. abs/1904.01570

2018

  • F. Gurski, C. Rehs, and J. Rethmann, Directed Path-width of Sequence Digraphs (Extended Abstract). In Proceedings of the 12th International Conference on Combinatorial Optimization and Applications (COCOA 2018), volume 11346 of Lecture Notes in Computer Science, pages 79-93.  Springer-Verlag, 2018.
  • F. Gurski and C. Rehs, Directed path-width and directed tree-width of directed co-graphs (Extended Abstract). In Proceedings of the 24th International Computing and Combinatorics Conference (COCOON 2018), volume 10976 of Lecture Notes in Computer Science, pages 255-267. Springer-Verlag, 2018.
  • F. Gurski and C. Rehs, The Knapsack Problem with Conflict Graphs and Forcing Graphs of bounded Clique-width. In Proceedings of the International Conference on Operations Research (OR 2018), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Springer Verlag, pages 259-265, 2019.
  • F. Gurski and C. Rehs, Comparing Linear Width Parameters for Directed Graphs. Technical Report, ACM Computing Research Repository (CoRR), 23 pages, 2018. abs/1812.06653
  • F. Gurski, C. Rehs, and J. Rethmann, Characterizations and Directed Path-Width of Sequence Digraphs. Technical Report, ACM Computing Research Repository (CoRR), 31 pages, 2018. abs/1811.02259
  • F. Gurski and C. Rehs, Computing directed path-width and directed tree-width of recursively defined digraphs. Technical Report, ACM Computing Research Repository (CoRR), 16 pages, 2018. abs/1806.04457

2017

  • F. Gurski and C. Rehs, A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time. In Proceedings of the International Conference on Operations Research (OR 2017), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Springer Verlag, pages 295-301, 2018.
  • St.J. Goebbels, F. Gurski, J. Rethmann, and E. Yilmaz, Change-Making Problems revisited: A Parameterized Point of View. Journal of Combinatorial Optimization, 34(4), 1218-1236, 2017. Online Version
  • F. Gurski and P.G. Poullie, Interval Routing Schemes for Circular-Arc Graphs. International Journal of Foundations of Computer Science, 28(1), 39-60, 2017.
  • F. Gurski, Dynamic Programming Algorithms on Directed Cographs. Statistics, Optimization and Information Computing, Vol 5, 35-44, 2017.
  • F. Gurski, The Behavior of Clique-Width under Graph Operations and Graph Transformations. Theory of Computing Systems, 60(2), 346-376, 2017. Online Version
  • F. Gurski, J. Rethmann, and E. Wanke, On-line Algorithms for Controlling Distribution Conveyors and Multi-line Palletizers (Abstract). International Conference on Operations Research (OR), 2017.
  • F. Gurski and C. Rehs, Counting and Enumerating Independent Sets with Applications to Knapsack Problems. Technical Report, ACM Computing Research Repository (CoRR), 26 pages, 2017. abs/1710.08953

2016

  • F. Gurski, J. Rethmann, and E. Wanke, On-line Algorithms for Controlling Palletizers. In Proceedings of the International Conference on Operations Research (OR 2016), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Springer Verlag, pages 119-125, 2018.
  • F. Gurski and J. Rethmann, Distributed solving of mixed-integer programs with GLPK and Thrift. In Proceedings of the International Conference on Operations Research (OR 2016), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Springer Verlag, pages 599-605, 2018.
  • F. Gurski, J. Rethmann, and E. Wanke, On the Complexity of the FIFO Stack-Up Problem. Mathematical Methods of Operations Research, 83(1), 33-52, 2016. Online Version
  • F. Gurski, E. Wanke, and E. Yilmaz, Directed NLC-width. Theoretical Computer Science, 616, 1-17, 2016. Science Direct
  • F. Gurski, S. Neidig, and E. Yilmaz, Neighbourhood-width of Trees. Discrete Mathematics, 339, 222-226, 2016. Science Direct
  • C. Albrecht, F. Gurski, J. Rethmann, and E. Yilmaz, Knapsack Problems: A Parameterized Point of View. Technical Report, ACM Computing Research Repository (CoRR), 27 pages, 2016. abs/1611.07724

2015

  • F. Gurski, J. Rethmann, and E. Wanke, Directed Pathwidth and Palletizers. In Proceedings of the 9th International Conference on Combinatorial Optimization and Applications (COCOA 2015), volume 9486 of Lecture Notes in Computer Science, pages 31-44. Springer-Verlag, 2015.
  • F. Gurski, J. Rethmann, and E. Wanke, An Experimental Study of Algorithms for Controlling Palletizers. In Proceedings of the International Conference on Operations Research (OR 2015), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), pages 27-34,Springer Verlag, 2017.
  • F. Gurski, J. Rethmann, and E. Yilmaz, Computing Partitions with Applications to Capital Budgeting Problems. In Proceedings of the International Conference on Operations Research (OR 2015), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), pages 79-85, Springer Verlag, 2017.
  • St.J. Goebbels, F. Gurski, J. Rethmann, and E. Yilmaz, Fixed-Parameter Tractability of Change-Making Problems (Abstract). International Conference on Operations Research (OR), 2015.
  • F. Gurski, Linear Programming Formulations for Computing Graph Layout Parameters. The Computer Journal, 58(11), 2921-2927, 2015.  Online Version
  • F. Gurski, J. Rethmann, and E. Wanke, A Practical Approach for the FIFO Stack-Up Problem. In Proceedings of the International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2015), volume 360 of Advances in Intelligent Systems and Computing, pages 141-152. Springer Verlag, 2015.
  • F. Gurski, J. Rethmann, and E. Wanke, Integer Programming Models and Parameterized Algorithms for Controlling Palletizers. Technical Report, ACM Computing Research Repository (CoRR), 27 pages, 2015. abs/1509.07278

2014

  • F. Gurski, J. Rethmann, and E. Yilmaz, Capital Budgeting Problems: A parameterized point of view. In Proceedings of the International Conference on Operations Research (OR 2014), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), pages 205-211, Springer Verlag, 2016.
  • F. Gurski, J. Rethmann, and E. Wanke, Algorithms for Controlling Palletizers. In Proceedings of the International Conference on Operations Research (OR 2014), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), pages 197-203, Springer Verlag, 2016.
  • F. Gurski, Efficient Binary Linear Programming Formulations for Boolean Functions. Statistics, Optimization and Information Computing, Vol 2, 274-279, 2014. Online Version
  • F. Gurski, J. Rethmann, and E. Wanke, Algorithms for the FIFO Stack-up Problem (Abstract). 20th Conference of the International Federation of Operational Research Societies (IFORS), 2014.
  • F. Gurski and M. Roos, Binary Linear Programming Solutions and Non-Approximability for Control Problems in Voting Systems. Discrete Applied Mathematics, 162, 391-398, 2014. Science Direct

2013

  • F. Gurski, J. Rethmann, and E. Wanke, Moving bins from conveyor belts onto pallets using FIFO queues. In Proceedings of the International Conference on Operations Research (OR 2013), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), pages 185-191, Springer Verlag, 2014.
  • F. Gurski, J. Rethmann, and E. Wanke, Complexity of the FIFO Stack-Up Problem. Technical Report, ACM Computing Research Repository (CoRR), 19 pages, 2013. abs/1307.1915

2012

  • F. Gurski and P.G. Poullie, Interval Routing Schemes for Circular-Arc Graphs. Technical Report, ACM Computing Research Repository (CoRR), 19 pages, 2012. abs/1202.4160

2010

  • F. Gurski, I. Rothe, J. Rothe and E. Wanke, Exakte Algorithmen für schwere Graphenprobleme. Springer Verlag, 2010. Springer

2009

  • F. Gurski and E. Wanke, On module-composed graphs (Extended Abstract). In Proceedings of the 35th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), volume 5911 of Lecture Notes in Computer Science, pages 166-177. Springer-Verlag, 2009.
  • F. Gurski and E. Wanke The NLC-width and clique-width for powers of graphs of bounded tree-width. Discrete Applied Mathematics, 157(4), 583-595, 2009. Science Direct

2008

  • F. Gurski, Graph parameters measuring neighbourhoods in graphs - Bounds and Applications. Discrete Applied Mathematics, 156(10), 1865-1874, 2008. Science Direct
  • F. Gurski, Polynomial algorithms for protein similarity search for restricted mRNA structures. Information Processing Letters, 105(5), 170-176, 2008. Science Direct

2007

  • F. Gurski and E. Wanke, The clique-width of tree powers and leaf powers (Extended Abstract). In Proceedings of the 33th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007), volume 4769 of Lecture Notes in Computer Science, pages 76-85. Springer-Verlag, 2007.
  • F. Gurski and E. Wanke, Line graphs of bounded clique-width. Discrete Mathematics, 307(22), 2734-2754, 2007. Science Direct
  • F. Gurski, Characterizations for restricted graphs of NLC-width 2. Theoretical Computer Science, 372(1), 108-114, 2007. Science Direct
  • F. Gurski and E. Wanke, A local characterization of bounded clique-width for line graphs. Discrete Mathematics, 307(6), 756-759, 2007. Science Direct
  • F. Gurski, Graph Operations on Clique-Width Bounded Graphs. Technical Report, ACM Computing Research Repository (CoRR), 10 pages, 2007. abs/cs/0701185

2006

  • F. Gurski and E. Wanke, Vertex Disjoint Paths on Clique-width bounded Graphs. Theoretical Computer Science, 359(1-3), 188-199, 2006. Science Direct
  • F. Gurski, Linear layouts measuring neighbourhoods in graphs. Discrete Mathematics, 306(15), 1637-1650, 2006. Science Direct
  • F. Gurski, Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. Discrete Mathematics, 306(2), 271-277, 2006. Science Direct

2005

  • F. Gurski and E. Wanke, Minimizing NLC-width is NP-complete (Extended Abstract). In Proceedings of the 31th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), volume 3787 of Lecture Notes in Computer Science, pages 69-80. Springer-Verlag, 2005.
  • F. Gurski and E. Wanke, On the relationship between NLC-width and linear NLC-width. Theoretical Computer Science, 347(1-2), 76-89, 2005. Science Direct

2004

  • F. Gurski and E. Wanke, Vertex Disjoint Paths on Clique-width bounded Graphs (Extended Abstract). In Proceedings of the Latin American Theortical Informatics (LATIN 2004), volume 2976 of Lecture Notes in Computer Science, pages 119-128. Springer-Verlag, 2004.

2003

  • W. Espelage, F. Gurski and E. Wanke, Deciding clique-width for graphs of bounded tree-width. In Journal of Graph Algorithms and Applications - Special Issue of JGAA on the 7th International Workshop on Algorithms and Data Structures (WADS 2001), volume 7(2), pages 141-180, 2003.

2001

  • W. Espelage, F. Gurski and E. Wanke, Deciding clique-width for graphs of bounded tree-width (Extended Abstract). In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), volume 2125 of Lecture Notes in Computer Science, pages 87-98. Springer-Verlag, 2001.
  • W. Espelage, F. Gurski and E. Wanke, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In Proceedings of the 27th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), volume 2204 of Lecture Notes in Computer Science, pages 117-128. Springer-Verlag, 2001.

2000

  • F. Gurski and E. Wanke, The Tree-Width of Clique-Width Bounded Graphs Without Kn,n. In Proceedings of the 26th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), volume 1928 of Lecture Notes in Computer Science, pages 196-205. Springer-Verlag, 2000.

Monographs

  • F. Gurski, The expressive power and algorithmic use of graph parameters. Habilitation Thesis, Heinrich-Heine-Universität Düsseldorf, October 2007.
  • F. Gurski, Effiziente Algorithmen für baumstrukturierte Graphklassen. PhD Thesis, Heinrich-Heine-Universität Düsseldorf, July 2003. In German.
  • F. Gurski, Algorithmische Charakterisierungen Spezieller Graphklassen, Diploma Thesis, Mathematsiches Institut der Heinrich-Heine-Universität Düsseldorf, September 1998. In German.

Publications in on-line science databases

Verantwortlichkeit: