Ken-ichi Kawarabayashi

Ken-ichi Kawarabayashi's AcademicInfluence.com Rankings

Mathematics

#4530

World Rank

#6418

Historical Rank

Measure Theory

#1630

World Rank

#2011

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Ken-ichi Kawarabayashi's Degrees

PhD Mathematics University of Tokyo

Why Is Ken-ichi Kawarabayashi Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ken-ichi Kawarabayashi is a Japanese graph theorist who works as a professor at the National Institute of Informatics and is known for his research on graph theory and graph algorithms. Kawarabayashi was born on May 22, 1975, in Tokyo. He earned a bachelor's degree in mathematics from Keio University in 1998, a master's degree from Keio in 2000, and a PhD from Keio in 2001, researching the Lovász–Woodall conjecture under the supervision of Katsuhiro Ota. After temporary positions at Vanderbilt University and under the supervision of Paul Seymour at Princeton University, he became an assistant professor at Tohoku University in 2003, and moved to the National Institute of Informatics in 2006.

(See a Problem?)

Ken-ichi Kawarabayashi's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Representation Learning on Graphs with Jumping Knowledge Networks (2018) (1191)
Graph Minors (2009) (1168)
A coherent Ising machine for 2000-node optimization problems (2016) (441)
Algorithmic graph minor theory: Decomposition, approximation, and coloring (2005) (208)
Experimental investigation of performance differences between coherent Ising machines and a quantum annealer (2018) (192)
The η problem in the large-N limit: Effective Lagrangian approach (1980) (190)
The disjoint paths problem in quadratic time (2012) (185)
How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks (2020) (180)
What Can Neural Networks Reason About? (2019) (156)
Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations (2014) (144)
Coherent Ising machines—optical neural networks operating at the quantum limit (2017) (138)
Finding topological subgraphs is fixed-parameter tractable (2010) (121)
Computing crossing number in linear time (2007) (108)
Estimating Local Intrinsic Dimensionality (2015) (106)
Scalable similarity search for SimRank (2014) (97)
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm (2014) (95)
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width (2008) (78)
Shortest-path queries for complex networks: exploiting low tree-width outside the core (2012) (77)
On the Partical Conservation of the U(1) Current (1981) (77)
A Separator Theorem in Minor-Closed Classes (2010) (75)
Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling (2014) (74)
Unsupervised Cross-Domain Word Representation Learning (2015) (71)
Dynamic Influence Analysis in Evolving Networks (2016) (68)
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (2011) (67)
A shorter proof of the graph minor algorithm: the unique linkage theorem (2010) (65)
Computing Personalized PageRank Quickly by Exploiting Graph Structures (2014) (64)
Packing cycles through prescribed vertices (2011) (63)
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (2014) (61)
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable (2011) (60)
Joint Word Representation Learning Using a Corpus and a Semantic Lexicon (2015) (60)
On Sufficient Degree Conditions for a Graph to be $k$-linked (2006) (60)
Some Recent Progress and Applications in Graph Minor Theory (2007) (60)
Contraction decomposition in h-minor-free graphs and algorithmic applications (2011) (57)
Efficient PageRank Tracking in Evolving Networks (2015) (56)
100,000-spin coherent Ising machine (2021) (54)
Any 7-Chromatic Graphs Has K7 Or K4,4 As A Minor (2005) (52)
Linear connectivity forces large complete bipartite minors (2009) (51)
Detecting even holes (2005) (51)
Planarity Allowing Few Error Vertices in Linear Time (2009) (48)
Deterministic Edge Connectivity in Near-Linear Time (2014) (48)
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid (2012) (47)
Graph and map isomorphism and all polyhedral embeddings in linear time (2008) (45)
A relaxed Hadwiger's Conjecture for list colorings (2007) (44)
The Directed Grid Theorem (2014) (42)
An (almost) linear time algorithm for odd cycles transversal (2010) (41)
Are Girls Neko or Shōjo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalization (2019) (41)
Three-coloring triangle-free planar graphs in linear time (2009) (40)
Reply trees in Twitter: data analysis and branching process models (2016) (40)
Think Globally, Embed Locally - Locally Linear Meta-embedding of Words (2017) (39)
Expected Tensor Decomposition with Stochastic Gradient Descent (2016) (38)
Binary optimization by momentum annealing. (2019) (37)
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory (2013) (37)
A Coherent Ising Machine for MAX-CUT Problems: Performance Evaluation against Semidefinite Programming and Simulated Annealing (2015) (36)
A pair of forbidden subgraphs and perfect matchings (2006) (35)
A simpler algorithm and shorter proof for the graph minor decomposition (2011) (35)
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction (2009) (35)
Locally planar graphs are 5-choosable (2008) (34)
Immersing small complete graphs (2010) (33)
Path factors in cubic graphs (2002) (33)
Non-zero disjoint cycles in highly connected group labelled graphs (2006) (33)
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture (2005) (32)
Intrinsic Dimensionality Estimation within Tight Localities (2019) (31)
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem (2012) (31)
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs (2009) (30)
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing (2012) (30)
Contractible Edges and Triangles in k-Connected Graphs (2002) (29)
K 4 - -factor in a graph (2002) (29)
More Compact Oracles for Approximate Distances in Undirected Planar Graphs (2013) (29)
Extreme-value-theoretic estimation of local intrinsic dimensionality (2018) (29)
Highly parity linked graphs (2009) (28)
Real-Time Top-R Topic Detection on Twitter with Topic Hijack Filtering (2015) (28)
Odd cycle packing (2010) (28)
A weaker version of Lovász' path removal conjecture (2008) (27)
Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks (2016) (27)
Jointly learning word embeddings using a corpus and a knowledge base (2018) (27)
The Graph Minor Algorithm with Parity Conditions (2011) (27)
Uncertain behaviours of integrated circuits improve computational performance (2015) (27)
Some remarks on the odd hadwiger’s conjecture (2007) (27)
Path factors in claw-free graphs (2002) (26)
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture (2007) (26)
Decomposition, approximation, and coloring of odd-minor-free graphs (2010) (26)
Coarsening Massive Influence Networks for Scalable Diffusion Analysis (2017) (26)
Embedding and canonizing graphs of bounded genus in logspace (2014) (26)
Embedding Semantic Relations into Word Representations (2015) (25)
The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (2007) (24)
A new proof of the flat wall theorem (2012) (24)
Scaling advantages of all-to-all connectivity in physical annealers: the Coherent Ising Machine vs. D-Wave 2000Q (2018) (24)
The Induced Disjoint Paths Problem (2008) (24)
Non-Separating Paths in 4-Connected Graphs (2005) (23)
Hadwiger's conjecture is decidable (2009) (23)
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs (2006) (23)
Independence number and clique minors (2007) (22)
Combinatorial Coloring of 3-Colorable Graphs (2012) (22)
Note on k-contractible edges in k-connected graphs (2001) (21)
Coloring 3-Colorable Graphs with Less than n1/5 Colors (2017) (21)
Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements (2010) (21)
Vertices of Degree 5 in a Contraction Critically 5-connected Graph (2005) (21)
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (2010) (21)
Learning Word Representations from Relational Graphs (2014) (21)
On the excluded minor structure theorem for graphs of large tree-width (2009) (20)
Packing six T-joins in plane graphs (2010) (20)
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction (2006) (20)
A nearly linear time algorithm for the half integral disjoint paths packing (2008) (20)
Connectivity keeping edges in graphs with large minimum degree (2008) (20)
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (2014) (20)
Yukawa couplings in meson-soliton scattering (1989) (19)
Scalable SimRank join algorithm (2015) (19)
The Erdős-Pósa property for clique minors in highly connected graphs (2010) (19)
Double-Critical Graphs and Complete Minors (2008) (19)
Message Duplication Reduction in Dense Mobile Social Networks (2010) (19)
N-Flips in even triangulations on surfaces (2008) (19)
On the matching extendability of graphs in surfaces (2008) (19)
Edge-disjoint odd cycles in 4-edge-connected graphs (2012) (19)
Note on coloring graphs without odd-Kk-minors (2009) (18)
A Weakening of the Odd Hadwiger's Conjecture (2008) (18)
An Improved Algorithm for Finding Cycles Through Elements (2008) (18)
Efficient SimRank Computation via Linearization (2014) (18)
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (2009) (18)
Causal Bandits with Propagating Inference (2018) (18)
Domination in a graph with a 2‐factor (2006) (18)
Covering vertices of a graph by k disjoint cycles (2003) (17)
Maximizing Time-Decaying Influence in Social Networks (2016) (17)
Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View (2015) (17)
6-Critical Graphs on the Klein Bottle (2008) (17)
Packing Directed Circuits through Prescribed Vertices Bounded Fractionally (2012) (17)
On two equimatchable graph classes (2003) (17)
One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture (2002) (17)
A simpler proof for the two disjoint odd cycles theorem (2013) (16)
A linear time algorithm for the induced disjoint paths problem in planar graphs (2012) (16)
The Erdos-Posa Property for Directed Graphs (2016) (16)
Subgraphs of graphs on surfaces with high representativity (2003) (16)
Some forbidden subgraph conditions for a graph to have a k-contractible edge (2003) (16)
Adapting Local Sequential Algorithms to the Distributed Setting (2018) (16)
Delay and Cooperation in Nonstochastic Linear Bandits (2020) (15)
Rooted minor problems in highly connected graphs (2004) (15)
Half-integral packing of odd cycles through prescribed vertices (2013) (15)
Packing directed cycles through a specified vertex set (2013) (15)
Decomposing a planar graph of girth 5 into an independent set and a forest (2009) (15)
A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (2011) (14)
From the plane to higher surfaces (2012) (14)
A Polynomial Excluded-Minor Approximation of Treedepth (2018) (14)
Star Coloring and Acyclic Coloring of Locally Planar Graphs (2010) (14)
Choosability of planar graphs of girth 5 (2011) (14)
FO Model Checking on Map Graphs (2017) (14)
Minimum degree conditions for vertex-disjoint even cycles in large graphs (2014) (14)
An Excluded Grid Theorem for Digraphs with Forbidden Minors (2014) (14)
Adaptive Budget Allocation for Maximizing Influence of Advertisements (2016) (14)
A theorem on paths in locally planar triangulations (2004) (14)
Graph Isomorphism for Bounded Genus Graphs In Linear Time (2015) (14)
Polylogarithmic Approximation for Minimum Planarization (Almost) (2017) (13)
ClassiNet -- Predicting Missing Features for Short-Text Classification (2018) (13)
4-connected projective-planar graphs are Hamiltonian-connected (2013) (13)
List-color-critical graphs on a fixed surface (2009) (13)
Orientable and Nonorientable Genera for Some Complete Tripartite Graphs (2005) (13)
Edge-colouring seven-regular planar graphs (2012) (12)
List-coloring embedded graphs (2012) (12)
Graph minors and linkages (2005) (12)
Parameterized Distributed Algorithms (2018) (12)
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs (2013) (12)
A nearly linear time algorithm for the half integral parity disjoint paths packing problem (2009) (12)
Contractible Edges and Bowties in a k-Connected Graph (2002) (12)
Bounding the Size of Equimatchable Graphs of Fixed Genus (2009) (12)
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two (2011) (12)
NoSingles: a space-efficient algorithm for influence maximization (2018) (12)
Beyond the Euler Characteristic: Approximating the Genus of General Graphs (2014) (11)
Coloring 3-colorable graphs with o(n^{1/5}) colors (2014) (11)
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (2013) (11)
The 2-extendability of 5-connected graphs on surfaces with large representativity (2011) (11)
The Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling (2011) (11)
Algorithms for finding an induced cycle in planar graphs (2010) (11)
Lagrangian Decomposition Algorithm for Allocating Marketing Channels (2015) (11)
A new scheme of ηand η′ mixing and violations of the OZI rule (1976) (11)
Scheduling Bipartite Tournaments to Minimize Total Travel Distance (2011) (11)
Learning linear transformations between counting-based and prediction-based word embeddings (2017) (11)
Using $k$-way Co-occurrences for Learning Word Embeddings (2017) (11)
Solving the Traveling Tournament Problem by Packing Three-Vertex Paths (2014) (11)
Dominating sets in triangulations on surfaces (2010) (11)
A Survey on Hamiltonian Cycles (2001) (11)
Improved upper bounds on the crossing number (2008) (11)
F-factor and Vertex-disjoint F in a graph (2002) (10)
Cycles through a prescribed vertex set in N-connected graphs (2004) (10)
The Directed Flat Wall Theorem (2020) (10)
Chords of longest circuits in locally planar graphs (2007) (10)
Hamiltonian cycles in n‐extendable graphs (2002) (10)
A nearly 5/3-approximation FPT Algorithm for Min-k-Cut (2020) (10)
K6-Minors in Triangulations on the Klein Bottle (2008) (10)
The edge density of critical digraphs (2015) (10)
Quickly excluding a non-planar graph (2020) (9)
Extremal results for rooted minor problems (2007) (9)
Optimal Distributed Covering Algorithms (2019) (9)
Fixed-parameter tractability for subset feedback set problems with parity constraints (2015) (9)
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint (2018) (9)
5-Connected Toroidal Graphs are Hamiltonian-Connected (2016) (9)
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] (2009) (9)
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds (2018) (9)
K6 minors in large 6-connected graphs (2012) (9)
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs (2016) (9)
Hamilton cycles in 4-connected troidal triangulations (2011) (8)
The Multi-Round Balanced Traveling Tournament Problem (2011) (8)
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits (2021) (8)
Improved Distributed Approximation to Maximum Independent Set (2019) (8)
Contractible edges in minimally k-connected graphs (2002) (8)
Vertices of degree 6 in a contraction critically 6-connected graph (2003) (8)
Enhanced Estimation of Local Intrinsic Dimensionality Using Auxiliary Distances (2016) (8)
Linkless and flat embeddings in 3-space and the unknot problem (2010) (8)
An iterative approach for the global estimation of sentence similarity (2017) (8)
K‐linked graphs with girth condition (2004) (7)
An Improved Algorithm for the Half-Disjoint Paths Problem (2011) (7)
On the number of 4-contractible edges in 4-connected graphs (2009) (7)
K_6 minors in 6-connected graphs of bounded tree-width (2012) (7)
K 3 , k-minors in large 7-connected graphs (2006) (7)
Existence of two disjoint long cycles in graphs (2005) (7)
A model of baryons based on duality and unitarity (1977) (7)
Packing cycles through prescribed vertices under modularity constraints (2012) (7)
List-coloring graphs without subdivisions and without immersions (2012) (7)
Mining for Analogous Tuples from an Entity-Relation Graph (2013) (7)
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback (2019) (7)
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (2013) (7)
Testing subdivision-freeness: property testing meets structural graph theory (2013) (6)
A simple algorithm for 4-coloring 3-colorable planar graphs (2010) (6)
An Approximation Algorithm for the Bipartite Traveling Tournament Problem (2013) (6)
Additive approximation algorithms for list-coloring minor-closed class of graphs (2009) (6)
Vertex-disjoint cycles containing specified edges in a bipartite graph (2001) (6)
Efficient SimRank computation via linearizationPublication of this article pending inquiry (2014) (6)
Optimal Pricing for Submodular Valuations with Bounded Curvature (2016) (6)
Fractional coloring and the odd Hadwiger's conjecture (2008) (6)
On the structure of k-connected graphs without Kk-minor (2005) (6)
2-Connected spanning subgraphs with low maximum degree in locally planar graphs (2007) (6)
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation (2012) (6)
Half integral packing, Erdős-Posá-property and graph minors (2007) (6)
An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs (2010) (6)
Trajectory Mixing Scheme for the η and η′ Mesons (1976) (5)
Long cycles in graphs without hamiltonian paths (2008) (5)
2‐ and 3‐factors of graphs on surfaces (2011) (5)
Spanning closed walks and TSP in 3-connected planar graphs (2012) (5)
Hamiltonian cycles in n-factor-critical graphs (2001) (5)
Chvátal Erdós condition and 2-factors with a specyfied number of components (2007) (5)
Toughness of Ka,t-Minor-Free Graphs (2011) (5)
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor (2020) (5)
Non-separating subgraphs after deleting many disjoint paths (2011) (5)
K-linked graphs with girth condition (2004) (5)
Vertex‐disjoint cycles containing specified vertices in a bipartite graph (2004) (5)
Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling (2017) (5)
Subdivisions of K5 in graphs containing K2, 3 (2015) (5)
A coherent Ising machine with quantum measurement and feedback control (2015) (5)
Graph partition into paths containing specified vertices (2002) (5)
Hamiltonian cycles in n-extendable graphs (2002) (5)
Non-zero disjoint cycles in highly connected group labeled graphs (2005) (5)
The Linear Distance Traveling Tournament Problem (2012) (5)
Linkless and Flat Embeddings in 3-Space (2012) (5)
Polynomial Planar Directed Grid Theorem (2019) (5)
2‐connected 7‐coverings of 3‐connected graphs on surfaces (2003) (5)
Coherent Ising machines—optical neural networks operating at the quantum limit (2017) (5)
Improved Regret Bounds for Bandit Combinatorial Optimization (2019) (4)
Flavour and spin structure of linear baryons (1979) (4)
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation (2017) (4)
K4−‐factor in a graph (2002) (4)
RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding (2021) (4)
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds (2018) (4)
Domination in a graph with a 2-factor (2006) (4)
Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable (2017) (4)
Vertex-disjoint copies of K4- (2004) (4)
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces (2017) (4)
Cliques in Odd-Minor-Free Graphs (2011) (4)
Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture (2013) (4)
Non-separating even cycles in highly connected graphs (2010) (4)
List-coloring graphs without K4, k-minors (2009) (4)
The canonical directed tree decomposition and its applications to the directed disjoint paths problem (2020) (4)
Publisher's Note: Linear connectivity forces large complete bipartite minors (2009) (3)
Polylogarithmic approximation for Euler genus on bounded degree graphs (2019) (3)
Stochastic Submodular Maximization with Performance-Dependent Item Costs (2019) (3)
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization (2017) (3)
Publisher Correction: Coherent Ising machines—optical neural networks operating at the quantum limit (2018) (3)
Removable cycles in non-bipartite graphs (2009) (3)
The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (2018) (3)
Towards the Graph Minor Theorems for Directed Graphs (2015) (3)
Minimally contraction-critically 6-connected graphs (2012) (3)
MINORS IN LARGE 6-CONNECTED GRAPHS (2018) (3)
2-connected 7-coverings of 3-connected graphs on surfaces (2003) (3)
Model-Checking on Ordered Structures (2018) (3)
Directed Tangle Tree-Decompositions and Applications (2022) (3)
Linkages in Large Graphs of Bounded Tree-Width (2014) (3)
Online Regression with Partial Information: Generalization and Linear Projection (2018) (3)
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs (2002) (3)
Approximating List-Coloring on a Fixed Surface (2008) (3)
The Disjoint Paths Problem: Algorithm and Structure (2011) (3)
Totally odd subdivisions and parity subdivisions: Structures and Coloring (2013) (3)
Acute triangles in 4-connected maximal plane graphs (2005) (3)
A unified half-integral Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups (2021) (2)
Sub-exponential graph coloring algorithm for stencil-based Jacobian computations (2014) (2)
Additive non-approximability of chromatic number in proper minor-closed classes (2017) (2)
THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS (2007) (2)
Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time (2015) (2)
Network structural analysis via core-tree-decomposition Publication of this article pending inquiry (2014) (2)
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree (2013) (2)
On a hamiltonian cycle in which specified vertices are not isolated (2002) (2)
Isomorphisms of maps on the sphere (2021) (2)
On separable self-complementary graphs (2002) (2)
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class (2018) (2)
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (2014) (2)
Identifying Key Observers to Find Popular Information in Advance (2016) (2)
Graph theory and sports chedulling (2013) (2)
Rooted topological minors on four vertices (2021) (2)
THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS (2007) (2)
Improved Algorithm for the Half-Disjoint Paths Problem (2010) (2)
Graph Theory and Sports Scheduling (2013) (2)
Note on non-separating and removable cycles in highly connected graphs (2009) (2)
Contractible Triples in Highly Connected Graphs (2010) (1)
Embeddings of Planar Quasimetrics into Directed ℓ1 and Polylogarithmic Approximation for Directed Sparsest-Cut (2021) (1)
Six-Critical Graphs on the Klein Bottle (2008) (1)
Contractible elements in k‐connected graphs not containing some specified graphs (2008) (1)
Theoretical Computer Science and Discrete Mathematics (2012) (1)
A Note on Hamiltonian Cycles in (k,n)-Factor-Critical Graphs (2000) (1)
Automorphism groups of maps in linear time (2020) (1)
Dynamical relationship between baryon structure functions and baryonium trajectories (1979) (1)
Existence of outsiders as a characteristic of online communication networks (2014) (1)
Geometric Transformations in Plane Triangulations (2000) (1)
Erdocombining double acute accents-Pósa property and its algorithmic applications - Parity constraints, subset feedback set, and subset packing (2012) (1)
Combinatorial Optimization and Graph Algorithms (2017) (1)
Cycles having the same modularity and removable edges in 2-connected graphs (2003) (1)
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions (2021) (1)
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (2017) (1)
Coloring immersion-free graphs (2016) (1)
Boosting PageRank Scores by Optimizing Internal Link Structure (2018) (1)
The odd Hadwiger's conjecture is "almost" decidable (2015) (1)
Balancing the Traveling Tournament Problem for Weekday and Weekend Games (2013) (1)
The Effect of Random Projection on Local Intrinsic Dimensionality (2021) (1)
Contractible edges in k-connected graphs containing no K4− (2000) (1)
NoSingles (2018) (1)
Quantum Computing with Non-classical Light: A Coherent Ising Machine for Maximum-Cut Problems (2017) (1)
Optimal Distributed Weighted Set Cover Approximation (2018) (1)
Toughness of -minor-free graphs. (2011) (1)
Online Task Assignment Problems with Reusable Resources (2022) (1)
The NII Shonan meeting in Japan (2020) (1)
Optimal cache placement for an academic backbone network (2018) (1)
Relative Length of Longest Path and Longest Cycle (2000) (1)
A connected subgraph maintaining high connectivity (2014) (1)
CutTheTail: An Accurate and Space-Efficient Heuristic Algorithm for Influence Maximization (2020) (1)
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set (2020) (1)
The Erdös-Lovász Tihany conjecture and complete minors (2011) (1)
Minors in large almost‐5‐connected non‐planar graphs (2012) (0)
The edge density of critical digraphs (2014) (0)
A New Proof of the Weak Structure Theorem (2012) (0)
Vertex-disjoint Copies of K (2004) (0)
Scalable sensor localization via ball-decomposition algorithm (2015) (0)
A half-integral Erdős-Pósa theorem for directed odd cycles (2023) (0)
Hadwiger's conjecture (2015) (0)
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Packing Cycles through Prescribed Vertices (2010) (0)
Contractible elements in k-connected graphs not containing some specified graphs (2008) (0)
2 7 O ct 2 01 8 Deterministic Edge Connectivity in Near-Linear Time ∗ (2018) (0)
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising (2019) (0)
Algorithm Aspect of Graph Minor Theory (2004) (0)
Extreme-value-theoretic estimation of local intrinsic dimensionality (2018) (0)
Publisher Correction: Coherent Ising machines—optical neural networks operating at the quantum limit (2018) (0)
Progress on Lovasz' Path Removal Conjecture (2005) (0)
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two (2016) (0)
Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1) (2011) (0)
Removable paths and cycles with parity constraints (2014) (0)
Some Recent Progress for Approximation Algorithms (2016) (0)
Query Obfuscation by Semantic Decomposition (2019) (0)
Vertices of degree 6 in a 6-contraction critical graph (2001) (0)
Triangle-free graphs of tree-width t are ceil((t + 3)/2)-colorable (2017) (0)
Automorphisms and Isomorphisms of Maps in Linear Time (2021) (0)
Disjoint Even Cycles Packing (2009) (0)
Trajectory Mixing Scheme for the 7J and 71' Mesons (2004) (0)
On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs (2004) (0)
Half integral packing, Erdaodblac;s-Posá-property and graph minors. (2007) (0)
5-coloring K3, k-minor-free graphs: Beyond Thomassen (2013) (0)
5-coloring K 3, k -minor-free graphs (2013) (0)
Wandering in the Fields: Festschrift for Professor Kazuhiko Nishijima on the Occasion of His Sixtieth Birthday (1987) (0)
An immersion of a square in 4-edge-connected graphs (2012) (0)
Half-integral packing of odd cycles through prescribed vertices (2013) (0)
LINKLESS AND FLAT EMBEDDINGS IN 3-SPACE IN QUADRATIC TIME (2009) (0)
Ip2 on Sidorenko's Conjecture Ip3 Forcing Large Transitive Subtournamets Ip5 Coloring 3-colorable Graphs; Graph Theory Fi- Nally Strikes Back! (0)
Some results concerning non-separating subgraphs in k-connected graphs (2008) (0)
A Linear Time Algorithm for the Induced Disjoint Paths Problem in (2008) (0)
Contractible Small Subgraphs in k-connected Graphs (2010) (0)
Anonymising Queries by Semantic Decomposition (2019) (0)
Iowa State University From the SelectedWorks of Bernard Lidicky 2009 6-critical graphs on the Klein bottle (2016) (0)
High connectivity keeping connected subgraph (2011) (0)
Overview of Talks Properties of sparse graphs (2011) (0)
Intrinsic Dimensionality Estimation within Tight Localities: A Theoretical and Experimental Analysis (2022) (0)
Structures of Information Processing Hidden in Games (0)
D C ] 1 7 A ug 2 01 8 Optimal Distributed Weighted Set Cover Approximation (2018) (0)
D C ] 2 3 M ay 2 01 8 A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O ( log n log ∆ / log 2 log ∆ ) Rounds (2018) (0)
YUKAWA COUPLINGS AND THE NATURE OF ZERO MODES IN THE SKYRME MODEL (1989) (0)
A note on traversing specified vertices in graphs embedded with large representativity (2010) (0)
Reply trees in Twitter: data analysis and branching process models (2016) (0)
Six-Critical Graphs on the Klein bottle Extended Abstract (2007) (0)
C O ] 8 F eb 2 01 2 Cliques in Odd-Minor-Free Graphs ∗ (2012) (0)
A half-integral Erd\H{o}s-P\'osa theorem for directed odd cycles (2020) (0)
Half-integral Erd\H{o}s-P\'osa property of directed odd cycles (2020) (0)
Recognizing a totally odd K 4-subdivision , parity 2-disjoint rooted paths and a parity cycle through specified elements ( extended abstract ) ∗ (2009) (0)
Linkless and Flat Embeddings in 3-Space (2012) (0)
Minimum Violation Vertex Maps and Their Applications to Cut Problems (2020) (0)
Non-separating subgraphs in highly connected graphs (2016) (0)

This paper list is powered by the following services:

Other Resources About Ken-ichi Kawarabayashi

en.wikipedia.org

What Schools Are Affiliated With Ken-ichi Kawarabayashi?

Ken-ichi Kawarabayashi is affiliated with the following schools:

Ken-ichi Kawarabayashi's Academic­Influence.com Rankings