The SCEAS System
Navigation Menu

Search the dblp DataBase


Takuro Fukunaga: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Takuro Fukunaga, Hiroshi Nagamochi
    Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:747-756 [Conf]
  2. Takuro Fukunaga, Hiroshi Nagamochi
    Network Design with Edge-Connectivity and Degree Constraints. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:188-201 [Conf]
  3. Takuro Fukunaga, Hiroshi Nagamochi
    The Set Connector Problem in Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:484-498 [Conf]
  4. André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
    Approximability of the capacitated b-edge dominating set problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:202-213 [Journal]

  5. "Rent-or-Buy" Scheduling and Cost Coloring Problems. [Citation Graph (, )][DBLP]

  6. Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. [Citation Graph (, )][DBLP]

  7. Graph Orientations with Set Connectivity Requirements. [Citation Graph (, )][DBLP]

  8. Robust cost colorings. [Citation Graph (, )][DBLP]

  9. Network Design with Weighted Degree Constraints. [Citation Graph (, )][DBLP]

  10. FPTAS's for Some Cut Problems in Weighted Trees. [Citation Graph (, )][DBLP]

  11. Eulerian detachments with local edge-connectivity. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002