The following pages link to Tomohiro Koana (Q2032276):
Displaying 19 items.
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- Parameterized Complexity of Geodetic Set (Q5050005) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- Parameterized Algorithms for Matrix Completion with Radius Constraints. (Q5874448) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Parameterized complexity of min-power asymmetric connectivity (Q5918282) (← links)
- The complexity of gerrymandering over graphs: paths and trees (Q5918559) (← links)
- The complexity of gerrymandering over graphs: paths and trees (Q5925552) (← links)
- (Q6065417) (← links)
- Parameterized Complexity of Geodetic Set (Q6089667) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- (Q6147537) (← links)
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences (Q6188265) (← links)
- (Q6192494) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
- Covering many (or few) edges with \(k\) vertices in sparse graphs (Q6490988) (← links)
