Tadashi Sakuma

According to our database1, Tadashi Sakuma authored at least 28 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Stable structure on safe set problems in vertex-weighted graphs.
Eur. J. Comb., 2021

2020
Convex Grabbing Game of the Point Set on the Plane.
Graphs Comb., 2020

Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019
On the weighted safe set problem on paths and cycles.
J. Comb. Optim., 2019

Pebble Exchange Group of Graphs.
CoRR, 2019

2018
Safe sets, network majority on weighted trees.
Networks, 2018

Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim., 2018

2017
The Expansion of a Chord Diagram and the Tutte Polynomial.
Electron. Notes Discret. Math., 2017

2016
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math., 2016

Safe set problem on graphs.
Discret. Appl. Math., 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
On the Balanced Decomposition Number.
Graphs Comb., 2015

Pebble exchange on graphs.
Discret. Appl. Math., 2015

2014
Minimum degree conditions for vertex-disjoint even cycles in large graphs.
Adv. Appl. Math., 2014

2012
Colored pebble motion on graphs.
Eur. J. Comb., 2012

On ideal minimally non-packing clutters
CoRR, 2012

2011
On circulant thin Lehman matrices.
Electron. Notes Discret. Math., 2011

N-flips in even triangulations on the torus and Dehn twists preserving monodromies.
Discret. Math., 2011

2010
The positive circuits of oriented matroids with the packing property or idealness.
Electron. Notes Discret. Math., 2010

2009
Colored Pebble Motion on Graphs (Extended Abstract).
Electron. Notes Discret. Math., 2009

Disjoint Even Cycles Packing.
Electron. Notes Discret. Math., 2009

2008
Determining the minimum rank of matroids whose basis graph is common.
Electron. Notes Discret. Math., 2008

2006
N-flips in even triangulations on the sphere.
J. Graph Theory, 2006

Grinstead's conjecture is true for graphs with a small clique number.
Discret. Math., 2006

2001
Notes on acyclic orientations and the shelling lemma.
Theor. Comput. Sci., 2001

On kernel-less clique-acyclic orientations of minimally imperfect graphs.
Discret. Appl. Math., 2001

2000
Forced color classes, intersection graphs and the strong perfect graph conjecture.
Theor. Comput. Sci., 2000

1997
A counterexample to the bold conjecture.
J. Graph Theory, 1997


  Loading...