教員紹介

論文

• An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs 2019

• Parameterized algorithms for the happy set problem 2021/12

• Complexity and approximability of the happy set problem 2021/04

• Graph orientation with edge modifications 2021/02

• How to pack directed acyclic graphs into small blocks 2021/01

• Graph orientation with splits 2020/12

• Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem 2020/10

• Graph Classes and Approximability of the Happy Set Problem 2020/08

• Parameterized Algorithms for the Happy Set Problem 2020/04

• Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem 2019

• Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems 2019

• Graph Orientation with Edge Modifications 2019

• Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems 2018/06

• Approximation algorithms for packing directed acyclic graphs into two-size blocks 2018

• Graph orientation with splits 2018

• Improvement of the greedy algorithm for (n^2-1)-puzzle 2017