Search the dblp DataBase
Yusuke Kobayashi :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Kazuharu Arakawa , Koya Mori , Katsuhiko Ikeda , Tatekimi Matsuzaki , Yusuke Kobayashi , Masaru Tomita G-language Genome Analysis Environment: a workbench for nucleotide sequence data mining. [Citation Graph (0, 0)][DBLP ] Bioinformatics, 2003, v:19, n:2, pp:305-306 [Journal ] Kentaro Sano , Yusuke Kobayashi , Tadao Nakamura Differential coding scheme for efficient parallel image composition on a PC cluster system. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 2004, v:30, n:2, pp:285-299 [Journal ] Yusuke Kobayashi , Kazuo Murota Induction of M-convex functions by linking systems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:11, pp:1471-1480 [Journal ] An O (logn )-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs. [Citation Graph (, )][DBLP ] Improved Algorithm for the Half-Disjoint Paths Problem. [Citation Graph (, )][DBLP ] Robust Matchings and Matroid Intersections. [Citation Graph (, )][DBLP ] An Effective Inference Method Using Sensor Data for Symbiotic Healthcare Support System. [Citation Graph (, )][DBLP ] The Induced Disjoint Paths Problem. [Citation Graph (, )][DBLP ] On Shortest Disjoint Paths in Planar Graphs. [Citation Graph (, )][DBLP ] Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. [Citation Graph (, )][DBLP ] The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. [Citation Graph (, )][DBLP ] Development of Active 80-faced Polyhedron for haptic physical human-machine interface. [Citation Graph (, )][DBLP ] An Algorithm for Minimum Cost Arc-Connectivity Orientations. [Citation Graph (, )][DBLP ] Induced disjoint paths problem in a planar digraph. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs