Fields- Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2017)
-
Title: Tree-width, clique-width and fly-automata
Speaker:
Link:
-
Title: Graph Width and Practical Existential Second Order Model Checking.
Speaker:
Link:
-
Title: Efficient FO-Model Checking on Preferential Attachement Graphs
Speaker:
Link:
-
Title: Combinatorial n-fold Integer Programming and Applications
Speaker:
Link:
-
Title: On Structural Paramerizations of the Edge Disjoint Paths Problem
Speaker:
Link:
-
Title: Kernelization algorithms for some link stream editing problems
Speaker:
Link:
-
Title: Digraph Classes and Homomorphism Problems
Speaker:
Link:
-
Title: Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity
Speaker:
Link:
-
Title: Graph classes defined via vertex orderings avoiding patterns
Speaker:
Link:
-
Title: On H -topological intersection graphs
Speaker:
Link:
-
Title: A new graph parameter to measure linearity
Speaker:
Link:
-
Title: AT-free BFS Orders
Speaker:
Link:
-
Title: Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
Speaker:
Link:
-
Title: Solving Colouring and Max Weight Stable Set on (Cap, Even Hole)-Free Graphs
Speaker:
Link:
-
Title: On Efficient Domination for Some Classes of H -Free Chordal Graphs
Speaker:
Link:
-
Title: Three graph classes: mock threshold, cute, and nice graphs
Speaker:
Link:
-
Title: Structure of critical graphs and complexity of coloring
Speaker:
Link:
-
Title: On the structure of graphs without odd or even holes
Speaker:
Link:
-
Title: Parameterized complexity of metatheorems of fair deletion problems
Speaker:
Link:
-
Title: Chi-boundedness of graph classes excluding wheel vertex-minors
Speaker:
Link: