Masaya Mito

According to our database, Masaya Mito authored at least 7 papers between 2004 and 2008.

Collaborative distances:

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

2008

Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction.

Masaya Mito, Satoshi Fujita

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Extended Skip Graphs for Efficient Key Search in Peer-to-Peer Environment.

Satoshi Fujita, Akira Ohtsubo, Masaya Mito

J. Interconnect. Networks, 2007

2006

A Generic Solver Based on Functional Parallelism for Solving Combinatorial Optimization Problems.

Shigeaki Tagashira, Masaya Mito, Satoshi Fujita

IEICE Trans. Inf. Syst., 2006

2005

Extended Skip Graphs for Efficient Key Search in P2P Environment.

Satoshi Fujita, Akira Ohtsubo, Masaya Mito

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Towards Generic Solver of Combinatorial Optimization Problems with Autonomous Agents in P2P Networks.

Shigeaki Tagashira, Masaya Mito, Satoshi Fujita

Proceedings of the High-Performance Computing - 6th International Symposium, 2005

Distributed Branch-and-Bound Scheme for Solving the Winner Determination Problem in Combinatorial Auctions.

Satoshi Fujita, Shigeaki Tagashira, Chen Qiao, Masaya Mito

Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA 2005), 2005

2004

On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions.

Masaya Mito, Satoshi Fujita

J. Heuristics, 2004