The SCEAS System
| |||||||

## Search the dblp DataBase
Ken-ichi Kawarabayashi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
**Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:637-646 [Conf] - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
**Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:3-15 [Conf] - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe
**Geometric Transformations in Plane Triangulations.**[Citation Graph (0, 0)][DBLP] JCDCG, 2000, pp:217-221 [Conf] - Ken-ichi Kawarabayashi, Bojan Mohar
**Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:401-416 [Conf] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto
**Contractible Edges and Bowties in a k-Connected Graph.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:64, n:, pp:239-0 [Journal] - Ken-ichi Kawarabayashi
**F-factor and Vertex-disjoint F in a graph.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:62, n:, pp:- [Journal] - Ken-ichi Kawarabayashi, Bjarne Toft
**Any 7-Chromatic Graphs Has**[Citation Graph (0, 0)][DBLP]*K*_{7}Or*K*_{4, 4}As A Minor. Combinatorica, 2005, v:25, n:3, pp:327-353 [Journal] - Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
**Path factors in claw-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:195-200 [Journal] - Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito
**Cycles having the same modularity and removable edges in 2-connected graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:265, n:1-3, pp:23-30 [Journal] - Kiyoshi Ando, Ken-ichi Kawarabayashi
**Some forbidden subgraph conditions for a graph to have a**[Citation Graph (0, 0)][DBLP]*k*-contractible edge. Discrete Mathematics, 2003, v:267, n:1-3, pp:3-11 [Journal] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
**Vertices of degree 6 in a contraction critically 6-connected graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:273, n:1-3, pp:55-69 [Journal] - Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang
**Existence of two disjoint long cycles in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:305, n:1-3, pp:154-169 [Journal] - Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang
**Covering vertices of a graph by k disjoint cycles.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:270, n:1-3, pp:114-124 [Journal] - Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto
**On a hamiltonian cycle in which specified vertices are not isolated.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:258, n:1-3, pp:85-91 [Journal] - Ken-ichi Kawarabayashi
**Graph partition into paths containing specified vertices.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:248, n:1-3, pp:271-277 [Journal] - Ken-ichi Kawarabayashi
**Rooted minor problems in highly connected graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:287, n:1-3, pp:121-123 [Journal] - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe
**On separable self-complementary graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:257, n:1, pp:165-168 [Journal] - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe
**Acute triangles in 4-connected maximal plane graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:292, n:1-3, pp:95-106 [Journal] - Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito
**Hamiltonian cycles in**[Citation Graph (0, 0)][DBLP]*n*-factor-critical graphs. Discrete Mathematics, 2001, v:240, n:1-3, pp:71-82 [Journal] - Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
**On two equimatchable graph classes.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:266, n:1-3, pp:263-274 [Journal] - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto
**The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:6, pp:764-768 [Journal] - Ken-ichi Kawarabayashi
**A theorem on paths in locally planar triangulations.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2004, v:25, n:6, pp:781-784 [Journal] - Ken-ichi Kawarabayashi, Rong Luo, Jianbing Niu, Cun-Quan Zhang
**On the structure of**[Citation Graph (0, 0)][DBLP]*k*-connected graphs without*K*-minor._{k} Eur. J. Comb., 2005, v:26, n:3-4, pp:293-308 [Journal] - Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zhang
**Chords of longest circuits in locally planar graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2007, v:28, n:1, pp:315-321 [Journal] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
**Vertices of Degree 5 in a Contraction Critically 5-connected Graph.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2005, v:21, n:1, pp:27-37 [Journal] - Ken-ichi Kawarabayashi
**Contractible Edges and Triangles in k-Connected Graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:207-221 [Journal] - Ken-ichi Kawarabayashi
**One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2002, v:84, n:1, pp:1-44 [Journal] - Ken-ichi Kawarabayashi
**Cycles through a prescribed vertex set in N-connected graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:315-323 [Journal] - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota
**Subgraphs of graphs on surfaces with high representativity .**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2003, v:89, n:2, pp:207-229 [Journal] - Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft
**Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:152-167 [Journal] - Ken-ichi Kawarabayashi, Paul Wollan
**Non-zero disjoint cycles in highly connected group labelled graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:2, pp:296-301 [Journal] - Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
**A pair of forbidden subgraphs and perfect matchings.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:315-324 [Journal] - Mark N. Ellingham, Ken-ichi Kawarabayashi
**2-Connected spanning subgraphs with low maximum degree in locally planar graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:401-412 [Journal] - Ken-ichi Kawarabayashi
**On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:1, pp:144-150 [Journal] - Ken-ichi Kawarabayashi, Chris Stephens, Xiaoya Zha
**Orientable and Nonorientable Genera for Some Complete Tripartite Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:18, n:3, pp:479-487 [Journal] - Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour
**Detecting even holes.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:48, n:2, pp:85-111 [Journal] - Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
**Domination in a graph with a 2-factor.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:52, n:1, pp:1-6 [Journal] - Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
**Vertex-disjoint cycles containing specified vertices in a bipartite graph.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:46, n:3, pp:145-166 [Journal] - Ken-ichi Kawarabayashi
[Citation Graph (0, 0)][DBLP]*K*-linked graphs with girth condition. Journal of Graph Theory, 2004, v:45, n:1, pp:48-50 [Journal] - Ken-ichi Kawarabayashi
**Half integral packing, Erd&odblac;s-Posá-property and graph minors.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1187-1196 [Conf] - Ken-ichi Kawarabayashi, Buce Reed
**Computing crossing number in linear time.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:382-390 [Conf] - Ken-ichi Kawarabayashi, Bojan Mohar
**A relaxed Hadwiger's Conjecture for list colorings.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:647-651 [Journal] **An**[Citation Graph (, )][DBLP]*O*(log*n*)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs.**Improved Algorithm for the Half-Disjoint Paths Problem.**[Citation Graph (, )][DBLP]**Improved upper bounds on the crossing number.**[Citation Graph (, )][DBLP]**Linkless and flat embeddings in 3-space and the unknot problem.**[Citation Graph (, )][DBLP]**A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width.**[Citation Graph (, )][DBLP]**Planarity Allowing Few Error Vertices in Linear Time.**[Citation Graph (, )][DBLP]**Approximating List-Coloring on a Fixed Surface.**[Citation Graph (, )][DBLP]**Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.**[Citation Graph (, )][DBLP]**The Induced Disjoint Paths Problem.**[Citation Graph (, )][DBLP]**An Improved Algorithm for Finding Cycles Through Elements.**[Citation Graph (, )][DBLP]**A nearly linear time algorithm for the half integral disjoint paths packing.**[Citation Graph (, )][DBLP]**Algorithms for finding an induced cycle in planar graphs and bounded genus graphs.**[Citation Graph (, )][DBLP]**A nearly linear time algorithm for the half integral parity disjoint paths packing problem.**[Citation Graph (, )][DBLP]**List-color-critical graphs on a fixed surface.**[Citation Graph (, )][DBLP]**Additive approximation algorithms for list-coloring minor-closed class of graphs.**[Citation Graph (, )][DBLP]**Three-coloring triangle-free planar graphs in linear time.**[Citation Graph (, )][DBLP]**Recognizing a Totally Odd K**[Citation Graph (, )][DBLP]_{4}-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements.**An (almost) Linear Time Algorithm for Odd Cyles Transversal.**[Citation Graph (, )][DBLP]**The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs.**[Citation Graph (, )][DBLP]**Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs.**[Citation Graph (, )][DBLP]**Graph and map isomorphism and all polyhedral embeddings in linear time.**[Citation Graph (, )][DBLP]**Hadwiger's conjecture is decidable.**[Citation Graph (, )][DBLP]**A shorter proof of the graph minor algorithm: the unique linkage theorem.**[Citation Graph (, )][DBLP]**Odd cycle packing.**[Citation Graph (, )][DBLP]**Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.**[Citation Graph (, )][DBLP]**Highly parity linked graphs.**[Citation Graph (, )][DBLP]**Some remarks on the odd hadwiger's conjecture.**[Citation Graph (, )][DBLP]**On Sufficient Degree Conditions for a Graph to be k-linked.**[Citation Graph (, )][DBLP]**A Weakening of the Odd Hadwiger's Conjecture.**[Citation Graph (, )][DBLP]**Note on non-separating and removable cycles in highly connected graphs.**[Citation Graph (, )][DBLP]**List-coloring graphs without K**[Citation Graph (, )][DBLP]_{4, k}-minors.**Contractible edges in minimally k-connected graphs.**[Citation Graph (, )][DBLP]**Long cycles in graphs without hamiltonian paths.**[Citation Graph (, )][DBLP]**A note on traversing specified vertices in graphs embedded with large representativity.**[Citation Graph (, )][DBLP]**Fractional coloring and the odd Hadwiger's conjecture.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.009secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |