The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Tomomi Matsui: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui
    Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling. [Citation Graph (0, 0)][DBLP]
    AAIM, 2005, pp:95-103 [Conf]
  2. Yuichiro Miyamoto, Tomomi Matsui
    Perfectness and Imperfectness of the kth Power of Lattice Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2005, pp:233-242 [Conf]
  3. Yuichiro Miyamoto, Tomomi Matsui
    Approximation Algorithms for Minimum Span Channel Assignment Problems. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:334-342 [Conf]
  4. Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint
    Computing the Similarity of two Melodies. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:81-84 [Conf]
  5. Masashi Kiyomi, Tomomi Matsui
    Integer Programming Based Algorithms for Peg Solitaire Problems. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2000, pp:229-240 [Conf]
  6. Yasuko Matsui, Tomomi Matsui
    Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:18-26 [Conf]
  7. Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
    Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:676-685 [Conf]
  8. Tomomi Matsui
    Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:194-200 [Conf]
  9. Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui
    Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. [Citation Graph (0, 0)][DBLP]
    PATAT, 2002, pp:78-99 [Conf]
  10. Tomomi Matsui, Takahiro Watanabe
    Sealed Bid Mulit-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions. [Citation Graph (0, 0)][DBLP]
    PRIMA, 2001, pp:78-92 [Conf]
  11. Shiro Matuura, Tomomi Matsui
    63-Approximation Algorithm for MAX DICUT. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:138-146 [Conf]
  12. Yuichiro Miyamoto, Tomomi Matsui
    Multicoloring unit disk graphs on triangular lattice points. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:895-896 [Conf]
  13. Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
    On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:476-489 [Conf]
  14. Masashi Kiyomi, Takeaki Uno, Tomomi Matsui
    Efficient Algorithms for the Electric Power Transaction Problem. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:602-611 [Conf]
  15. Shuji Kijima, Tomomi Matsui
    Approximate/perfect samplers for closed Jackson networks. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2005, pp:862-868 [Conf]
  16. Ryuhei Miyashiro, Tomomi Matsui
    Semidefinite programming based approaches to the break minimization problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:1975-1982 [Journal]
  17. Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura
    Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:3, pp:227-232 [Journal]
  18. Tomomi Matsui
    The Minimum Spanning Tree Problem on a Planar Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:58, n:1, pp:91-94 [Journal]
  19. Tomomi Matsui, Sunao Tamura
    Adjacency on Combinatorial Polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:311-321 [Journal]
  20. Tomomi Matsui, Akihisa Tamura, Yoshiko Ikebe
    Algorithms for finding a Kth best valued assignment. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:3, pp:283-296 [Journal]
  21. Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui
    An Algorithm for Fractional Assignment Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:333-343 [Journal]
  22. Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
    Optimal Roundings of Sequences and Matrices. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:241-0 [Journal]
  23. Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
    A fast bipartite network flow algorithm for selective assembly. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:22, n:4-5, pp:137-143 [Journal]
  24. Ryuhei Miyashiro, Tomomi Matsui
    A polynomial-time algorithm to find an equitable home-away assignment. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:235-241 [Journal]
  25. Shuji Kijima, Tomomi Matsui
    Polynomial time perfect sampling algorithm for two-rowed contingency tables. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:2, pp:243-256 [Journal]
  26. Yasuko Matsui, Tomomi Matsui
    NP-completeness for calculating power indices of weighted majority games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:305-310 [Journal]
  27. Tomomi Matsui, Yasuko Matsui, Yoko Ono
    Random generation of 2 times 2 times ... times 2 times J contingency tables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:117-135 [Journal]
  28. Shu Yamada, Michiyo Matsui, Tomomi Matsui, Dennis K. J. Lin, Takenori Takahashi
    A general construction method for mixed-level supersaturated design. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2006, v:50, n:1, pp:254-265 [Journal]

  29. An Improved Approximation Algorithm for the Traveling Tournament Problem. [Citation Graph (, )][DBLP]


  30. Constructive Algorithms for the Constant Distance Traveling Tournament Problem. [Citation Graph (, )][DBLP]


  31. Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems. [Citation Graph (, )][DBLP]


  32. An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. [Citation Graph (, )][DBLP]


  33. Perfectness and imperfectness of unit disk graphs on triangular lattice points. [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002