The following pages link to Kitty Meeks (Q342708):
Displaying 46 items.
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- The complexity of free-flood-it on \(2\times n\) boards (Q388453) (← links)
- The complexity of flood-filling games on graphs (Q423894) (← links)
- Spanning trees and the complexity of flood-filling games (Q489766) (← links)
- The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
- The parameterised complexity of counting even and odd induced subgraphs (Q1714949) (← links)
- Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
- On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- Improved inference for areal unit count data using graph-based optimisation (Q2058788) (← links)
- Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes (Q2104268) (← links)
- The complexity of finding optimal subgraphs to represent spatial correlation (Q2149864) (← links)
- A new temporal interpretation of cluster editing (Q2169957) (← links)
- Reconstructing the degree sequence of a sparse graph from a partial deck (Q2171022) (← links)
- Stable marriage with groups of similar agents (Q2190408) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
- The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- Some hard families of parameterized counting problems (Q2832302) (← links)
- Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)
- Randomised enumeration of small witnesses using a decision oracle (Q4634405) (← links)
- (Q5009471) (← links)
- (Q5021292) (← links)
- (Q5092419) (← links)
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
- Approximately counting and sampling small witnesses using a colourful decision oracle (Q5146924) (← links)
- Extremal properties of flood-filling games (Q5226850) (← links)
- Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling (Q5232759) (← links)
- The interactive sum choice number of graphs (Q5915807) (← links)
- Edge exploration of temporal graphs (Q5918622) (← links)
- The interactive sum choice number of graphs (Q5919074) (← links)
- Edge exploration of temporal graphs (Q5925630) (← links)
- The parameterised complexity of computing the maximum modularity of a graph (Q6304366) (← links)
- A New Temporal Interpretation of Cluster Editing (Q6389955) (← links)
- Tangled Paths: A Random Graph Model from Mallows Permutations (Q6505169) (← links)
- Structural Parameters for Dense Temporal Graphs (Q6532685) (← links)
- Reachability in temporal graphs under perturbation (Q6532697) (← links)
- Making life more confusing for firefighters (Q6540584) (← links)
- A new temporal interpretation of cluster editing (Q6564624) (← links)
- Counting subgraphs in somewhere dense graphs (Q6610290) (← links)
- Counting temporal paths (Q6615135) (← links)
- Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
- The complexity of finding and enumerating optimal subgraphs to represent spatial correlation (Q6623585) (← links)
