Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase element-disjoint (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2003-2016 (8)
Publication types (Num. hits)
article(4) inproceedings(4)
Venues (Conferences, Journals, ...)
APPROX-RANDOM(2) AAIM(1) ACM Trans. Algorithms(1) Algorithmica(1) ICALP (1)(1) IEICE Trans. Fundam. Electron....(1) J. Syst. Archit.(1)
Authors
Joseph Cheriyan(4) Ashkan Aazami(2) Daiki Hoshika(2) Eiji Miyano(2) Krishnam Raju Jampani(2) Mohammad R. Salavatipour(2) Chandra Chekuri(1) Nitish Korula(1) Yeonghwan Tscha(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
78Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
58Joseph Cheriyan, Mohammad R. Salavatipour Packing element-disjoint steiner trees. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF element-disjoint, approximation algorithms, Steiner trees, hardness of approximation, Packing
39Chandra Chekuri, Nitish Korula A Graph Reduction Step Preserving Element-Connectivity and Applications. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Joseph Cheriyan, Mohammad R. Salavatipour Packing Element-Disjoint Steiner Trees. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
18Daiki Hoshika, Eiji Miyano Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. Search on Bibsonomy IEICE Trans. Fundam. Electron. Commun. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
18Daiki Hoshika, Eiji Miyano Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. Search on Bibsonomy AAIM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
18Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
18Yeonghwan Tscha Scheduling length for switching element disjoint multicasting in Banyan-type switching networks. Search on Bibsonomy J. Syst. Archit. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #8 of 8 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license