A. Karim Abu-Affash

From MaRDI portal
Person:390161

Available identifiers

zbMath Open abu-affash.a-karimWikidataQ102415254 ScholiaQ102415254MaRDI QIDQ390161

List of research outcomes





PublicationDate of PublicationType
Piercing diametral disks induced by edges of maximum spanning trees2024-11-12Paper
Dynamic Euclidean bottleneck matching2024-10-01Paper
https://portal.mardi4nfdi.de/entity/Q61247592024-04-02Paper
Geometric spanning trees minimizing the Wiener index2024-01-16Paper
Piercing diametral disks induced by edges of maximum spanning trees2023-11-24Paper
Planar Bichromatic Bottleneck Spanning Trees2023-02-07Paper
Piercing pairwise intersecting geodesic disks by five points2022-11-16Paper
A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph2022-08-24Paper
\( \delta \)-greedy \(t\)-spanner2021-12-15Paper
Approximating maximum diameter-bounded subgraph in unit disk graphs2021-11-18Paper
Minimizing total interference in asymmetric sensor networks2021-10-06Paper
Planar bichromatic bottleneck spanning trees2021-09-07Paper
Minimizing total interference in asymmetric sensor networks2021-07-08Paper
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs2020-08-18Paper
Monochromatic plane matchings in bicolored point set2019-11-21Paper
Bottleneck bichromatic full Steiner trees2018-12-05Paper
Strongly Connected Spanning Subgraph for Almost Symmetric Networks2018-01-31Paper
Dual power assignment via second Hamiltonian cycle2017-12-21Paper
Approximating the bottleneck plane perfect matching of a point set2016-01-15Paper
The Euclidean bottleneck full Steiner tree problem2015-03-02Paper
Bottleneck Steiner tree with bounded number of Steiner vertices2015-02-13Paper
The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition2014-03-25Paper
The euclidean bottleneck steiner path problem2014-03-24Paper
On the euclidean bottleneck full Steiner tree problem2014-03-24Paper
Bottleneck non-crossing matching in the plane2014-01-22Paper
MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS2012-11-23Paper
Bottleneck Non-crossing Matching in the Plane2012-09-25Paper
The MST of symmetric disk graphs is light2012-06-08Paper
Multi Cover of a Polygon Minimizing the Sum of Areas2011-02-20Paper
The MST of Symmetric Disk Graphs Is Light2010-06-22Paper
Improved bounds on the average distance to the Fermat-Weber center of a convex object2010-06-16Paper

Research outcomes over time

This page was built for person: A. Karim Abu-Affash