The following pages link to Johan M. M. van Rooij (Q255263):
Displaying 27 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- (Q411861) (redirect page) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- A generic convolution algorithm for join operations on tree decompositions (Q2117110) (← links)
- Algorithms and complexity results for the capacitated vertex cover problem (Q2206252) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Exact Algorithms for Intervalizing Colored Graphs (Q2999332) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Partition into Triangles on Bounded Degree Graphs (Q3075543) (← links)
- Computing Role Assignments of Chordal Graphs (Q3183609) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number (Q3562993) (← links)
- Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ (Q3569091) (← links)
- A Bottom-Up Method and Fast Algorithms for max independent set (Q3569879) (← links)
- Faster Algorithms on Branch and Clique Decompositions (Q3586082) (← links)
- Inclusion/Exclusion Meets Measure and Conquer (Q3639274) (← links)
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution (Q3639275) (← links)
- On Partitioning a Graph into Two Connected Subgraphs (Q3652306) (← links)
- Cut and Count and representative sets on branch decompositions (Q4634412) (← links)
- (Q4910758) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (Q5494962) (← links)
