default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohamed Haitam Laarabi
Person information
- affiliation: CNR, IIT, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Cristian Poliziani
, Gary Hsueh, David Czerwinski, Tom Wenzel, Zachary Needell, Haitam Laarabi, Joerg Schweizer, Federico Rupi:
Micro Transit Simulation of On-Demand Shuttles Based on Transit Data for First- and Last-Mile Connection. ISPRS Int. J. Geo Inf. 12(4): 177 (2023)- [i3]Haitam Laarabi, Zachary Needell, Rashid Waraich, Cristian Poliziani, Tom Wenzel:
BEAM: The Modeling Framework for Behavior, Energy, Autonomy & Mobility. CoRR abs/2308.02073 (2023) - 2021
- [i2]Chiara Boldrini, Raffaele Bruno, Haitam Laarabi:
Weak Signals in the Mobility Landscape: Car Sharing in Ten European Cities. CoRR abs/2109.09832 (2021)
2010 – 2019
- 2019
- [j2]Chiara Boldrini, Raffaele Bruno, Mohamed Haitam Laarabi:
Weak signals in the mobility landscape: car sharing in ten European cities. EPJ Data Sci. 8(1): 7:1-7:24 (2019) - 2017
- [j1]Azedine Boulmakoul, Mohamed Haitam Laarabi, Roberto Sacile, Emmanuel Garbolino:
An original approach to ranking fuzzy numbers by inclusion index and Bitset Encoding. Fuzzy Optim. Decis. Mak. 16(1): 23-49 (2017) - [c7]Haitam Laarabi, Chiara Boldrini, Raffaele Bruno, Helen Porter, Peter Davidson:
User-Based Relocation of Stackable Car Sharing. SMARTGREENS/VEHITS (Selected Papers) 2017: 256-273 - [c6]M. Haitam Laarabi, Chiara Boldrini, Raffaele Bruno, Helen Porter, Peter Davidson:
On the Performance of a One-way Car Sharing System in Suburban Areas: A Real-world Use Case. VEHITS 2017: 102-110 - [i1]Chiara Boldrini, Raffaele Bruno, M. Haitam Laarabi:
Car sharing through the data analysis lens. CoRR abs/1708.00497 (2017) - 2016
- [c5]Mohamed Haitam Laarabi, Raffaele Bruno:
A Generic Software Framework for Carsharing Modelling Based on a Large-Scale Multi-agent Traffic Simulation Platform. ABMUS@AAMAS 2016: 88-111 - [c4]Luca Zero, Chiara Bersani, Roberto Sacile, Mohamed Haitam Laarabi:
Bi-objective shortest path problem with one fuzzy cost function applied to dangerous goods transportation on a road network. SoSE 2016: 1-5 - 2014
- [c3]Mohamed Haitam Laarabi, Azedine Boulmakoul, Aziz Mabrouk, Roberto Sacile, Emmanuel Garbolino:
Real-timefastest path algorithm using bidirectional point-to-point search on a Fuzzy Time-Dependent transportation network. ICALT 2014: 78-84 - 2013
- [c2]Mohamed Haitam Laarabi, Claudio Roncoli, Roberto Sacile, Azedine Boulmakoul, Emmanuel Garbolino:
An overview of a multiagent-based simulation system for dynamic management of risk related to Dangerous Goods Transport. SysCon 2013: 830-835 - [c1]Azedine Boulmakoul, Mohamed Haitam Laarabi, Roberto Sacile, Emmanuel Garbolino:
Ranking Triangular Fuzzy Numbers Using Fuzzy Set Inclusion Index. WILF 2013: 100-108
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-05-08 21:03 CEST 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:
