Artikler med mandater om offentlig tilgang - Yoshio OkamotoLes mer
Tilgjengelige et eller annet sted: 26
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
Mandater: US National Science Foundation, Netherlands Organisation for Scientific …
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
Mandater: German Research Foundation
The traveling salesman problem with few inner points
VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger
Operations Research Letters 34 (1), 106-110, 2006
Mandater: German Research Foundation
The minimum weight triangulation problem with few inner points
M Hoffmann, Y Okamoto
Computational Geometry 34 (3), 149-158, 2006
Mandater: German Research Foundation
Core stability of minimum coloring games
T Bietenhader, Y Okamoto
Mathematics of Operations Research 31 (2), 418-431, 2006
Mandater: German Research Foundation
Fair cost allocations under conflicts—a game-theoretic point of view—
Y Okamoto
Discrete Optimization 5 (1), 1-18, 2008
Mandater: German Research Foundation
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
Mandater: German Research Foundation
The geodesic diameter of polygonal domains
SW Bae, M Korman, Y Okamoto
Discrete & Computational Geometry 50, 306-329, 2013
Mandater: Government of Spain
Subgraph isomorphism on graph classes that exclude a substructure
HL Bodlaender, T Hanaka, Y Kobayashi, Y Kobayashi, Y Okamoto, ...
Algorithmica 82 (12), 3566-3587, 2020
Mandater: Netherlands Organisation for Scientific Research
Shortest reconfiguration of perfect matchings via alternating cycles
T Ito, N Kakimura, N Kamiyama, Y Kobayashi, Y Okamoto
SIAM Journal on Discrete Mathematics 36 (2), 1102-1123, 2022
Mandater: Japan Science and Technology Agency
Universal point subsets for planar graphs
P Angelini, C Binucci, W Evans, F Hurtado, G Liotta, T Mchedlidze, ...
International Symposium on Algorithms and Computation, 423-432, 2012
Mandater: Government of Spain
Matroid representation of clique complexes
K Kashiwabara, Y Okamoto, T Uno
Discrete Applied Mathematics 155 (15), 1910-1929, 2007
Mandater: German Research Foundation
Variants of the segment number of a graph
Y Okamoto, A Ravsky, A Wolff
International Symposium on Graph Drawing and Network Visualization, 430-443, 2019
Mandater: German Research Foundation
Balanced line separators of unit disk graphs
P Carmi, MK Chiu, MJ Katz, M Korman, Y Okamoto, A Van Renssen, ...
Computational Geometry 86, 101575, 2020
Mandater: US National Science Foundation, European Commission
The Holt–Klee condition for oriented matroids
K Fukuda, S Moriyama, Y Okamoto
European Journal of Combinatorics 30 (8), 1854-1867, 2009
Mandater: Swiss National Science Foundation
Linear-time recognition of double-threshold graphs
Y Kobayashi, Y Okamoto, Y Otachi, Y Uno
Algorithmica 84 (4), 1163-1181, 2022
Mandater: Japan Science and Technology Agency
Folding free-space diagrams: computing the Fréchet distance between 1-dimensional curves
KA Buchin, J Chun, A Markovic, W Meulemans, M Löffler, Y Okamoto, ...
33rd International Symposium on Computational Geometry (SoCG 2017), 641-645, 2017
Mandater: Netherlands Organisation for Scientific Research
Weight balancing on boundaries and skeletons
L Barba, O Cheong, JL De Carufel, MG Dobbins, R Fleischer, ...
Proceedings of the thirtieth annual symposium on Computational geometry, 436-443, 2014
Mandater: National Natural Science Foundation of China, Government of Spain
Computing the Geodesic Diameter and Center of a Polygonal Domain
SW Bae, M Korman, JSB Mitchell, Y Okamoto, V Polishchuk, H Wang
Discrete & Computational Geometry 57, 674-701, 2017
Mandater: US National Science Foundation
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
T Ito, N Kakimura, N Kamiyama, Y Kobayashi, Y Okamoto
Operations Research Letters 50 (3), 370-375, 2022
Mandater: Japan Science and Technology Agency
Informasjon om publisering og finansiering fastsettes automatisk av et datamaskinprogram