Demo Data from EDBT 2026 / reviewers in the wild / expert
Farid Alizadeh
dblp:44/2992
· DBLP profile ↗
7ranked-venue papers
7as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 7 · 7 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.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 50% Distributed systems · 50% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › genomics › physical mapping
physical mapping of chromosomes |
0.0 | 2 | 1994 | Physical Mapping of Chromosomes Using Unique Probes · SODA 1994 Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology · SODA 1993 |
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1991 | A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs · SODA 1991 |
Distributed systems
randomized algorithms |
0.0 | 1 | 1991 | A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs · SODA 1991 |
Graph algorithms and graph theory › graph theory › clique
maximum clique |
0.0 | 1 | 1991 | A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs · SODA 1991 |
Graph algorithms and graph theory › graph classes
perfect graph |
0.0 | 1 | 1991 | A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs · SODA 1991 |
Methods — techniques the papers use, named apart from their topics
combinatorial algorithm · 0.0randomized parallel algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Preface
Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti |
Discret. Appl. Math. | 1 |
| 2018 | Preface: Special issue dedicated to Distance Geometry
Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti |
J. Glob. Optim. | 1 |
| 1995 | Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology
Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser |
Algorithmica | 1 |
| 1994 | Physical Mapping of Chromosomes Using Unique Probes
Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig |
SODA | 1 |
| 1993 | Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology
Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser |
SODA | 1 |
| 1992 | Combinatorial Optimization with Semi-Definite Matrices
Farid Alizadeh |
IPCO | 1 |
| 1991 | A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs
Farid Alizadeh |
SODA | 1 |