The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1997-2021 (15) 2023 (3)
Publication types (Num. hits)
article(10) inproceedings(8)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 9 keywords

Results
Found 18 publication records. Showing 18 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
44Mirela Damian, Sriram V. Pemmaraju Computing Optimal Diameter-Bounded Polygon Partitions. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Diameter-bounded, Approximation algorithm, Polygon decomposition
38T.-H. Hubert Chan, Anupam Gupta 0001 Small Hop-diameter Sparse Spanners for Doubling Metrics. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hop diameter, Algorithms, Doubling metrics, Sparse spanners
38T.-H. Hubert Chan, Anupam Gupta 0001 Small hop-diameter sparse spanners for doubling metrics. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Felicia Lucke, Daniël Paulusma, Bernard Ries Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
26Felicia Lucke, Daniël Paulusma, Bernard Ries Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. Search on Bibsonomy MFCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
19Ke Zhang, Xiaoqing Wang, Gong Cheng 0001 Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem. Search on Bibsonomy WWW The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
19Michele Garraffa, Deepak Mehta 0001, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada 0001 An adaptive large neighbourhood search algorithm for diameter bounded network design problems. Search on Bibsonomy J. Heuristics The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
19A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Search on Bibsonomy SoCG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
19Giacomo Gigante, Paul C. Leopardi Diameter Bounded Equal Measure Partitions of Ahlfors Regular Metric Measure Spaces. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
19Edward Khairutdinovich Gimadi, Alexey M. Istomin, Ekaterina Shin On Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below. Search on Bibsonomy DOOR (Supplement) The full citation details ... 2016 DBLP  BibTeX  RDF
19Anthony Dekker, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Paul A. Watters The Maximum Degree & Diameter-Bounded Subgraph and its Applications. Search on Bibsonomy J. Math. Model. Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
19Mirka Miller, Hebert Pérez-Rosés, Joe Ryan 0001 The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
19Mirka Miller, Hebert Pérez-Rosés, Joe Ryan 0001 The maximum degree and diameter-bounded subgraph in the mesh. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
19Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo Approximating Maximum Diameter-Bounded Subgraphs. Search on Bibsonomy LATIN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
19V. S. Anitha, M. P. Sebastian Scenario-Based Diameter-Bounded Algorithm for Cluster Creation and Management in Mobile Ad hoc Networks. Search on Bibsonomy DS-RT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Chris Worman Decomposing Polygons Into Diameter Bounded Components. Search on Bibsonomy CCCG The full citation details ... 2003 DBLP  BibTeX  RDF
10Hsing-Lung Chen, Nian-Feng Tzeng A Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF incomplete subcubes, distributed algorithms, reconfiguration, Boolean expressions, faulty hypercubes
Displaying result #1 - #18 of 18 (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