default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomomi Matsui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j54]Yuko Kuroki, Tomomi Matsui:
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. 349: 201-214 (2024)- 2023
- [i11]Koichi Fujii, Tomomi Matsui:
Solving break minimization problems in mirrored double round-robin tournament with QUBO solver. CoRR abs/2307.00263 (2023) - 2022
- [j53]Yuto Ushioda, Masato Tanaka, Tomomi Matsui
:
Monte Carlo Methods for the Shapley-Shubik Power Index. Games 13(3): 44 (2022) - [j52]Masato Tanaka, Tomomi Matsui:
Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games. Math. Soc. Sci. 115: 47-51 (2022) - 2021
- [j51]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive approximation algorithms for modularity maximization. J. Comput. Syst. Sci. 117: 182-201 (2021) - [i10]Yuto Ushioda, Masato Tanaka, Tomomi Matsui:
Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games. CoRR abs/2101.02841 (2021) - [i9]Akihiro Kawana, Tomomi Matsui:
Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games. CoRR abs/2101.07621 (2021) - [i8]Masato Tanaka, Tomomi Matsui:
Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games. CoRR abs/2101.11180 (2021) - [i7]Masato Tanaka, Tomomi Matsui:
New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization. CoRR abs/2102.00691 (2021) - 2020
- [j50]Yoichi Izunaga, Tomomi Matsui, Yoshitsugu Yamamoto:
A doubly nonnegative relaxation for modularity density maximization. Discret. Appl. Math. 275: 69-78 (2020) - [j49]Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura:
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption. Inf. Process. Lett. 162: 105991 (2020)
2010 – 2019
- 2019
- [j48]Yuko Kuroki, Tomomi Matsui:
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. J. Graph Algorithms Appl. 23(1): 93-110 (2019) - [j47]Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui:
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor. J. Glob. Optim. 73(2): 431-446 (2019) - 2018
- [i6]Yuko Kuroki, Tomomi Matsui:
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case. CoRR abs/1803.06114 (2018) - 2017
- [j46]Tomomi Matsui, Ano Katsunori:
Compare the ratio of symmetric polynomials of odds to one and stop. J. Appl. Probab. 54(1): 12-22 (2017) - [c28]Yuko Kuroki, Tomomi Matsui:
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. WALCOM 2017: 397-408 - 2016
- [j45]Tomomi Matsui, Ano Katsunori:
Lower Bounds for Bruss' Odds Problem with Multiple Stoppings. Math. Oper. Res. 41(2): 700-714 (2016) - [j44]Tomomi Matsui, Rudolf Scheifele:
A linear time algorithm for the unbalanced Hitchcock transportation problem. Networks 67(2): 170-182 (2016) - [c27]Yukihide Kohira, Atsushi Takahashi, Tomomi Matsui, Chikaaki Kodama, Shigeki Nojima, Satoshi Tanaka:
Manufacturability-aware mask assignment in multiple patterning lithography. APCCAS 2016: 538-541 - [c26]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive Approximation Algorithms for Modularity Maximization. ISAAC 2016: 43:1-43:13 - [i5]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive Approximation Algorithms for Modularity Maximization. CoRR abs/1601.03316 (2016) - [i4]Tomomi Matsui, Takayoshi Hamaguchi:
Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties. CoRR abs/1601.03458 (2016) - [i3]Yuko Kuroki, Tomomi Matsui:
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. CoRR abs/1612.02990 (2016) - 2015
- [c25]Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka:
Fast mask assignment using positive semidefinite relaxation in LELECUT triple patterning lithography. ASP-DAC 2015: 665-670 - 2014
- [j43]Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
A 2.75-approximation algorithm for the unconstrained traveling tournament problem. Ann. Oper. Res. 218(1): 237-247 (2014) - [j42]Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi:
Fractional programming formulation for the vertex coloring problem. Inf. Process. Lett. 114(12): 706-709 (2014) - [j41]Tomomi Matsui, Ano Katsunori:
A Note on a Lower Bound for the Multiplicative Odds Theorem of Optimal Stopping. J. Appl. Probab. 51(3): 885-889 (2014) - [c24]Tomomi Matsui, Hiroyoshi Miwa:
Method for Finding Protected Nodes for Robust Network against Node Failures. INCoS 2014: 378-383 - [c23]Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi:
Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography. ISAAC 2014: 365-375 - [i2]Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi:
Fractional programming formulation for the vertex coloring problem. CoRR abs/1402.5769 (2014) - 2013
- [j40]Tomomi Matsui:
NP-completeness of Arithmetical Restorations. Inf. Media Technol. 8(3): 719-721 (2013) - [j39]Tomomi Matsui:
NP-completeness of Arithmetical Restorations. J. Inf. Process. 21(3): 402-404 (2013) - 2012
- [j38]Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori:
An approximation algorithm for the traveling tournament problem. Ann. Oper. Res. 194(1): 317-324 (2012) - [c22]Tomomi Matsui, Yuichiro Miyamoto:
Characterizing Delaunay Graphs via Fixed Point Theorem. CCCG 2012: 241-246 - 2011
- [j37]Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui:
An Improved Approximation Algorithm for the Traveling Tournament Problem. Algorithmica 61(4): 1077-1091 (2011) - [j36]Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui:
Improved Approximation Algorithms for Firefighter Problem on Trees. IEICE Trans. Inf. Syst. 94-D(2): 196-199 (2011) - [c21]Naoyuki Kamiyama, Tomomi Matsui:
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. CATS 2011: 137-144 - [c20]Ryuta Ando, Tomomi Matsui:
Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane. ISAAC 2011: 474-483 - [i1]Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem. CoRR abs/1110.0620 (2011) - 2010
- [j35]Hirotatsu Kobayashi, Tomomi Matsui:
Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists. Algorithmica 58(1): 151-169 (2010) - [c19]Tomomi Matsui:
Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists. OR 2010: 47-52
2000 – 2009
- 2009
- [j34]Masaru Iwasa, Hiroo Saito, Tomomi Matsui:
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems. Discret. Appl. Math. 157(9): 2078-2088 (2009) - [j33]Yusuke Kuroki, Tomomi Matsui:
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. Discret. Appl. Math. 157(9): 2124-2135 (2009) - [j32]Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura:
A study of the quadratic semi-assignment polytope. Discret. Optim. 6(1): 37-50 (2009) - [j31]Yuichiro Miyamoto, Tomomi Matsui:
Perfectness and imperfectness of unit disk graphs on triangular lattice points. Discret. Math. 309(9): 2733-2744 (2009) - [j30]Hirotatsu Kobayashi, Tomomi Matsui:
Successful Manipulation in Stable Marriage Model with Complete Preference Lists. IEICE Trans. Inf. Syst. 92-D(2): 116-119 (2009) - [j29]Hadas Shachnai, Lisa Zhang, Tomomi Matsui:
A note on generalized rank aggregation. Inf. Process. Lett. 109(13): 647-651 (2009) - [c18]Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui:
An Improved Approximation Algorithm for the Traveling Tournament Problem. ISAAC 2009: 679-688 - 2008
- [j28]Shuji Kijima, Tomomi Matsui:
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. Ann. Oper. Res. 162(1): 35-55 (2008) - [j27]Hadas Shachnai, Lisa Zhang, Tomomi Matsui:
Exact algorithms for the master ring problem. Networks 52(2): 98-107 (2008) - [j26]Shuji Kijima, Tomomi Matsui:
Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers. SIAM J. Comput. 38(4): 1484-1503 (2008) - [c17]Mikio Yamamoto, Jyunya Norimatsu, Mitsuru Koshikawa, Takahiro Fukutomi, Taku Nishio, Kugatsu Sadamitsu, Takehito Utsuro, Masao Utiyama, Shunji Umetani, Tomomi Matsui:
Diversion of Hierarchical Phrases as Reordering Templates. NTCIR 2008 - 2006
- [j25]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
Algorithms for Computing Geometric Measures of Melodic Similarity. Comput. Music. J. 30(3): 67-76 (2006) - [j24]Ryuhei Miyashiro, Tomomi Matsui:
Semidefinite programming based approaches to the break minimization problem. Comput. Oper. Res. 33: 1975-1982 (2006) - [j23]Shu Yamada, Michiyo Matsui, Tomomi Matsui, Dennis K. J. Lin, Takenori Takahashi:
A general construction method for mixed-level supersaturated design. Comput. Stat. Data Anal. 50(1): 254-265 (2006) - [j22]Masaru Iwasa, Hiroo Saito, Tomomi Matsui:
Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks. Electron. Notes Discret. Math. 27: 51-52 (2006) - [j21]Yusuke Kuroki, Tomomi Matsui:
Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem. Electron. Notes Discret. Math. 27: 63-64 (2006) - [j20]Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui:
Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1407-1416 (2006) - [j19]Shuji Kijima, Tomomi Matsui:
Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct. Algorithms 29(2): 243-256 (2006) - [c16]Yuichiro Miyamoto, Tomomi Matsui:
Approximation Algorithms for Minimum Span Channel Assignment Problems. AAIM 2006: 334-342 - [c15]Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
Constructive Algorithms for the Constant Distance Traveling Tournament Problem. PATAT 2006: 135-146 - 2005
- [j18]Ryuhei Miyashiro, Tomomi Matsui:
A polynomial-time algorithm to find an equitable home-away assignment. Oper. Res. Lett. 33(3): 235-241 (2005) - [c14]Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui:
Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling. AAIM 2005: 95-103 - [c13]Yuichiro Miyamoto, Tomomi Matsui:
Perfectness and Imperfectness of the kth Power of Lattice Graphs. AAIM 2005: 233-242 - [c12]Yuichiro Miyamoto, Tomomi Matsui:
Multicoloring unit disk graphs on triangular lattice points. SODA 2005: 895-896 - [c11]Masashi Kiyomi, Takeaki Uno, Tomomi Matsui:
Efficient Algorithms for the Electric Power Transaction Problem. WINE 2005: 602-611 - [c10]Shuji Kijima, Tomomi Matsui:
Approximate/perfect samplers for closed Jackson networks. WSC 2005: 862-868 - 2004
- [j17]Shuji Kijima, Tomomi Matsui:
Approximate Counting Scheme for m X n Contingency Tables. IEICE Trans. Inf. Syst. 87-D(2): 308-314 (2004) - [j16]Tomomi Matsui, Yasuko Matsui, Yoko Ono:
Random generation of 2 times 2 times ... times 2 times J contingency tables. Theor. Comput. Sci. 326(1-3): 117-135 (2004) - 2003
- [c9]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
Computing the Similarity of two Melodies. CCCG 2003: 81-84 - [c8]Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani:
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution. ISAAC 2003: 676-685 - 2002
- [j15]Hiroo Saito, Shiro Matuura, Tomomi Matsui:
A Linear Relaxation for Hub Network Design Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1000-1005 (2002) - [j14]Ryuhei Miyashiro, Tomomi Matsui:
Notes on Equitable Round-Robin Tournaments. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1006-1010 (2002) - [c7]Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui:
Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. PATAT 2002: 78-99 - 2001
- [j13]Yasuko Matsui, Tomomi Matsui:
NP-completeness for calculating power indices of weighted majority games. Theor. Comput. Sci. 263(1-2): 305-310 (2001) - [c6]Tomomi Matsui, Takahiro Watanabe:
Sealed Bid Mulit-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions. PRIMA 2001: 78-92 - [c5]Shiro Matuura, Tomomi Matsui:
63-Approximation Algorithm for MAX DICUT. RANDOM-APPROX 2001: 138-146 - 2000
- [j12]Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama:
Optimal Roundings of Sequences and Matrices. Nord. J. Comput. 7(3): 241- (2000) - [c4]Masashi Kiyomi, Tomomi Matsui:
Integer Programming Based Algorithms for Peg Solitaire Problems. Computers and Games 2000: 229-240 - [c3]Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama:
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT 2000: 476-489
1990 – 1999
- 1998
- [j11]Satoru Iwata, Tomomi Matsui, S. Thomas McCormick:
A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. 22(4-5): 137-143 (1998) - [c2]Tomomi Matsui:
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. JCDCG 1998: 194-200 - 1997
- [j10]Tomomi Matsui:
A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs. Algorithmica 18(4): 530-543 (1997) - 1996
- [j9]Tomomi Matsui:
NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9(2): 113-119 (1996) - 1995
- [j8]Tomomi Matsui, Sunao Tamura:
Adjacency on Combinatorial Polyhedra. Discret. Appl. Math. 56(2-3): 311-321 (1995) - [j7]Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui:
An Algorithm for Fractional Assignment Problems. Discret. Appl. Math. 56(2-3): 333-343 (1995) - [j6]Tomomi Matsui:
The Minimum Spanning Tree Problem on a Planar Graph. Discret. Appl. Math. 58(1): 91-94 (1995) - [c1]Yasuko Matsui, Tomomi Matsui:
Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs. Combinatorics and Computer Science 1995: 18-26 - 1994
- [j5]Tomomi Matsui, Akihisa Tamura, Yoshiko Ikebe:
Algorithms for finding a Kth best valued assignment. Discret. Appl. Math. 50(3): 283-296 (1994) - 1993
- [j4]Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura:
Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. Discret. Appl. Math. 47(3): 227-232 (1993) - [j3]Yasufumi Saruwatari, Tomomi Matsui:
A Note on K-Best Solutions to the Chinese Postman Problem. SIAM J. Optim. 3(4): 726-733 (1993) - 1992
- [j2]Komei Fukuda, Tomomi Matsui:
Finding all minimum-cost perfect matchings in Bipartite graphs. Networks 22(5): 461-468 (1992) - 1991
- [j1]Hiroshi Konno, Yasutoshi Yajima, Tomomi Matsui:
Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J. Glob. Optim. 1(1): 65-81 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
