Yoshio Okamoto

According to our database1, Yoshio Okamoto authored at least 99 papers between 2003 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Balanced line separators of unit disk graphs.
Comput. Geom., 2020

Guest Editorial: Selected Papers from ISAAC 2017.
Algorithmica, 2020

2019
Sequentially Swapping Colored Tokens on Graphs.
J. Graph Algorithms Appl., 2019

Reconfiguration of maximum-weight b-matchings in a graph.
J. Comb. Optim., 2019

Linear-Time Recognition of Double-Threshold Graphs.
CoRR, 2019

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
CoRR, 2019

Area bounds of rectilinear polygons realized by angle sequences.
Comput. Geom., 2019

Computing the geodesic centers of a polygonal domain.
Comput. Geom., 2019

Minimum-Cost b-Edge Dominating Sets on Trees.
Algorithmica, 2019

Variants of the Segment Number of a Graph.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Graphs with Large Total Angular Resolution.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Algorithms for Gerrymandering over Graphs.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Computational Complexity of Robot Arm Simulation Problems.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Exact Algorithms for the Max-Min Dispersion Problem.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017
Efficient stabilization of cooperative matching games.
Theor. Comput. Sci., 2017

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set.
JIP, 2017

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.
Discrete & Computational Geometry, 2017

Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution).
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Tight Approximability of the Server Allocation Problem for Real-Time Applications.
Proceedings of the Algorithmic Aspects of Cloud Computing - Third International Workshop, 2017

2016
Traveling Sales Person with Few Inner Points.
Encyclopedia of Algorithms, 2016

On Problems as Hard as CNF-SAT.
ACM Trans. Algorithms, 2016

Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9).
NII Shonan Meet. Rep., 2016

Extended formulations for sparsity matroids.
Math. Program., 2016

On the treewidth of toroidal grids.
Discret. Appl. Math., 2016

Tight Exact and Approximate Algorithmic Results on Token Swapping.
CoRR, 2016

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.
Comput. Geom., 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Approximation and Hardness of Token Swapping.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Swapping labeled tokens on graphs.
Theor. Comput. Sci., 2015

Free Edge Lengths in Plane Graphs.
Discrete & Computational Geometry, 2015

Polynomial-time approximability of the k-Sink Location problem.
CoRR, 2015

Computing the L1 geodesic diameter and center of a simple polygon in linear time.
Comput. Geom., 2015

2014
A 4.31-approximation for the geometric unique coverage problem on unit disks.
Theor. Comput. Sci., 2014

Submodularity of minimum-cost spanning tree games.
Networks, 2014

Computational Complexity and an Integer Programming Model of Shakashaka.
IEICE Transactions, 2014

Approximating the path-distance-width for AT-free graphs and graphs in related classes.
Discret. Appl. Math., 2014

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Weight Balancing on Boundaries and Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
The complexity of the stamp folding problem.
Theor. Comput. Sci., 2013

Guest Editors' Foreword.
Int. J. Comput. Geometry Appl., 2013

General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction.
IACR Cryptology ePrint Archive, 2013

The Geodesic Diameter of Polygonal Domains.
Discrete & Computational Geometry, 2013

Exact and fixed-parameter algorithms for metro-line crossing minimization problems.
CoRR, 2013

Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.
CoRR, 2013

Guest Editorial: Selected Papers from ISAAC 2011.
Algorithmica, 2013

2012
Vertex angle and crossing angle resolution of leveled tree drawings.
Inf. Process. Lett., 2012

Guest Editors' Foreword.
Int. J. Comput. Geometry Appl., 2012

On bipartite powers of bigraphs.
Discrete Mathematics & Theoretical Computer Science, 2012

Querying two boundary points for shortest paths in a polygonal domain.
Comput. Geom., 2012

Minimum and maximum against k lies.
Chicago J. Theor. Comput. Sci., 2012

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
Algorithmica, 2012

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Universal Point Subsets for Planar Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
Submodular fractional programming for balanced clustering.
Pattern Recognit. Lett., 2011

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.
J. Graph Algorithms Appl., 2011

Adaptive Algorithms for Planar Convex Hull Problems.
IEICE Transactions, 2011

A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization.
Eur. J. Oper. Res., 2011

On Problems as Hard as CNFSAT
CoRR, 2011

Not All Saturated 3-Forests Are Tight
CoRR, 2011

The t-Pebbling Number is Eventually Linear in t.
Electr. J. Comb., 2011

Approximability of the Path-Distance-Width for AT-free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Dominating Set Counting in Graph Classes.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
On listing, sampling, and counting the chordal graphs with edge constraints.
Theor. Comput. Sci., 2010

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.
Electr. J. Comb., 2010

Improved Bounds for Wireless Localization.
Algorithmica, 2010

Minimum and Maximum against k Lies.
Proceedings of the Algorithm Theory, 2010

2009
Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes.
Int. J. Found. Comput. Sci., 2009

The Holt-Klee condition for oriented matroids.
Eur. J. Comb., 2009

Untangling a Planar Graph.
Discrete & Computational Geometry, 2009

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

How to make a picturesque maze.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Traveling Sales Person with Few Inner Points.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Counting the number of independent sets in chordal graphs.
J. Discrete Algorithms, 2008

Local topology of the free complex of a two-dimensional generalized convex shelling.
Discret. Math., 2008

Fair cost allocations under conflicts - a game-theoretic point of view - .
Discret. Optim., 2008

Drawing (Complete) Binary Tanglegrams.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

08431 Open Problems - Moderately Exponential Time Algorithms.
Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

2007
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.
Discret. Appl. Math., 2007

Matroid representation of clique complexes.
Discret. Appl. Math., 2007

Moving Vertices to Make Drawings Plane.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006
The traveling salesman problem with few inner points.
Oper. Res. Lett., 2006

Core Stability of Minimum Coloring Games.
Math. Oper. Res., 2006

The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five.
IEICE Transactions, 2006

The minimum weight triangulation problem with few inner points.
Comput. Geom., 2006

2005
The affine representation theorem for abstract convex geometries.
Comput. Geom., 2005

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004
Traveling salesman games with the Monge property.
Discret. Appl. Math., 2004

2003
Submodularity of some classes of the combinatorial optimization games.
Math. Meth. of OR, 2003

Some properties of the core on convex geometries.
Math. Meth. of OR, 2003

The forbidden minor characterization of line-search antimatroids of rooted digraphs.
Discret. Appl. Math., 2003

A greedy algorithm for convex geometries.
Discret. Appl. Math., 2003

Greedy Edge-Disjoint Paths in Complete Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003


  Loading...