- Ken-ichi
Kawarabayashi (****anese: 河原林 健一, born 1975) is a ****anese
graph theorist who
works as a
professor at the
National Institute of
Informatics and...
- {\displaystyle H} . The
running time has been
improved to
quadratic by
Kawarabayashi, Kobayashi, and Reed. As a result, for
every minor-closed
family F {\displaystyle...
- Neil
Robertson and Paul Seymour. Its
proof is very long and involved.
Kawarabayashi &
Mohar (2007) and Lovász (2006) are
surveys accessible to nonspecialists...
- 3 , 5 {\displaystyle K_{3,5}}
minor was
shown by Ken-ichi
Kawarabayashi, and
Kawarabayashi & Toft (2005)
proved the
existence of
either a K 7 {\displaystyle...
- of
Computer Science,
University of Copenhagen, Copenhagen,
Denmark Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed,
Bruce (2012). "The
disjoint paths...
- PMID 1800950. S2CID 36706540. Itoh C,
Watanabe M,
Nagamatsu A,
Soeda S,
Kawarabayashi T,
Shimeno H (January 1997). "Two
molecular species of
oxytocinase (L-cystine...
- he was co-winner of the
Fulkerson Prize for his work with Ken-Ichi
Kawarabayashi on fast
deterministic algorithms for edge connectivity.
Scholia has...
- [cs.LG]. Xu, Keyulu; Li, Chengtao; Tian, Yonglong; Sonobe, Tomohiro;
Kawarabayashi, Ken-ichi; Jegelka,
Stefanie (2018). "Representation
Learning on Graphs...
- de
Mendez (2012). Nešetřil &
Ossona de
Mendez (2012), pp. 319–321.
Kawarabayashi, Ken-ichi; Reed, Bruce; Wollan, Paul (2011), "The
graph minor algorithm...
- Xi Chen for
Complexity of
Counting CSP with
Complex Weights Ken-Ichi
Kawarabayashi and
Mikkel Thorup for
Deterministic Edge
Connectivity in Near-Linear...
