Publications of K. Kawarabayashi
BACK TO COATI PUBLICATION INDEXPublications of K. Kawarabayashi
| Articles in journal or book's chapters |
-
K. Kawarabayashi,
O. Lee,
and B. Reed.
Removable cycles in non-bipartite graphs.
Journal of Combinatorial Theory Ser. B,
99:30--38,
2009.
[WWW
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
Highly parity linked graphs.
Combinatorica,
29:215--225,
2009.
[WWW
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi,
O. Lee,
B. Reed,
and P. Wollan.
A weaker version of Lovasz' path removable conjecture.
Journal of Combinatorial Theory (Series B),
98:972-979,
2008.
[bibtex-entry]
-
K. Kawarabayashi and B. Reed.
Fractional coloring and the odd Hadwiger's conjecture.
European Journal of Combinatorics,
29(2):411-417,
2008.
[Abstract] [bibtex-entry]
| Conference's articles |
-
K. Kawarabayashi and B. Reed.
Hadwiger's Conjecture is decidable.
In 41th ACM Symposium on Theory of Computing (STOC 2009),
pages 445--454,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
A nearly linear time algorithm for the half integral parity disjoint paths packing problem.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2009),
pages 1183--1192,
January 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
A nearly linear time algorithm for the half integral disjoint paths packing.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008),
pages 446-454,
2008.
[PDF
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
Computing crossing number in linear time..
In 39th ACM Symposium on Theory of Computing (STOC 2007),
San Diego, CA, USA,
pages 382-390,
June 2007.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:45 2022