Yoshio Okamoto
Cited by
Cited by
On problems as hard as CNF-SAT
M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ...
ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016
Swapping labeled tokens on graphs
K Yamanaka, ED Demaine, T Ito, J Kawahara, M Kiyomi, Y Okamoto, ...
Theoretical Computer Science 586, 81-94, 2015
Counting the number of independent sets in chordal graphs
Y Okamoto, T Uno, R Uehara
Journal of Discrete Algorithms 6 (2), 229-242, 2008
Approximation and hardness for token swapping
T Miltzow, L Narins, Y Okamoto, G Rote, A Thomas, T Uno
arXiv preprint arXiv:1602.05150, 2016
Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability
K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, RI Silveira, ...
Algorithmica 62, 309-332, 2012
The traveling salesman problem with few inner points
VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger
Operations Research Letters 34 (1), 106-110, 2006
The minimum weight triangulation problem with few inner points
M Hoffmann, Y Okamoto
Computational Geometry 34 (3), 149-158, 2006
User’s manual for SparseCoLO: Conversion methods for sparse conic-form linear optimization problems
K Fujisawa, S Kim, M Kojima, Y Okamoto, M Yamashita
Report B-453, Dept. of Math. and Comp. Sci. Japan, Tech. Rep, 152-8552, 2009
Computational complexity and an integer programming model of Shakashaka
ED Demaine, Y Okamoto, R Uehara, Y Uno
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2014
Core stability of minimum coloring games
T Bietenhader, Y Okamoto
Mathematics of Operations Research 31 (2), 418-431, 2006
Fair cost allocations under conflicts—a game-theoretic point of view—
Y Okamoto
Discrete Optimization 5 (1), 1-18, 2008
Untangling a planar graph
X Goaoc, J Kratochvíl, Y Okamoto, CS Shin, A Spillner, A Wolff
Discrete & Computational Geometry 42 (4), 542-569, 2009
The affine representation theorem for abstract convex geometries
K Kashiwabara, M Nakamura, Y Okamoto
Computational Geometry 30 (2), 129-144, 2005
Semantic word cloud representations: Hardness and approximation algorithms
L Barth, SI Fabrikant, SG Kobourov, A Lubiw, M Nöllenburg, Y Okamoto, ...
Latin American Symposium on Theoretical Informatics, 514-525, 2014
Submodularity of some classes of the combinatorial optimization games
Y Okamoto
Mathematical Methods of Operations Research 58 (1), 131-139, 2003
Submodular fractional programming for balanced clustering
Y Kawahara, K Nagano, Y Okamoto
Pattern Recognition Letters 32 (2), 235-243, 2011
Exact algorithms for the max-min dispersion problem
T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ...
International Workshop on Frontiers in Algorithmics, 263-272, 2018
The geodesic diameter of polygonal domains
SW Bae, M Korman, Y Okamoto
Discrete & Computational Geometry 50, 306-329, 2013
Counting the number of matchings in chordal and chordal bipartite graph classes
Y Okamoto, R Uehara, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 296-307, 2009
How to make a picturesque maze
Y Okamoto, R Uehara
21st Annual Canadian Conference on Computational Geometry, 137-140, 2009
The system can't perform the operation now. Try again later.
Articles 1–20