All Stories

  1. Compare the ratio of symmetric polynomials of odds to one and stop

    Article • Journal of Applied Probability, March 2017, Cambridge University Press

    Tomomi Matsui

  2. Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems

    Article • January 2017, Springer Science + Business Media

    Tomomi Matsui

  3. Manufacturability-aware mask assignment in multiple patterning lithography

    Article • October 2016, Institute of Electrical & Electronics Engineers (IEEE)

    Tomomi Matsui

  4. Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings

    Article • Mathematics of Operations Research, May 2016, INFORMS

    Tomomi Matsui

  5. Yield-aware mask assignment by positive semidefinite relaxation in triple patterning using cut process

    Article • Journal of Micro/Nanolithography MEMS and MOEMS, March 2016, SPIE

    Tomomi Matsui

  6. A linear time algorithm for the unbalanced Hitchcock transportation problem

    Article • Networks, December 2015, Wiley

    Tomomi Matsui

  7. Yield-aware mask assignment using positive semi-definite relaxation in LELECUT triple patterning

    Article • March 2015, SPIE

    Tomomi Matsui

  8. Fast mask assignment using positive semidefinite relaxation in LELECUT triple patterning lithography

    Article • January 2015, Institute of Electrical & Electronics Engineers (IEEE)

    Tomomi Matsui

  9. Fractional programming formulation for the vertex coloring problem

    Article • Information Processing Letters, December 2014, Elsevier

    Tomomi Matsui

  10. A note on a lower bound for the multiplicative odds theorem of optimal stopping

    Article • Journal of Applied Probability, September 2014, Cambridge University Press

    Tomomi Matsui

  11. A Note on a Lower Bound for the Multiplicative Odds Theorem of Optimal Stopping

    Article • Journal of Applied Probability, September 2014, Cambridge University Press

    Tomomi Matsui

  12. Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography

    Article • January 2014, Springer Science + Business Media

    Tomomi Matsui

  13. NP-completeness of Arithmetical Restorations

    Article • Journal of Information Processing, January 2013, Information Processing Society of Japan

    Tomomi Matsui

  14. A 2.75-approximation algorithm for the unconstrained traveling tournament problem

    Article • Annals of Operations Research, June 2012, Springer Science + Business Media

    Tomomi Matsui

  15. An Improved Approximation Algorithm for the Traveling Tournament Problem

    Article • Algorithmica, October 2011, Springer Science + Business Media

    Tomomi Matsui

  16. Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists

    Article • January 2011, Springer Science + Business Media

    Tomomi Matsui

  17. Improved Approximation Algorithms for Firefighter Problem on Trees

    Article • IEICE Transactions on Information and Systems, January 2011, Institute of Electronics, Information and Communications Engineers (IEICE)

    Tomomi Matsui

  18. Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane

    Article • January 2011, Springer Science + Business Media

    Tomomi Matsui

  19. Polynomial time approximate or perfect samplers for discretized Dirichlet distribution

    Article • Japan Journal of Industrial and Applied Mathematics, May 2010, Springer Science + Business Media

    Tomomi Matsui

  20. An approximation algorithm for the traveling tournament problem

    Article • Annals of Operations Research, April 2010, Springer Science + Business Media

    Tomomi Matsui

  21. Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists

    Article • Algorithmica, September 2009, Springer Science + Business Media

    Tomomi Matsui

  22. A note on generalized rank aggregation

    Article • Information Processing Letters, June 2009, Elsevier

    Tomomi Matsui

  23. An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors

    Article • Discrete Applied Mathematics, May 2009, Elsevier

    Tomomi Matsui

  24. Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems

    Article • Discrete Applied Mathematics, May 2009, Elsevier

    Tomomi Matsui

  25. A study of the quadratic semi-assignment polytope

    Article • Discrete Optimization, February 2009, Elsevier

    Tomomi Matsui

  26. Successful Manipulation in Stable Marriage Model with Complete Preference Lists

    Article • IEICE Transactions on Information and Systems, January 2009, Institute of Electronics, Information and Communications Engineers (IEICE)

    Tomomi Matsui

  27. An Improved Approximation Algorithm for the Traveling Tournament Problem

    Article • January 2009, Springer Science + Business Media

    Tomomi Matsui

  28. Exact algorithms for the master ring problem

    Article • Networks, September 2008, Wiley

    Tomomi Matsui

  29. Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers

    Article • Annals of Operations Research, January 2008, Springer Science + Business Media

    Tomomi Matsui

  30. Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks

    Article • Electronic Notes in Discrete Mathematics, October 2006, Elsevier

    Tomomi Matsui

  31. Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem

    Article • Electronic Notes in Discrete Mathematics, October 2006, Elsevier

    Tomomi Matsui

  32. Algorithms for Computing Geometric Measures of Melodic Similarity

    Article • Computer Music Journal, September 2006, The MIT Press

    Tomomi Matsui

  33. Semidefinite programming based approaches to the break minimization problem

    Article • Computers & Operations Research, July 2006, Elsevier

    Tomomi Matsui

  34. A general construction method for mixed-level supersaturated design

    Article • Computational Statistics & Data Analysis, January 2006, Elsevier

    Tomomi Matsui

  35. Approximation Algorithms for Minimum Span Channel Assignment Problems

    Article • January 2006, Springer Science + Business Media

    Tomomi Matsui

  36. Polynomial time perfect sampling algorithm for two-rowed contingency tables

    Article • Random Structures and Algorithms, January 2006, Wiley

    Tomomi Matsui

  37. A polynomial-time algorithm to find an equitable home–away assignment

    Article • Operations Research Letters, May 2005, Elsevier

    Tomomi Matsui

  38. Perfectness and Imperfectness of the kth Power of Lattice Graphs

    Article • January 2005, Springer Science + Business Media

    Tomomi Matsui

  39. Efficient Algorithms for the Electric Power Transaction Problem

    Article • January 2005, Springer Science + Business Media

    Tomomi Matsui

  40. Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling

    Article • January 2005, Springer Science + Business Media

    Tomomi Matsui

  41. Polynomial Time Perfect Sampling Algorithm for Two-Rowed Contingency Tables

    Article • January 2004, Springer Science + Business Media

    Tomomi Matsui

  42. Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution

    Article • January 2003, Springer Science + Business Media

    Tomomi Matsui

  43. Characterizing Feasible Pattern Sets with a Minimum Number of Breaks

    Article • January 2003, Springer Science + Business Media

    Tomomi Matsui

  44. Optimality of mixed-level supersaturated designs

    Article • Journal of Statistical Planning and Inference, June 2002, Elsevier

    Tomomi Matsui

  45. NP-completeness for calculating power indices of weighted majority games

    Article • Theoretical Computer Science, July 2001, Elsevier

    Tomomi Matsui

  46. Integer Programming Based Algorithms for Peg Solitaire Problems

    Article • January 2001, Springer Science + Business Media

    Tomomi Matsui

  47. 0.863-Approximation Algorithm for MAX DICUT

    Article • January 2001, Springer Science + Business Media

    Tomomi Matsui

  48. Sealed Bid Multi-object Auctions with Necessary Bundles and its Application to Spectrum Auctions

    Article • January 2001, Springer Science + Business Media

    Tomomi Matsui

  49. Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

    Article • January 2000, Springer Science + Business Media

    Tomomi Matsui

  50. On the Complexities of the Optimal Rounding Problems of Sequences and Matrices

    Article • January 2000, Springer Science + Business Media

    Tomomi Matsui

  51. A fast bipartite network flow algorithm for selective assembly

    Article • Operations Research Letters, May 1998, Elsevier

    Tomomi Matsui

  52. Enumeration algorithm for the edge coloring problem on bipartite graphs

    Article • January 1996, Springer Science + Business Media

    Tomomi Matsui

  53. The minimum spanning tree problem on a planar graph

    Article • Discrete Applied Mathematics, March 1995, Elsevier

    Tomomi Matsui

  54. An algorithm for fractional assignment problems

    Article • Discrete Applied Mathematics, January 1995, Elsevier

    Tomomi Matsui

  55. Algorithms for finding a Kth best valued assignment

    Article • Discrete Applied Mathematics, May 1994, Elsevier

    Tomomi Matsui

  56. Adjacency of the best and second best valued solutions in combinatorial optimization problems

    Article • Discrete Applied Mathematics, December 1993, Elsevier

    Tomomi Matsui

  57. A Note on K-Best Solutions to the Chinese Postman Problem

    Article • SIAM Journal on Optimization, November 1993, Society for Industrial & Applied Mathematics (SIAM)

    Tomomi Matsui

  58. Finding all minimum-cost perfect matchings in Bipartite graphs

    Article • Networks, August 1992, Wiley

    Tomomi Matsui

  59. On the finiteness of the criss-cross method

    Article • European Journal of Operational Research, May 1991, Elsevier

    Tomomi Matsui

  60. Parametric simplex algorithms for solving a special class of nonconvex minimization problems

    Article • Journal of Global Optimization, January 1991, Springer Science + Business Media

    Tomomi Matsui

  61. Nonparametric Estimation of Bivariate Distribution from Quantile-Response Data

    Article • Ouyou toukeigaku, January 1991, Japanese Society of Applied Statistics

    Tomomi Matsui

  62. Polynomial Time Perfect Sampler for Discretized Dirichlet Distribution

    Article • Springer Science + Business Media

    Tomomi Matsui

  63. Constructive Algorithms for the Constant Distance Traveling Tournament Problem

    Article • Springer Science + Business Media

    Tomomi Matsui