Teaching

2024

• Foundation of Discrete Optimization (Algoritihms for Job Scheduling)
• Discrete Mathematical Engineering

2023

• Foundation of Discrete Optimization (Network Flow)
• Discrete Mathematical Engineering
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Logic Puzzle Solving via Integer Programming

2022

• Foundation of Discrete Optimization (Integer Programming)
• Discrete Mathematical Engineering
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Logic Puzzle Solving via Integer Programming

2021

• Foundation of Discrete Optimization (Graph Homomorphisms)
• Discrete Mathematical Engineering
• Graphs and Networks
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Logic Puzzle Solving via Integer Programming

2020

• Foundation of Discrete Optimization (Matchings)
• Discrete Mathematical Engineering
• Theory of Computation (Computability)
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Logic Puzzle Solving via Integer Programming

2019

• Foundation of Discrete Optimization (Computational Complexity for Discrete Optimizers)
• Discrete Mathematical Engineering
• Graphs and Networks
• Understanding Computation
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Logic Puzzle Solving via Integer Programming

2018

• Foundation of Discrete Optimization (Combinatorial Optimization for Perfect Graphs)
• Discrete Mathematical Engineering
• Graphs and Networks

2017

• Foundation of Discrete Optimization (Geometric Set Cover)
• Discrete Mathematical Engineering
• Discrete Mathematics
• Graphs and Networks
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Logic Puzzle Solving via Integer Programming
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Solving the Fold-and-Cut Problem by Computational Geometry

2016

• Foundation of Discrete Optimization (Tree Decompositions of Graphs)
• Discrete Mathematical Engineering
• Discrete Mathematics (Winter)
• Graphs and Networks
• Discrete Mathematics (Summer)
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Logic Puzzle Solving via Integer Programming
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Solving the Fold-and-Cut Problem by Computational Geometry

2015

• Foundation of Discrete Optimization (Matroids)
• Discrete Mathematical Engineering
• Graphs and Networks
• Discrete Mathematics (Class I3)
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Algorithms for Network Visualization
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Curve Reconstruction via Computational Geometry
• Special Lecture (Introduction to Science and Technology Studies II) at the University of Tokyo: Distance

2014

• Foundation of Discrete Optimization (Use of Linear Programming for Combinatorial Optimization)
• Discrete Mathematical Engineering
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Algorithms for Network Visualization
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B: Curve Reconstruction via Computational Geometry
• Graphs and Networks
• Discrete Mathematics
• Special Lecture (Introduction to Science and Technology Studies II) at the University of Tokyo: Distance

2013

• Foundation of Discrete Optimization (Theoretical Aspects of Local Search)
• Mathematical Analysis (Graph Theory)
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B
• Discrete Mathematics
• Optimization Methods at Chuo University

2012

• Discrete Geometry at Kyushu University
• Foundation of Discrete Optimization (Algorithmic Aspects of Game Theory)
• Mathematical Analysis (Graph Theory)
• Mathematical Information Science Laboratory/Computer Science Laboratory II A/B
• Special Lectures at Osaka Prefecture University
• Discrete Mathematics

2011

• I482F: Advanced Algorithms (with Tetsuo Asano)
• I631: Foundation of Computational Geometry (with Tetsuo Asano)
• Enumeration School

2010

• Discrete Mathematics and Computational Structures: Extremal Combinatorics
• Discrete Geometry of Finite Metric Spaces and Its Algorithmic Applications at Tohoku University

2009

• Discrete Mathematics and Computational Structures: Lattice point counting in convex polytopes

2008

• Topics on Computing and Mathematical Sciences I: Graph Theory
• Enumeration School (Japanese)

2007

• NHC Autumn School on Computational Geometry and Integer Programming
• CPU Design (Japanese)
• Micro-Processors (Japanese)
• Solving Puzzles via Integer Programming (Japanese)
• Mathematics Training (Japanese)
• Programming Challenge (Japanese)

2006

• CPU Design (Japanese)
• Solving Puzzles via Integer Programming (Japanese)
• Mathematics Training (Japanese)
• Programming Challenge (Japanese)

2005

• Programming Challenge (Japanese)
• Data Structures and Algorithms (Japanese)
• Linear Programming (Japanese)

2004

• External Memory Algorithms and Data Structures
• Theoretical Computer Science

2003

• Graph Theory
• Theoretical Computer Science