The following pages link to Philipp Kuinke (Q2283098):
Displaying 6 items.
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Local Structure Theorems for Erdős–Rényi Graphs and Their Algorithmic Applications (Q5127177) (← links)
- A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly (Q5232724) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- The complexity of packing edge-disjoint paths (Q5875542) (← links)
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size (Q6084357) (← links)
