|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Tamás Fleiner, Naoyuki Kamiyama |
A matroid approach to stable matchings with lower quotas.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh |
Covering directed graphs by in-trees. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai |
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui |
Improved Approximation Algorithms for Firefighter Problem on Trees. |
IEICE Transactions |
2011 |
DBLP BibTeX RDF |
|
| 1 | Naoyuki Kamiyama |
Submodular Function Minimization under a Submodular Set Covering Constraint. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai |
On Totally Unimodularity of Edge-Edge Adjacency Matrices. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama |
Robustness of Minimum Cost Arborescences. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama |
A Relation between the Protocol Partition Number and the Quasi-Additive Bound |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Naoyuki Kamiyama |
The Prize-Collecting Edge Dominating Set Problem in Trees. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama |
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka |
Computational Complexities of University Interview Timetabling. |
IEICE Transactions |
2009 |
DBLP BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
Arc-disjoint in-trees in directed graphs. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh |
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh |
Covering Directed Graphs by In-trees |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
Arc-disjoint in-trees in directed graphs. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh |
Covering Directed Graphs by In-Trees. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh |
The Minimum Weight In-Tree Cover Problem. |
MCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. |
AAIM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. |
AAIM |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")