Tomomi Matsui

According to our database, Tomomi Matsui authored at least 83 papers between 1991 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Solving break minimization problems in mirrored double round-robin tournament with QUBO solver.

Koichi Fujii, Tomomi Matsui

CoRR, 2023

2022

Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games.

Masato Tanaka, Tomomi Matsui

Math. Soc. Sci., 2022

Monte Carlo Methods for the Shapley-Shubik Power Index.

Yuto Ushioda, Masato Tanaka, Tomomi Matsui

Games, 2022

2021

Additive approximation algorithms for modularity maximization.

Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi

J. Comput. Syst. Sci., 2021

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization.

Masato Tanaka, Tomomi Matsui

CoRR, 2021

Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games.

Akihiro Kawana, Tomomi Matsui

CoRR, 2021

Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games.

Yuto Ushioda, Masato Tanaka, Tomomi Matsui

CoRR, 2021

2020

A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption.

Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura

Inf. Process. Lett., 2020

A doubly nonnegative relaxation for modularity density maximization.

Yoichi Izunaga, Tomomi Matsui, Yoshitsugu Yamamoto

Discret. Appl. Math., 2020

2019

Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor.

Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui

J. Glob. Optim., 2019

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

Yuko Kuroki, Tomomi Matsui

J. Graph Algorithms Appl., 2019

2018

A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case.

Yuko Kuroki, Tomomi Matsui

CoRR, 2018

2017

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

Tomomi Matsui, Ano Katsunori

J. Appl. Probab., 2017

2016

A linear time algorithm for the unbalanced Hitchcock transportation problem.

Tomomi Matsui, Rudolf Scheifele

Networks, 2016

Lower Bounds for Bruss' Odds Problem with Multiple Stoppings.

Tomomi Matsui, Ano Katsunori

Math. Oper. Res., 2016

Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties.

Tomomi Matsui, Takayoshi Hamaguchi

CoRR, 2016

Manufacturability-aware mask assignment in multiple patterning lithography.

Yukihide Kohira, Atsushi Takahashi, Tomomi Matsui, Chikaaki Kodama, Shigeki Nojima, Satoshi Tanaka

Proceedings of the 2016 IEEE Asia Pacific Conference on Circuits and Systems, 2016

2015

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

Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka

Proceedings of the 20th Asia and South Pacific Design Automation Conference, 2015

2014

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

Tomomi Matsui, Ano Katsunori

J. Appl. Probab., 2014

Fractional programming formulation for the vertex coloring problem.

Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi

Inf. Process. Lett., 2014

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

Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

Ann. Oper. Res., 2014

Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography.

Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Method for Finding Protected Nodes for Robust Network against Node Failures.

Tomomi Matsui, Hiroyoshi Miwa

Proceedings of the 2014 International Conference on Intelligent Networking and Collaborative Systems, 2014

2013

NP-completeness of Arithmetical Restorations.

Tomomi Matsui

J. Inf. Process., 2013

2012

An approximation algorithm for the traveling tournament problem.

Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori

Ann. Oper. Res., 2012

Characterizing Delaunay Graphs via Fixed Point Theorem.

Tomomi Matsui, Yuichiro Miyamoto

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Improved Approximation Algorithms for Firefighter Problem on Trees.

Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui

IEICE Trans. Inf. Syst., 2011

An Improved Approximation Algorithm for the Traveling Tournament Problem.

Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui

Algorithmica, 2011

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

Ryuta Ando, Tomomi Matsui

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking.

Naoyuki Kamiyama, Tomomi Matsui

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

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

Hirotatsu Kobayashi, Tomomi Matsui

Algorithmica, 2010

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

Tomomi Matsui

Proceedings of the Operations Research Proceedings 2010, 2010

2009

A note on generalized rank aggregation.

Hadas Shachnai, Lisa Zhang, Tomomi Matsui

Inf. Process. Lett., 2009

Successful Manipulation in Stable Marriage Model with Complete Preference Lists.

Hirotatsu Kobayashi, Tomomi Matsui

IEICE Trans. Inf. Syst., 2009

Perfectness and imperfectness of unit disk graphs on triangular lattice points.

Yuichiro Miyamoto, Tomomi Matsui

Discret. Math., 2009

A study of the quadratic semi-assignment polytope.

Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura

Discret. Optim., 2009

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

Yusuke Kuroki, Tomomi Matsui

Discret. Appl. Math., 2009

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

Masaru Iwasa, Hiroo Saito, Tomomi Matsui

Discret. Appl. Math., 2009

2008

Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers.

Shuji Kijima, Tomomi Matsui

SIAM J. Comput., 2008

Exact algorithms for the master ring problem.

Hadas Shachnai, Lisa Zhang, Tomomi Matsui

Networks, 2008

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

Shuji Kijima, Tomomi Matsui

Ann. Oper. Res., 2008

Diversion of Hierarchical Phrases as Reordering Templates.

Mikio Yamamoto, Jyunya Norimatsu, Mitsuru Koshikawa, Takahiro Fukutomi, Taku Nishio, Kugatsu Sadamitsu, Takehito Utsuro, Masao Utiyama, Shunji Umetani, Tomomi Matsui

