No. |
Title |
Author |
Year |
---|

1 |
Perfect Forests in Graphs and Their Extensions |
Gutin, Gregory et al. |
2021 |

2 |
Component Order Connectivity in Directed Graphs |
Bang-Jensen, Jørgen et al. |
2020 |

3 |
Parameterized Pre-Coloring Extension and List Coloring Problems |
Gutin, Gregory et al. |
2020 |

4 |
k-Distinct In- and Out-Branchings in Digraphs |
Gutin, Gregory et al. |
2017 |

5 |
Parameterized Constraint Satisfaction Problems: a Survey |
Gutin, Gregory et al. |
2017 |

6 |
Path-Contractions, Edge Deletions and Connectivity Preservation |
Gutin, Gregory et al. |
2017 |

7 |
On the Workflow Satisfiability Problem with Class-independent Constraints |
Crampton, Jason et al. |
2015 |

8 |
Parameterized and Approximation Algorithms for the Load Coloring Problem |
Barbero, Florian et al. |
2015 |

9 |
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound |
Crowston, Robert et al. |
2012 |

10 |
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average |
Crowston, Robert et al. |
2011 |

11 |
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs |
Demaine, Erik et al. |
2007 |

12 |
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs |
Demaine, Erik et al. |
2007 |