VLDB 2026 Research / reviewers in the wild / expert
Mustapha Aouchiche
dblp:64/5936
· DBLP profile ↗
12ranked-venue papers
9as first author
3since 2021 · last 2025
0000-0002-4090-9847ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 11 · 8 first-author · 3 since 2021Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Distance Laplacian spectra of graphs: A survey
Bilal A. Rather, Mustapha Aouchiche |
Discret. Appl. Math. | 2 |
| 2024 | Proximity and remoteness in graphs: A survey
Mustapha Aouchiche, Bilal A. Rather |
Discret. Appl. Math. | 1 |
| 2022 | Minimum values of the second largest Q-eigenvalue
Mustapha Aouchiche, Issmail Elhallaoui |
Discret. Appl. Math. | 1 |
| 2018 | On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
Kinkar Chandra Das, Mustapha Aouchiche, Pierre Hansen |
Discret. Appl. Math. | 2 |
| 2017 | Proximity, remoteness and girth in graphs
Mustapha Aouchiche, Pierre Hansen |
Discret. Appl. Math. | 1 |
| 2017 | The geometric-arithmetic index and the chromatic number of connected graphs
Mustapha Aouchiche, Pierre Hansen |
Discret. Appl. Math. | 1 |
| 2016 | Proximity, remoteness and distance eigenvalues of a graph
Mustapha Aouchiche, Pierre Hansen |
Discret. Appl. Math. | 1 |
| 2013 | A survey of Nordhaus-Gaddum type relations
Mustapha Aouchiche, Pierre Hansen |
Discret. Appl. Math. | 1 |
| 2011 | Proximity and remoteness in graphs: Results and conjecturesabstractAbstract The proximity π = π(G) of a connected graph G is the minimum, over all vertices, of the average distance from a vertex to all others. Similarly, the maximum is called the “remoteness” and denoted by ρ = ρ(G). In this article we first prove upper and lower bounds on π and ρ as a function of the order n of G. A comparison between these two invariants follows and then each one is compared to the diameter, radius, average eccentricity, average distance, independence number and matching number. Most bounds so obtained are proved, but a few of them remain conjectures. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 Mustapha Aouchiche, Pierre Hansen |
Networks | 1 |
| 2009 | Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
Mustapha Aouchiche, Odile Favaron, Pierre Hansen |
Discret. Appl. Math. | 1 |
| 2008 | Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
Mustapha Aouchiche, Gunnar Brinkmann, Pierre Hansen |
Discret. Appl. Math. | 1 |
| 2005 | Distance monotonicity and a new characterization of Hamming graphs
Méziane Aïder, Mustapha Aouchiche |
Inf. Process. Lett. | 2 |