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