 | 2009 |
|---|
| 14 |       | Takuro Fukunaga:
Graph Orientations with Set Connectivity Requirements.
ISAAC 2009: 265-274 |
| 13 | | Takuro Fukunaga,
Hiroshi Nagamochi:
Network Design with Weighted Degree Constraints.
WALCOM 2009: 214-225 |
| 12 | | Takuro Fukunaga,
Hiroshi Nagamochi:
Eulerian detachments with local edge-connectivity.
Discrete Applied Mathematics 157(4): 691-698 (2009) |
| 11 | | Takuro Fukunaga,
Hiroshi Nagamochi:
Network Design with Edge-Connectivity and Degree Constraints.
Theory Comput. Syst. 45(3): 512-532 (2009) |
| 2008 |
|---|
| 10 | | Seok-Hee Hong,
Hiroshi Nagamochi,
Takuro Fukunaga:
Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings
Springer 2008 |
| 9 | | Takuro Fukunaga,
Magnús M. Halldórsson,
Hiroshi Nagamochi:
Robust cost colorings.
SODA 2008: 1204-1212 |
| 2007 |
|---|
| 8 | | Takuro Fukunaga,
Magnús M. Halldórsson,
Hiroshi Nagamochi:
"Rent-or-Buy" Scheduling and Cost Coloring Problems.
FSTTCS 2007: 84-95 |
| 7 | | Takuro Fukunaga,
Hiroshi Nagamochi:
The Set Connector Problem in Graphs.
IPCO 2007: 484-498 |
| 6 | | Takuro Fukunaga,
Hiroshi Nagamochi:
Generalizing the induced matching by edge capacity constraints.
Discrete Optimization 4(2): 198-205 (2007) |
| 5 | | Takuro Fukunaga,
Hiroshi Nagamochi:
Approximating a Generalization of Metric TSP.
IEICE Transactions 90-D(2): 432-439 (2007) |
| 4 | | André Berger,
Takuro Fukunaga,
Hiroshi Nagamochi,
Ojas Parekh:
Approximability of the capacitated b-edge dominating set problem.
Theor. Comput. Sci. 385(1-3): 202-213 (2007) |
| 2006 |
|---|
| 3 | | Takuro Fukunaga,
Hiroshi Nagamochi:
Network Design with Edge-Connectivity and Degree Constraints.
WAOA 2006: 188-201 |
| 2 | | Takuro Fukunaga,
Hiroshi Nagamochi:
Some Theorems on Detachments Preserving Local-Edge-Connectivity.
Electronic Notes in Discrete Mathematics 24: 173-180 (2006) |
| 2005 |
|---|
| 1 | | Takuro Fukunaga,
Hiroshi Nagamochi:
Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems.
COCOON 2005: 747-756 |