Proceedings of the 7th NTCIR Workshop Meeting on Evaluation of Information Access Technologies: Information Retrieval, 2008

2006

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

Shuji Kijima, Tomomi Matsui

Random Struct. Algorithms, 2006

Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling.

Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem.

Yusuke Kuroki, Tomomi Matsui

Electron. Notes Discret. Math., 2006

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

Masaru Iwasa, Hiroo Saito, Tomomi Matsui

Electron. Notes Discret. Math., 2006

A general construction method for mixed-level supersaturated design.

Shu Yamada, Michiyo Matsui, Tomomi Matsui, Dennis K. J. Lin, Takenori Takahashi

Comput. Stat. Data Anal., 2006

Semidefinite programming based approaches to the break minimization problem.

Ryuhei Miyashiro, Tomomi Matsui

Comput. Oper. Res., 2006

Algorithms for Computing Geometric Measures of Melodic Similarity.

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint

Comput. Music. J., 2006

Constructive Algorithms for the Constant Distance Traveling Tournament Problem.

Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

Approximation Algorithms for Minimum Span Channel Assignment Problems.

Yuichiro Miyamoto, Tomomi Matsui

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

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

Ryuhei Miyashiro, Tomomi Matsui

Oper. Res. Lett., 2005

Approximate/perfect samplers for closed Jackson networks.

Shuji Kijima, Tomomi Matsui

Proceedings of the 37th Winter Simulation Conference, Orlando, FL, USA, December 4-7, 2005, 2005

Efficient Algorithms for the Electric Power Transaction Problem.

Masashi Kiyomi, Takeaki Uno, Tomomi Matsui

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Multicoloring unit disk graphs on triangular lattice points.

Yuichiro Miyamoto, Tomomi Matsui

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

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

Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

Perfectness and Imperfectness of the kth Power of Lattice Graphs.

Yuichiro Miyamoto, Tomomi Matsui

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004

Random generation of 2 times 2 times ... times 2 times J contingency tables.

Tomomi Matsui, Yasuko Matsui, Yoko Ono

Theor. Comput. Sci., 2004

Approximate Counting Scheme for <i>m</i> X <i>n</i> Contingency Tables.

Shuji Kijima, Tomomi Matsui

IEICE Trans. Inf. Syst., 2004

2003

Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution.

Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Computing the Similarity of two Melodies.

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

A Linear Relaxation for Hub Network Design Problems.

Hiroo Saito, Shiro Matuura, Tomomi Matsui

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Notes on Equitable Round-Robin Tournaments.

Ryuhei Miyashiro, Tomomi Matsui

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Characterizing Feasible Pattern Sets with a Minimum Number of Breaks.

Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui

Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

2001

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

Yasuko Matsui, Tomomi Matsui

Theor. Comput. Sci., 2001

63-Approximation Algorithm for MAX DICUT.

Shiro Matuura, Tomomi Matsui

Proceedings of the Approximation, 2001

Sealed Bid Mulit-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions.

Tomomi Matsui, Takahiro Watanabe

Proceedings of the Intelligent Agents: Specification, 2001

2000

Optimal Roundings of Sequences and Matrices.

Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama

Nord. J. Comput., 2000

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

Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama

Proceedings of the Algorithm Theory, 2000

Integer Programming Based Algorithms for Peg Solitaire Problems.

Masashi Kiyomi, Tomomi Matsui

Proceedings of the Computers and Games, Second International Conference, 2000

1998

A fast bipartite network flow algorithm for selective assembly.

Satoru Iwata, Tomomi Matsui, S. Thomas McCormick

Oper. Res. Lett., 1998

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

Tomomi Matsui

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

1997

A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs.

Tomomi Matsui

Algorithmica, 1997

1996

NP-hardness of linear multiplicative programming and related problems.

Tomomi Matsui

J. Glob. Optim., 1996

1995

An Algorithm for Fractional Assignment Problems.

Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui

Discret. Appl. Math., 1995

Adjacency on Combinatorial Polyhedra.

Tomomi Matsui, Sunao Tamura

Discret. Appl. Math., 1995

The Minimum Spanning Tree Problem on a Planar Graph.

Tomomi Matsui

Discret. Appl. Math., 1995

Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs.

Yasuko Matsui, Tomomi Matsui

Proceedings of the Combinatorics and Computer Science, 1995

1994

Algorithms for finding a Kth best valued assignment.

Tomomi Matsui, Akihisa Tamura, Yoshiko Ikebe

Discret. Appl. Math., 1994

1993

A Note on <i>K</i>-Best Solutions to the Chinese Postman Problem.

Yasufumi Saruwatari, Tomomi Matsui

SIAM J. Optim., 1993

Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems.

Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura

Discret. Appl. Math., 1993

1992

Finding all minimum-cost perfect matchings in Bipartite graphs.

Komei Fukuda, Tomomi Matsui

Networks, 1992

1991

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

Hiroshi Konno, Yasutoshi Yajima, Tomomi Matsui

J. Glob. Optim., 1991