The following pages link to (Q4028099):
Displaying 17 items.
- On low tree-depth decompositions (Q897253) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- A parameterized view on matroid optimization problems (Q1035682) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Mining weighted subgraphs in a single large graph (Q2660705) (← links)
- (Q4638077) (← links)
- (Q5091136) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- LATIN 2004: Theoretical Informatics (Q5901641) (← links)
- A better subgraph of the minimum weight triangulation (Q6085740) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- Parameterized complexity of reconfiguration of atoms (Q6623588) (← links)
- Finding and counting small tournaments in large tournaments (Q6652454) (← links)
