| 1. |
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. |
| 2. |
Algorithms for coloring reconfiguration under recolorability digraphs. |
| 3. |
Neighborhood persistency of the linear optimization relaxation of integer linear optimization. |
| 4. |
Quantaloidal approach to constraint satisfaction. |
| 5. |
Trichotomy for the reconfiguration problem of integer linear systems. |
| 6. |
Computational complexity of the reconfiguration problem of integer linear systems. |
| 7. |
Three-dimensional discrete tomography with restriction on height and constraint numbers. |
| 8. |
A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition. |
| 9. |
Linear Satisfiability Preserving Assignments (Extended Abstract). |
| 10. |
The Fewest Clues Problem of Picross 3D. |
| 11. |
Approximating Partially Bounded Degree Deletion on Directed Graphs. |
| 12. |
Optimal Matroid Partitioning Problems. |
| 13. |
Min-sum-max matroid partitioning problem. |
| 14. |
整数線形不等式系の実行可能性問題における多項式時間可解部分クラス. |
| 15. |
A Complexity Index for Integer Linear Systems Based on Their Sign Patterns. |
| 16. |
Maximum Lifetime Coverage Problems with Battery Recovery Effects. |
| 17. |
DS-1-3 An Analysis of Linear Fixable Assignments for Constraint Satifcation Problem. |
| 18. |
制約充足問題に対する線形固定可能割当ての解析. |
| 19. |
制約充足問題に対する線形固定可能割当ての解析. |
| 20. |
木村 慧, A Complexity Index of Integer Linear Systems Based on Their Sign Patterns, the 63th KPPY Combinatorics Workshop, Daegu, Korea, 2014.03. |
| 21. |
A Complexity Index for Integer Linear Systems Based on Their Sign Patterns. |
| 22. |
DS-1-6 A Complexity Index of Integer Linear Systems Based on Their Sign Patterns. |
| 23. |
整数線形不等式系の実行可能性問題に対する符号情報に基づく計算複雑さの指標. |
| 24. |
Trichotomy for Integer Linear Systems Based on Their Sign Patterns. |
| 25. |
整数線形システムの実行可能性問題に対する計算複雑さの指標. |
| 26. |
Surface inspection using multipole modulated LED ring with correlation image sensor. |
