35 results on '"Jaffke, Lars"'
Search Results
2. b-Coloring Parameterized by Clique-Width
Catalog
Books, media, physical & digital resources
3. Diverse Pairs of Matchings
4. Typical Sequences Revisited — Computing Width Parameters of Graphs
5. Fine-grained parameterized complexity analysis of graph coloring problems
6. Well-partitioned chordal graphs
7. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
8. Structural Parameterizations of Clique Coloring
9. Mim-Width I. Induced path problems
10. A complexity dichotomy for critical values of the b-chromatic number of graphs
11. Mim-width III. Graph powers and generalized distance domination problems
12. Classes of intersection digraphs with good algorithmic properties.
13. Mim-Width II. The Feedback Vertex Set Problem
14. Definability equals recognizability for [formula omitted]-outerplanar graphs and [formula omitted]-chordal partial [formula omitted]-trees
15. On the maximum number of edges in planar graphs of bounded degree and matching number
16. FPT Algorithms for Diverse Collections of Hitting Sets.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.