The following pages link to Carolin Rehs (Q784783):
Displayed 26 items.
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Directed path-width and directed tree-width of directed co-graphs (Q1790979) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Exact solutions for the Steiner path cover problem on special graph classes (Q2050271) (← links)
- Subset sum problems with special digraph constraints (Q2050272) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- Characterizations for special directed co-graphs (Q2180153) (← links)
- Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs (Q2206233) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms (Q2284641) (← links)
- Computing digraph width measures on directed co-graphs (extended abstract) (Q2291425) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Directed path-width of sequence digraphs (Q2327105) (← links)
- On the hardness of palletizing bins using FIFO queues (Q2330097) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784) (← links)
- A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time (Q4685763) (← links)
- (Q5089244) (← links)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)
- Twin-distance-hereditary digraphs (Q6132965) (← links)
- Computing directed path-width and directed tree-width of recursively defined digraphs (Q6302908) (← links)