Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Youssef N. Altherwy

dblp:252/3698 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0002-9510-6638ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › network connectivity
connectivity probability		 0.412019
Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm: poster abstract · SenSys 2019
Internet of things and sensor networks
underwater sensor networks		 0.412019
Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm: poster abstract · SenSys 2019
Graph algorithms and graph theory
graph algorithms		 0.412019
Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm: poster abstract · SenSys 2019
Graph algorithms and graph theory › network analysis
network reliability		 0.412019
Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm: poster abstract · SenSys 2019

Methods — techniques the papers use, named apart from their topics

polynomial-time algorithm · 0.8
YearPublicationVenuePosition
2019 Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm: poster abstract
abstract
We investigate the likelihood that two nodes are connected in an Underwater Wireless Sensor Network (UWSN) where nodes are floating freely with the underwater currents and the location of nodes at any given time can only be determined in a probabilistic fashion. This problem is #P-hard, thus, we propose HB-Conn2, an algorithm that returns an exact solution in polynomial time when applied on a set of node-disjoint (s, t)-paths.
Youssef N. Altherwy, Ehab S. Elmallah, Julie A. McCann
 SenSys1