A. Karim Abu-Affash

Available identifiers

zbMath Open abu-affash.a-karimWikidataQ102415254 ScholiaQ102415254MaRDI QIDQ390161

List of research outcomes

Publication	Date of Publication	Type
Piercing diametral disks induced by edges of maximum spanning trees	2024-11-12	Paper
Dynamic Euclidean bottleneck matching	2024-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q6124759	2024-04-02	Paper
Geometric spanning trees minimizing the Wiener index	2024-01-16	Paper
Piercing diametral disks induced by edges of maximum spanning trees	2023-11-24	Paper
Planar Bichromatic Bottleneck Spanning Trees	2023-02-07	Paper
Piercing pairwise intersecting geodesic disks by five points	2022-11-16	Paper
A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph	2022-08-24	Paper
\( \delta \)-greedy \(t\)-spanner	2021-12-15	Paper
Approximating maximum diameter-bounded subgraph in unit disk graphs	2021-11-18	Paper
Minimizing total interference in asymmetric sensor networks	2021-10-06	Paper
Planar bichromatic bottleneck spanning trees	2021-09-07	Paper
Minimizing total interference in asymmetric sensor networks	2021-07-08	Paper
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs	2020-08-18	Paper
Monochromatic plane matchings in bicolored point set	2019-11-21	Paper
Bottleneck bichromatic full Steiner trees	2018-12-05	Paper
Strongly Connected Spanning Subgraph for Almost Symmetric Networks	2018-01-31	Paper
Dual power assignment via second Hamiltonian cycle	2017-12-21	Paper
Approximating the bottleneck plane perfect matching of a point set	2016-01-15	Paper
The Euclidean bottleneck full Steiner tree problem	2015-03-02	Paper
Bottleneck Steiner tree with bounded number of Steiner vertices	2015-02-13	Paper
The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition	2014-03-25	Paper
The euclidean bottleneck steiner path problem	2014-03-24	Paper
On the euclidean bottleneck full Steiner tree problem	2014-03-24	Paper
Bottleneck non-crossing matching in the plane	2014-01-22	Paper
MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS	2012-11-23	Paper
Bottleneck Non-crossing Matching in the Plane	2012-09-25	Paper
The MST of symmetric disk graphs is light	2012-06-08	Paper
Multi Cover of a Polygon Minimizing the Sum of Areas	2011-02-20	Paper
The MST of Symmetric Disk Graphs Is Light	2010-06-22	Paper
Improved bounds on the average distance to the Fermat-Weber center of a convex object	2010-06-16	Paper

Research outcomes over time

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