The following pages link to Hiroshi Eto (Q401301):
Displaying 18 items.
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree (Q2842769) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
- Distance-d Independent Set Problems for Bipartite and Chordal Graphs (Q3167365) (← links)
- (Q5875545) (← links)
- Parameterized algorithms for the happy set problem (Q5896128) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q6069926) (← links)
- Corrigendum to: ``Complexity and approximability of the happy set problem'' (Q6076349) (← links)
- Approximation algorithms for the longest run subsequence problem (Q6622004) (← links)
- Reconfiguration of vertex-disjoint shortest paths on graphs (Q6637000) (← links)
