Search the dblp DataBase

Publications of Author

1. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
   The Traveling Salesman Problem with Few Inner Points. [Citation Graph (0, 0)][DBLP]
   COCOON, 2004, pp:268-277 [Conf]
   
2. Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
   Matroid Representation of Clique Complexes. [Citation Graph (0, 0)][DBLP]
   COCOON, 2003, pp:192-201 [Conf]
   
3. Yoshio Okamoto
   Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2003, pp:686-695 [Conf]
   
4. Michael Hoffmann, Yoshio Okamoto
   The Minimum Weight Triangulation Problem with Few Inner Points. [Citation Graph (0, 0)][DBLP]
   IWPEC, 2004, pp:200-212 [Conf]
   
5. Paz Carmi, Thomas Erlebach, Yoshio Okamoto
   Greedy Edge-Disjoint Paths in Complete Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:143-155 [Conf]
   
6. Thomas Bietenhader, Yoshio Okamoto
   Core Stability of Minimum Coloring Games. [Citation Graph (0, 0)][DBLP]
   WG, 2004, pp:389-401 [Conf]
   
7. Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
   Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2005, pp:433-444 [Conf]
   
8. Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto
   The affine representation theorem for abstract convex geometries. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:30, n:2, pp:129-144 [Journal]
   
9. Michael Hoffmann, Yoshio Okamoto
   The minimum weight triangulation problem with few inner points. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:34, n:3, pp:149-158 [Journal]
   
10. Kenji Kashiwabara, Yoshio Okamoto
    A greedy algorithm for convex geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:449-465 [Journal]
    
11. Yoshio Okamoto
    Traveling salesman games with the Monge property. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:3, pp:349-369 [Journal]
    
12. Yoshio Okamoto, Masataka Nakamura
    The forbidden minor characterization of line-search antimatroids of rooted digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:523-533 [Journal]
    
13. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
    The traveling salesman problem with few inner points. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:106-110 [Journal]
    
14. Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
    Moving Vertices to Make Drawings Plane [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
15. Yota Otachi, Yoshio Okamoto, Koichi Yamazaki
    Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:17, pp:2383-2390 [Journal]
    
16. Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
    Matroid representation of clique complexes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:15, pp:1910-1929 [Journal]
    
17. 
    Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. [Citation Graph (, )][DBLP]
    
    
18. 
    How to make a picturesque maze. [Citation Graph (, )][DBLP]
    
    
19. 
    On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. [Citation Graph (, )][DBLP]
    
    
20. 
    The Geodesic Diameter of Polygonal Domains. [Citation Graph (, )][DBLP]
    
    
21. 
    Moving Vertices to Make Drawings Plane. [Citation Graph (, )][DBLP]
    
    
22. 
    Drawing (Complete) Binary Tanglegrams. [Citation Graph (, )][DBLP]
    
    
23. 
    Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. [Citation Graph (, )][DBLP]
    
    
24. 
    A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. [Citation Graph (, )][DBLP]
    
    
25. 
    Improved Bounds for Wireless Localization. [Citation Graph (, )][DBLP]
    
    
26. 
    Minimum and Maximum against k Lies. [Citation Graph (, )][DBLP]
    
    
27. 
    Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. [Citation Graph (, )][DBLP]
    
    
28. 
    Adaptive Algorithms for Planar Convex Hull Problems. [Citation Graph (, )][DBLP]
    
    
29. 
    Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability [Citation Graph (, )][DBLP]
    
    
30. 
    Querying Two Boundary Points for Shortest Paths in a Polygonal Domain [Citation Graph (, )][DBLP]
    
    
31. 
    The Geodesic Diameter of Polygonal Domains [Citation Graph (, )][DBLP]
    
    
32. 
    Minimum and maximum against k lies [Citation Graph (, )][DBLP]
    
    
33. 
    Untangling a Planar Graph. [Citation Graph (, )][DBLP]
    
    
34. 
    Local topology of the free complex of a two-dimensional generalized convex shelling. [Citation Graph (, )][DBLP]
    
    
35. 
    The Holt-Klee condition for oriented matroids. [Citation Graph (, )][DBLP]