default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustapha Aouchiche
Person information
- affiliation: GERAD Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j27]Bilal Ahmad Rather
, Mustapha Aouchiche:
Distance Laplacian spectra of graphs: A survey. Discret. Appl. Math. 361: 136-195 (2025)- 2024
- [j26]Mustapha Aouchiche, Bilal Ahmad Rather:
Proximity and remoteness in graphs: A survey. Discret. Appl. Math. 353: 94-120 (2024) - [j25]Bilal Ahmad Rather, Mustapha Aouchiche, Muhammad Imran, Issmail El Hallaoui:
On distance Laplacian spectral ordering of some graphs. J. Appl. Math. Comput. 70(1): 867-892 (2024) - 2022
- [j24]Bilal A. Rather, Mustapha Aouchiche, Shariefuddin Pirzada:
On the spread of the geometric-arithmetic matrix of graphs. AKCE Int. J. Graphs Comb. 19(2): 146-153 (2022) - [j23]Mustapha Aouchiche, Issmail El Hallaoui:
Minimum values of the second largest Q-eigenvalue. Discret. Appl. Math. 306: 46-51 (2022)
2010 – 2019
- 2018
- [j22]Mustapha Aouchiche, Pierre Hansen:
Cospectrality of graphs with respect to distance matrices. Appl. Math. Comput. 325: 309-321 (2018) - [j21]Kinkar Chandra Das, Mustapha Aouchiche, Pierre Hansen:
On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs. Discret. Appl. Math. 243: 172-185 (2018) - 2017
- [j20]Mustapha Aouchiche, Pierre Hansen:
Proximity, remoteness and girth in graphs. Discret. Appl. Math. 222: 31-39 (2017) - [j19]Mustapha Aouchiche, Pierre Hansen:
The geometric-arithmetic index and the chromatic number of connected graphs. Discret. Appl. Math. 232: 207-212 (2017) - [j18]Mustapha Aouchiche, Pierre Hansen:
On the nullity number of graphs. Electron. J. Graph Theory Appl. 5(2): 335-346 (2017) - 2016
- [j17]Mustapha Aouchiche, Pierre Hansen:
Proximity, remoteness and distance eigenvalues of a graph. Discret. Appl. Math. 213: 17-25 (2016) - 2013
- [j16]Mustapha Aouchiche, Pierre Hansen:
A survey of Nordhaus-Gaddum type relations. Discret. Appl. Math. 161(4-5): 466-546 (2013) - [j15]Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen:
Open problems on graph eigenvalues studied with AutoGraphiX. EURO J. Comput. Optim. 1(1-2): 181-199 (2013) - 2011
- [j14]Mustapha Aouchiche, Pierre Hansen:
Proximity and remoteness in graphs: Results and conjectures. Networks 58(2): 95-102 (2011) - 2010
- [j13]Mustapha Aouchiche, Pierre Hansen:
Nordhaus-Gaddum relations for proximity and remoteness in graphs. Comput. Math. Appl. 59(8): 2827-2835 (2010) - [j12]Mustapha Aouchiche, Pierre Hansen:
On a conjecture about the Szeged index. Eur. J. Comb. 31(7): 1662-1666 (2010) - [j11]Jelena Sedlar, Damir Vukicevic, Mustapha Aouchiche, Pierre Hansen:
Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number. Stud. Inform. Univ. 8(2): 281-316 (2010)
2000 – 2009
- 2009
- [j10]Mustapha Aouchiche, Odile Favaron, Pierre Hansen:
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance. Discret. Appl. Math. 157(17): 3497-3510 (2009) - [j9]Mustapha Aouchiche, Pierre Hansen, Dragan Stevanovic:
Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index. Discuss. Math. Graph Theory 29(1): 15-37 (2009) - [j8]Mustapha Aouchiche, Odile Favaron, Pierre Hansen:
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille. RAIRO Oper. Res. 43(4): 339-358 (2009) - 2008
- [j7]Mustapha Aouchiche, Gunnar Brinkmann, Pierre Hansen:
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number. Discret. Appl. Math. 156(13): 2530-2542 (2008) - [j6]Mustapha Aouchiche, Francis K. Bell, Dragos M. Cvetkovic, Pierre Hansen, Peter Rowlinson, Slobodan K. Simic, Dragan Stevanovic:
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph. Eur. J. Oper. Res. 191(3): 661-676 (2008) - 2007
- [j5]Mustapha Aouchiche, Pierre Hansen:
On a conjecture about the Randic index. Discret. Math. 307(2): 262-265 (2007) - 2005
- [j4]Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen, M. Laffay:
AutoGraphiX: a survey. Electron. Notes Discret. Math. 22: 515-520 (2005) - [j3]Méziane Aïder, Mustapha Aouchiche:
Distance monotonicity and a new characterization of Hamming graphs. Inf. Process. Lett. 96(6): 207-213 (2005) - [j2]Mustapha Aouchiche, Pierre Hansen:
Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille. RAIRO Oper. Res. 39(4): 275-293 (2005) - 2002
- [j1]Méziane Aïder, Mustapha Aouchiche:
Distance monotonicity and a new characterization of hypercubes. Discret. Math. 245(1-3): 55-62 (2002) - 2001
- [c1]Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot, Dragan Stevanovic:
What Forms Do Interesting Conjectures Have in Graph Theory? Graphs and Discovery 2001: 231-251
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
