| 2013 | ||
|---|---|---|
| j25 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Transactions on Algorithms 9(2): 16 (2013) | |
| 2012 | ||
| j24 | Yusuke Kobayashi, Xin Yin: An algorithm for finding a maximum t-matching excluding complete partite subgraphs. Discrete Optimization 9(2): 98-108 (2012) | |
| j23 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: A linear time algorithm for the induced disjoint paths problem in planar graphs. J. Comput. Syst. Sci. 78(2): 670-680 (2012) | |
| j22 | Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed: The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B 102(2): 424-435 (2012) | |
| j21 | Kristóf Bérczi, Yusuke Kobayashi: An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. J. Comb. Theory, Ser. B 102(3): 565-587 (2012) | |
| j20 | Yusuke Kobayashi, Jácint Szabó, Kenjiro Takazawa: A proof of Cunningham's conjecture on restricted subgraphs and jump systems. J. Comb. Theory, Ser. B 102(4): 948-966 (2012) | |
| j19 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory, Ser. B 102(4): 1020-1034 (2012) | |
| j18 | Yusuke Kobayashi, Kazuo Murota, Robert Weismantel: Cone superadditivity of discrete convex functions. Math. Program. 135(1-2): 25-44 (2012) | |
| j17 | Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura: The complexity of the node capacitated in-tree packing problem. Networks 59(1): 13-21 (2012) | |
| j16 | Yusuke Kobayashi, Yuichi Yoshida: Algorithms for Finding a Maximum Non-k-Linked Graph. SIAM J. Discrete Math. 26(2): 591-604 (2012) | |
| j15 | Yuichi Yoshida, Yusuke Kobayashi: Testing the (s, t)-disconnectivity of graphs and digraphs. Theor. Comput. Sci. 434: 98-113 (2012) | |
| c18 | Akitoshi Kawamura, Yusuke Kobayashi: Fence Patrolling by Mobile Agents with Distinct Speeds. ISAAC 2012: 598-608 | |
| c17 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: List-coloring graphs without subdivisions and without immersions. SODA 2012: 1425-1435 | |
| c16 | Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi: Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. SODA 2012: 1726-1736 | |
| c15 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: Edge-disjoint Odd Cycles in 4-edge-connected Graphs. STACS 2012: 206-217 | |
| c14 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. STACS 2012: 278-289 | |
| 2011 | ||
| j14 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: An Improved Algorithm for the Half-Disjoint Paths Problem. SIAM J. Discrete Math. 25(3): 1322-1330 (2011) | |
| c13 | Yusuke Kobayashi, Yuichi Yoshida: Algorithms for Finding a Maximum Non-k-linked Graph. ESA 2011: 131-142 | |
| c12 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. STOC 2011: 81-88 | |
| 2010 | ||
| j13 | Satoru Iwata, Yusuke Kobayashi: An Algorithm for Minimum Cost Arc-Connectivity Orientations. Algorithmica 56(4): 437-447 (2010) | |
| j12 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: Algorithms for finding an induced cycle in planar graphs. Combinatorica 30(6): 715-734 (2010) | |
| j11 | Yusuke Kobayashi: A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs. Discrete Optimization 7(4): 197-202 (2010) | |
| j10 | Yusuke Kobayashi, Christian Sommer: On shortest disjoint paths in planar graphs. Discrete Optimization 7(4): 234-245 (2010) | |
| j9 | Yusuke Kobayashi, Kuniyuki Kakushima, Parhat Ahmet, V. Ramgopal Rao, Kazuo Tsutsui, Hiroshi Iwai: Analysis of dependence of short-channel effects in double-gate MOSFETs on channel thickness. Microelectronics Reliability 50(3): 332-337 (2010) | |
| c11 | Yusuke Kobayashi, Satoru Izumi, Hideyuki Takahashi, Takuo Suganuma, Tetsuo Kinoshita, Norio Shiratori: An effective acquisition scheme of sensor data in sensor network for healthcare support. IEEE ICCI 2010: 611-618 | |
| c10 | Satoru Izumi, Yusuke Kobayashi, Hideyuki Takahashi, Takuo Suganuma, Tetsuo Kinoshita, Norio Shiratori: A knowledge filtering scheme using sensor data for symbiotic healthcare support system. IEEE ICCI 2010: 619-624 | |
| c9 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs. APPROX-RANDOM 2010: 274-286 | |
| c8 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: Improved Algorithm for the Half-Disjoint Paths Problem. APPROX-RANDOM 2010: 287-297 | |
| c7 | Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino: Robust Matchings and Matroid Intersections. ESA (2) 2010: 123-134 | |
| c6 | Satoru Izumi, Yusuke Kobayashi, Hideyuki Takahashi, Takuo Suganuma, Tetsuo Kinoshita, Norio Shiratori: An Effective Inference Method Using Sensor Data for Symbiotic Healthcare Support System. ICCSA (4) 2010: 152-163 | |
| c5 | Ken-ichi Kawarabayashi, Yusuke Kobayashi: The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. SODA 2010: 345-353 | |
| 2009 | ||
| j8 | Yusuke Kobayashi: Induced disjoint paths problem in a planar digraph. Discrete Applied Mathematics 157(15): 3231-3238 (2009) | |
| j7 | Yusuke Kobayashi, Kenjiro Takazawa: Even factors, jump systems, and discrete convexity. J. Comb. Theory, Ser. B 99(1): 139-161 (2009) | |
| c4 | Tomoya Kubo, Yusuke Kobayashi, Ahmad Athif Mohd Faudzi, Koichi Suzumori: Development of Active 80-faced Polyhedron for haptic physical human-machine interface. IROS 2009: 1259-1264 | |
| c3 | Yusuke Kobayashi, Christian Sommer: On Shortest Disjoint Paths in Planar Graphs. ISAAC 2009: 293-302 | |
| c2 | Yusuke Kobayashi, Ken-ichi Kawarabayashi: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA 2009: 1146-1155 | |
| 2008 | ||
| j6 | Qiang Yu, Tadahiro Shibutani, Do-Seop Kim, Yusuke Kobayashi, Jidong Yang, Masaki Shiratori: Effect of process-induced voids on isothermal fatigue resistance of CSP lead-free solder joints. Microelectronics Reliability 48(3): 431-437 (2008) | |
| c1 | ||
| 2007 | ||
| j5 | Yusuke Kobayashi, Kazuo Murota: Induction of M-convex functions by linking systems. Discrete Applied Mathematics 155(11): 1471-1480 (2007) | |
| j4 | Yusuke Kobayashi, C. Raghunathan Manoj, Kazuo Tsutsui, Venkanarayan Hariharan, Kuniyuki Kakushima, V. Ramgopal Rao, Parhat Ahmet, Hiroshi Iwai: Parasitic Effects in Multi-Gate MOSFETs. IEICE Transactions 90-C(10): 2051-2056 (2007) | |
| j3 | Yusuke Kobayashi, Kazuo Murota, Kenichiro Tanaka: Operations on M-Convex Functions on Jump Systems. SIAM J. Discrete Math. 21(1): 107-129 (2007) | |
| 2004 | ||
| j2 | Kentaro Sano, Yusuke Kobayashi, Tadao Nakamura: Differential coding scheme for efficient parallel image composition on a PC cluster system. Parallel Computing 30(2): 285-299 (2004) | |
| 2003 | ||
| j1 | Kazuharu Arakawa, Koya Mori, Katsuhiko Ikeda, Tatekimi Matsuzaki, Yusuke Kobayashi, Masaru Tomita: G-language Genome Analysis Environment: a workbench for nucleotide sequence data mining. Bioinformatics 19(2): 305-306 (2003) | |
Colors in the list of coauthors
Last update Fri May 24 02:20:36 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page