The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Takuro Fukunaga" ( http://dblp.L3S.de/Authors/Takuro_Fukunaga )

  Author page on DBLP  Author page in RDF  Community of Takuro Fukunaga in ASPL-2

Publication years (Num. hits)
2005-2009 (15) 2010-2012 (8)
Publication types (Num. hits)
article(11) inproceedings(11) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 23 publication records. Showing 23 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, R. Ravi Iterative rounding approximation algorithms for degree-bounded node-connectivity network design Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Takuro Fukunaga All 4-Edge-Connected HHD-Free Graphs are \mathbbZ3-Connected. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. Search on Bibsonomy Int. J. Comput. Geometry Appl. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands. Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi Network design with weighted degree constraints. Search on Bibsonomy Discrete Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi FPTAS's for Some Cut Problems in Weighted Trees. Search on Bibsonomy FAW The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. Search on Bibsonomy IPCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi Network Design with Edge-Connectivity and Degree Constraints. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity
1Takuro Fukunaga, Hiroshi Nagamochi Eulerian detachments with local edge-connectivity. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi Network Design with Weighted Degree Constraints. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga Graph Orientations with Set Connectivity Requirements. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi Robust cost colorings. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga (eds.) Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi Generalizing the induced matching by edge capacity constraints. Search on Bibsonomy Discrete Optimization The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh Approximability of the capacitated b-edge dominating set problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi Approximating a Generalization of Metric TSP. Search on Bibsonomy IEICE Transactions The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi The Set Connector Problem in Graphs. Search on Bibsonomy IPCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi "Rent-or-Buy" Scheduling and Cost Coloring Problems. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi Some Theorems on Detachments Preserving Local-Edge-Connectivity. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi Network Design with Edge-Connectivity and Degree Constraints. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Takuro Fukunaga, Hiroshi Nagamochi Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #23 of 23 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.