default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYusuke Kobayashi 0001
- > Home > Persons > Yusuke Kobayashi 0001
Publications
- 2020
[j47]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. J. Comb. Theory B 141: 165-180 (2020)- 2018
- [j38]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. SIAM J. Comput. 47(4): 1483-1504 (2018) - 2017
- [j34]Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. SIAM J. Discret. Math. 31(2): 766-782 (2017) - 2016
- [j30]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Edge-disjoint odd cycles in 4-edge-connected graphs. J. Comb. Theory B 119: 12-27 (2016) - [j28]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. ACM Trans. Algorithms 13(1): 5:1-5:17 (2016) - 2015
- [j27]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. Comb. 35(4): 477-495 (2015) - 2014
- [c16]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer:
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. STOC 2014: 70-78 - 2013
- [j20]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Trans. Algorithms 9(2): 16:1-16:13 (2013) - [c15]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. FOCS 2013: 187-196 - 2012
- [j18]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) - [j17]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed:
The disjoint paths problem in quadratic time. J. Comb. Theory B 102(2): 424-435 (2012) - [j14]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory B 102(4): 1020-1034 (2012) - [c13]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
List-coloring graphs without subdivisions and without immersions. SODA 2012: 1425-1435 - [c12]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 - [c11]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Edge-disjoint Odd Cycles in 4-edge-connected Graphs. STACS 2012: 206-217 - [c10]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
- [j9]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An Improved Algorithm for the Half-Disjoint Paths Problem. SIAM J. Discret. Math. 25(3): 1322-1330 (2011) - [c8]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
- [j7]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Algorithms for finding an induced cycle in planar graphs. Comb. 30(6): 715-734 (2010) - [c7]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 - [c6]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Improved Algorithm for the Half-Disjoint Paths Problem. APPROX-RANDOM 2010: 287-297 - [c4]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. SODA 2010: 345-353 - 2009
- [c2]Yusuke Kobayashi, Ken-ichi Kawarabayashi:
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA 2009: 1146-1155 - 2008
- [c1]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The Induced Disjoint Paths Problem. IPCO 2008: 47-61
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-09-25 01:36 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:
