Tomomi Matsui

101 papers A* 1B 7C 5Misc 1Journal 72Unranked 15
YearRankTypeTitle / Venue / Authors
2026 J jnl
Approximating the Shapley Value of Minimum Cost Spanning Tree Games: An FPRAS for Saving Games.
CoRR
Takumi Jimbo, Tomomi Matsui
2026 J jnl
Minimizing Breaks by Minimizing Odd Cycle Transversals.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Koichi Fujii, Tomomi Matsui
2025 J jnl
A Bigram Based ILP Formulation for Break Minimization in Sports Scheduling Problems.
IEICE Trans. Inf. Syst.
Koichi Fujii, Tomomi Matsui
2025 J jnl
Fast Mask Optimization Under Process Variation Using Guided Local Search on Quadratic Programming.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Naoki Nonaka, Masaki Kuramochi, Yukihide Kohira, Rina Azuma, Tomomi Matsui, Atsushi Takahashi, Chikaaki Kodama
2025 J jnl
On Computing the Shapley Value in Bankruptcy Games -llustrated by Rectified Linear Function Game-.
CoRR
Shunta Yamazaki, Tomomi Matsui
2025 J jnl
The Least Core of Routing Game without Triangle Inequality.
IEICE Trans. Inf. Syst.
Tomohiro Kobayashi, Tomomi Matsui
2024 J jnl
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: Star metric case.
Discret. Appl. Math.
Yuko Kuroki, Tomomi Matsui
2024 J jnl
Minimizing breaks by minimizing odd cycle transversals.
CoRR
Koichi Fujii, Tomomi Matsui
2023 J jnl
Solving break minimization problems in mirrored double round-robin tournament with QUBO solver.
CoRR
Koichi Fujii, Tomomi Matsui
2022 J jnl
Monte Carlo Methods for the Shapley-Shubik Power Index.
Games
Yuto Ushioda, Masato Tanaka, Tomomi Matsui
2022 — conf
New Formulation for Coloring Circle Graphs.
JCDCGGG
Masato Tanaka, Tomomi Matsui
2022 J jnl
Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games.
Math. Soc. Sci.
Masato Tanaka, Tomomi Matsui
2021 J jnl
Additive approximation algorithms for modularity maximization.
J. Comput. Syst. Sci.
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
2021 J jnl
Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games.
CoRR
Yuto Ushioda, Masato Tanaka, Tomomi Matsui
2021 J jnl
New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization.
CoRR
Masato Tanaka, Tomomi Matsui
2021 J jnl
Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games.
CoRR
Masato Tanaka, Tomomi Matsui
2021 J jnl
Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games.
CoRR
Akihiro Kawana, Tomomi Matsui
2020 J jnl
A doubly nonnegative relaxation for modularity density maximization.
Discret. Appl. Math.
Yoichi Izunaga, Tomomi Matsui, Yoshitsugu Yamamoto
2020 J jnl
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption.
Inf. Process. Lett.
Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura
2019 J jnl
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems.
J. Graph Algorithms Appl.
Yuko Kuroki, Tomomi Matsui
2019 J jnl
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor.
J. Glob. Optim.
Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui
2018 J jnl
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case.
CoRR
Yuko Kuroki, Tomomi Matsui
2017 B conf
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems.
WALCOM
Yuko Kuroki, Tomomi Matsui
2017 J jnl
Compare the ratio of symmetric polynomials of odds to one and stop.
J. Appl. Probab.
Tomomi Matsui, Ano Katsunori
2016 J jnl
A linear time algorithm for the unbalanced Hitchcock transportation problem.
Networks
Tomomi Matsui, Rudolf Scheifele
2016 B conf
Additive Approximation Algorithms for Modularity Maximization.
ISAAC
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
2016 J jnl
Additive Approximation Algorithms for Modularity Maximization.
CoRR
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
2016 J jnl
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems.
CoRR
Yuko Kuroki, Tomomi Matsui
2016 J jnl
Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties.
CoRR
Tomomi Matsui, Takayoshi Hamaguchi
2016 J jnl
Lower Bounds for Bruss' Odds Problem with Multiple Stoppings.
Math. Oper. Res.
Tomomi Matsui, Ano Katsunori
2016 — conf
Manufacturability-aware mask assignment in multiple patterning lithography.
APCCAS
Yukihide Kohira, Atsushi Takahashi, Tomomi Matsui, Chikaaki Kodama, Shigeki Nojima, Satoshi Tanaka
2015 — conf
Fast mask assignment using positive semidefinite relaxation in LELECUT triple patterning lithography.
ASP-DAC
Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka
2014 J jnl
A 2.75-approximation algorithm for the unconstrained traveling tournament problem.
Ann. Oper. Res.
Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro
2014 J jnl
A Note on a Lower Bound for the Multiplicative Odds Theorem of Optimal Stopping.
J. Appl. Probab.
Tomomi Matsui, Ano Katsunori
2014 J jnl
Fractional programming formulation for the vertex coloring problem.
CoRR
Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
2014 J jnl
Fractional programming formulation for the vertex coloring problem.
Inf. Process. Lett.
Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
2014 — conf
Method for Finding Protected Nodes for Robust Network against Node Failures.
INCoS
Tomomi Matsui, Hiroyoshi Miwa
2014 B conf
Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography.
ISAAC
Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi
2013 J jnl
NP-completeness of Arithmetical Restorations.
Inf. Media Technol.
Tomomi Matsui
2013 J jnl
NP-completeness of Arithmetical Restorations.
J. Inf. Process.
Tomomi Matsui
2012 J jnl
An approximation algorithm for the traveling tournament problem.
Ann. Oper. Res.
Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori
2012 — conf
Characterizing Delaunay Graphs via Fixed Point Theorem.
CCCG
Tomomi Matsui, Yuichiro Miyamoto
2011 J jnl
A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
CoRR
Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro
2011 B conf
Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane.
ISAAC
Ryuta Ando, Tomomi Matsui
2011 J jnl
An Improved Approximation Algorithm for the Traveling Tournament Problem.
Algorithmica
Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui
2011 — conf
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking.
CATS
Naoyuki Kamiyama, Tomomi Matsui
2011 J jnl
Improved Approximation Algorithms for Firefighter Problem on Trees.
IEICE Trans. Inf. Syst.
Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui
2010 — conf
Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists.
OR
Tomomi Matsui
2010 J jnl
Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists.
Algorithmica
Hirotatsu Kobayashi, Tomomi Matsui
2009 J jnl
A note on generalized rank aggregation.
Inf. Process. Lett.
Hadas Shachnai, Lisa Zhang, Tomomi Matsui
2009 J jnl
A study of the quadratic semi-assignment polytope.
Discret. Optim.
Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura
2009 B conf
An Improved Approximation Algorithm for the Traveling Tournament Problem.
ISAAC
Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui
2009 J jnl
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors.
Discret. Appl. Math.
Yusuke Kuroki, Tomomi Matsui
2009 J jnl
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems.
Discret. Appl. Math.
Masaru Iwasa, Hiroo Saito, Tomomi Matsui
2009 J jnl
Perfectness and imperfectness of unit disk graphs on triangular lattice points.
Discret. Math.
Yuichiro Miyamoto, Tomomi Matsui
2009 J jnl
Successful Manipulation in Stable Marriage Model with Complete Preference Lists.
IEICE Trans. Inf. Syst.
Hirotatsu Kobayashi, Tomomi Matsui
2008 J jnl
Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers.
SIAM J. Comput.
Shuji Kijima, Tomomi Matsui
2008 — conf
Diversion of Hierarchical Phrases as Reordering Templates.
NTCIR
Mikio Yamamoto, Jyunya Norimatsu, Mitsuru Koshikawa, Takahiro Fukutomi, Taku Nishio, Kugatsu Sadamitsu, Takehito Utsuro, Masao Utiyama, Shunji Umetani, Tomomi Matsui
2008 J jnl
Exact algorithms for the master ring problem.
Networks
Hadas Shachnai, Lisa Zhang, Tomomi Matsui
2008 J jnl
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers.
Ann. Oper. Res.
Shuji Kijima, Tomomi Matsui
2006 J jnl
A general construction method for mixed-level supersaturated design.
Comput. Stat. Data Anal.
Shu Yamada, Michiyo Matsui, Tomomi Matsui, Dennis K. J. Lin, Takenori Takahashi
2006 J jnl
Algorithms for Computing Geometric Measures of Melodic Similarity.
Comput. Music. J.
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint
2006 C conf
Approximation Algorithms for Minimum Span Channel Assignment Problems.
AAIM
Yuichiro Miyamoto, Tomomi Matsui
2006 J jnl
Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks.
Electron. Notes Discret. Math.
Masaru Iwasa, Hiroo Saito, Tomomi Matsui
2006 C conf
Constructive Algorithms for the Constant Distance Traveling Tournament Problem.
PATAT
Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro
2006 J jnl
Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui
2006 J jnl
Polynomial time perfect sampling algorithm for two-rowed contingency tables.
Random Struct. Algorithms
Shuji Kijima, Tomomi Matsui
2006 J jnl
Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem.
Electron. Notes Discret. Math.
Yusuke Kuroki, Tomomi Matsui
2006 J jnl
Semidefinite programming based approaches to the break minimization problem.
Comput. Oper. Res.
Ryuhei Miyashiro, Tomomi Matsui
2005 J jnl
A polynomial-time algorithm to find an equitable home-away assignment.
Oper. Res. Lett.
Ryuhei Miyashiro, Tomomi Matsui
2005 Misc conf
Approximate/perfect samplers for closed Jackson networks.
WSC
Shuji Kijima, Tomomi Matsui
2005 — conf
Efficient Algorithms for the Electric Power Transaction Problem.
WINE
Masashi Kiyomi, Takeaki Uno, Tomomi Matsui
2005 A* conf
Multicoloring unit disk graphs on triangular lattice points.
SODA
Yuichiro Miyamoto, Tomomi Matsui
2005 C conf
Perfectness and Imperfectness of the kth Power of Lattice Graphs.
AAIM
Yuichiro Miyamoto, Tomomi Matsui
2005 C conf
Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling.
AAIM
Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui
2004 J jnl
Approximate Counting Scheme for
IEICE Trans. Inf. Syst.
Shuji Kijima, Tomomi Matsui
2004 J jnl
Random generation of 2 times 2 times ... times 2 times J contingency tables.
Theor. Comput. Sci.
Tomomi Matsui, Yasuko Matsui, Yoko Ono
2003 — conf
Computing the Similarity of two Melodies.
CCCG
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint
2003 B conf
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution.
ISAAC
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
2002 J jnl
A Linear Relaxation for Hub Network Design Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroo Saito, Shiro Matuura, Tomomi Matsui
2002 C conf
Characterizing Feasible Pattern Sets with a Minimum Number of Breaks.
PATAT
Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui
2002 J jnl
Notes on Equitable Round-Robin Tournaments.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ryuhei Miyashiro, Tomomi Matsui
2001 — conf
63-Approximation Algorithm for MAX DICUT.
RANDOM-APPROX
Shiro Matuura, Tomomi Matsui
2001 J jnl
NP-completeness for calculating power indices of weighted majority games.
Theor. Comput. Sci.
Yasuko Matsui, Tomomi Matsui
2001 B conf
Sealed Bid Mulit-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions.
PRIMA
Tomomi Matsui, Takahiro Watanabe
2000 — conf
Integer Programming Based Algorithms for Peg Solitaire Problems.
Computers and Games
Masashi Kiyomi, Tomomi Matsui
2000 — conf
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices.
SWAT
Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
2000 J jnl
Optimal Roundings of Sequences and Matrices.
Nord. J. Comput.
Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
1998 J jnl
A fast bipartite network flow algorithm for selective assembly.
Oper. Res. Lett.
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
1998 — conf
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs.
JCDCG
Tomomi Matsui
1997 J jnl
A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs.
Algorithmica
Tomomi Matsui
1996 J jnl
NP-hardness of linear multiplicative programming and related problems.
J. Glob. Optim.
Tomomi Matsui
1995 J jnl
Adjacency on Combinatorial Polyhedra.
Discret. Appl. Math.
Tomomi Matsui, Sunao Tamura
1995 J jnl
An Algorithm for Fractional Assignment Problems.
Discret. Appl. Math.
Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui
1995 — conf
Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs.
Combinatorics and Computer Science
Yasuko Matsui, Tomomi Matsui
1995 J jnl
The Minimum Spanning Tree Problem on a Planar Graph.
Discret. Appl. Math.
Tomomi Matsui
1994 J jnl
Algorithms for finding a Kth best valued assignment.
Discret. Appl. Math.
Tomomi Matsui, Akihisa Tamura, Yoshiko Ikebe
1993 J jnl
A Note on
SIAM J. Optim.
Yasufumi Saruwatari, Tomomi Matsui
1993 J jnl
Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems.
Discret. Appl. Math.
Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura
1992 J jnl
Finding all minimum-cost perfect matchings in Bipartite graphs.
Networks
Komei Fukuda, Tomomi Matsui
1991 J jnl
Parametric simplex algorithms for solving a special class of nonconvex minimization problems.
J. Glob. Optim.
Hiroshi Konno, Yasutoshi Yajima, Tomomi Matsui