Carolin Rehs

Theor. Comput. Sci., August, 2023

Characterizations and Directed Path-Width of Sequence Digraphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., April, 2023

Oriented Spanners.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Comparing and Computing Parameters for Directed Graphs.

[BibT_eX]

[DOI]

PhD thesis, 2022

Correction to: Solutions for subset sum problems with special digraph constraints.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2022

Computing directed Steiner path covers.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

2021

How to compute digraph width measures on directed co-graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On characterizations for subclasses of directed co-graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Directed Width Parameters on Semicomplete Digraphs.

[BibT_eX]

[DOI]

Sebastian Wiederrecht

Proceedings of the Combinatorial Optimization and Applications, 2021

Acyclic Coloring Parameterized by Directed Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Counting and enumerating independent sets with applications to combinatorial optimization problems.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2020

Solutions for subset sum problems with special digraph constraints.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2020

Acyclic coloring of special digraphs.

[BibT_eX]

[DOI]

CoRR, 2020

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

A Timecop's Work Is Harder Than You Think.

[BibT_eX]

[DOI]

Nils Morawietz

Mathias Weller

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

On the hardness of palletizing bins using FIFO queues.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Knapsack problems: A parameterized point of view.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms.

[BibT_eX]

[DOI]

OR Spectr., 2019

Comparing Linear Width Parameters for Directed Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2019

Oriented Coloring on Recursively Defined Digraphs.

[BibT_eX]

[DOI]

Algorithms, 2019

Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Subset Sum Problems with Special Digraph Constraints.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2019, 2019

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2019, 2019

Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Characterizations for Special Directed Co-graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Computing directed path-width and directed tree-width of recursively defined digraphs.

[BibT_eX]

[DOI]

CoRR, 2018

The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2018, 2018

Directed Path-Width and Directed Tree-Width of Directed Co-graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Directed Path-Width of Sequence Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Counting and Enumerating Independent Sets with Applications to Knapsack Problems.

[BibT_eX]

[DOI]

CoRR, 2017

A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time.

[BibT_eX]

[DOI]