default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad-Ali Rostami
Person information
- affiliation: University of Leipzig, Database Group, Germany
- affiliation: University of Jena, Institute for Computer Science, Germany
- affiliation (former): Islamic Azad University, Nourabad Mamasani, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c15]Kevin Gómez, Matthias Täschner
, M. Ali Rostami, Christopher Rost, Erhard Rahm:
Graph Sampling with Distributed In-Memory Dataflow Systems. BTW 2021: 303-312- 2020
- [c14]M. Ali Rostami, H. Martin Bücker:
Preconditioning Jacobian Systems by Superimposing Diagonal Blocks. ICCS (2) 2020: 101-115 - [c13]Mohammad-Ali Rostami, H. Martin Bücker:
An Inexact Combinatorial Model for Maximizing the Number of Discovered Nonzero Entries. CSC 2020: 32-42
2010 – 2019
- 2019
- [j9]M. Ali Rostami, Matthias Kricke, Eric Peukert, Stefan Kühne, Moritz Wilke, Steffen Dienst, Erhard Rahm:
BIGGR: Bringing Gradoop to Applications. Datenbank-Spektrum 19(1): 51-60 (2019) - [c12]M. Ali Rostami, Eric Peukert, Moritz Wilke, Erhard Rahm:
Big graph analysis by visually created workflows. BTW 2019: 559-563 - [c11]M. Ali Rostami, H. Martin Bücker:
Redesigning Interactive Educational Modules for Combinatorial Scientific Computing. ICCS (5) 2019: 363-373 - [i1]Kevin Gómez, Matthias Täschner, M. Ali Rostami, Christopher Rost, Erhard Rahm:
Graph Sampling with Distributed In-Memory Dataflow Systems. CoRR abs/1910.04493 (2019) - 2018
- [j8]Suresh Elumalai, Toufik Mansour, Mohammad-Ali Rostami:
New bounds on the hyper-Zagreb index for the simple connected graphs. Electron. J. Graph Theory Appl. 6(1): 166-177 (2018) - [c10]M. Ali Rostami, Alieh Saeedi, Eric Peukert, Erhard Rahm:
Interactive Visualization of Large Similarity Graphs and Entity Resolution Clusters. EDBT 2018: 690-693 - 2016
- [c9]H. Martin Bücker, Michael Lülfesmann, M. Ali Rostami:
Enabling Implicit Time Integration for Compressible Flows by Partial Coloring: A Case Study of a Semi-matrix-free Preconditioning Technique. CSC 2016: 23-32 - 2015
- [j7]Abdolmohamad Davodi, Khodakhast Esapour, Alireza Zare, Mohammad-Ali Rostami:
A modified KH algorithm to solve the optimal reconfiguration problem in the presence of distributed generations. J. Intell. Fuzzy Syst. 28(1): 383-391 (2015) - [j6]Abdollah Kavousi-Fard, Mohammad-Reza Akbari-Zadeh, Farzaneh Kavousi-Fard, Mohammad-Ali Rostami:
Effect of wind turbine on the economic load dispatch problem considering the wind speed uncertainty. J. Intell. Fuzzy Syst. 28(2): 693-705 (2015) - [j5]Abdollah Kavousi-Fard, Reza Khorram-Nia, Mohammad-Ali Rostami, Alireza Abbasi:
An smart stochastic approach to model plug-in hybrid electric vehicles charging effect in the optimal operation of micro-grids. J. Intell. Fuzzy Syst. 28(2): 835-842 (2015) - [j4]Mohammad-Ali Rostami, Mahdi Raoofat, Alireza Abunasri, Abdollah Kavousi-Fard:
Smart automated distribution system considering plug-in hybrid electric vehicle. J. Intell. Fuzzy Syst. 28(6): 2481-2492 (2015) - [j3]Mohammad-Ali Rostami, Abdollah Kavousi-Fard, Taher Niknam:
Expected Cost Minimization of Smart Grids With Plug-In Hybrid Electric Vehicles Using Optimal Distribution Feeder Reconfiguration. IEEE Trans. Ind. Informatics 11(2): 388-397 (2015) - [j2]Abdollah Kavousi-Fard, Mohammad-Ali Rostami, Taher Niknam:
Reliability-Oriented Reconfiguration of Vehicle-to-Grid Networks. IEEE Trans. Ind. Informatics 11(3): 682-691 (2015) - [c8]M. Ali Rostami, H. Martin Bücker:
An Educational Module Illustrating How Sparse Matrix-Vector Multiplication on Parallel Processors Connects to Graph Partitioning. Euro-Par Workshops 2015: 135-146 - [c7]M. Ali Rostami, H. Martin Bücker:
Interactively Exploring the Connection between Bidirectional Compression and Star Bicoloring. ICCS 2015: 1917-1926 - 2014
- [j1]Aliasghar Baziar, Mohammad-Ali Rostami, Mohammad-Reza Akbari-Zadeh:
An intelligent approach based on bat algorithm for solving economic dispatch with practical constraints. J. Intell. Fuzzy Syst. 27(3): 1601-1607 (2014) - [c6]M. Ali Rostami, H. Martin Bücker, Azin Azadi:
Illustrating a Graph Coloring Algorithm Based on the Principle of Inclusion and Exclusion Using GraphTea. EC-TEL 2014: 514-517 - [c5]Ralf Seidler, H. Martin Bücker, M. Ali Rostami, David Neuhäuser:
On the Design of the EFCOSS Software Architecture When Using Parallel and Distributed Computing. ICSOFT EA 2014: 445-454 - [c4]M. Ali Rostami, H. Martin Bücker:
Interactive Educational Modules Illustrating Sparse Matrix Computations and their Corresponding Graph Problems. Informatiktage 2014: 253-256 - [c3]H. Martin Bücker, M. Ali Rostami:
Interactively Exploring the Connection between Nested Dissection Orderings for Parallel Cholesky Factorization and Vertex Separators. IPDPS Workshops 2014: 1122-1129 - [c2]M. Ali Rostami, H. Martin Bücker:
Preservation of non-uniform memory architecture characteristics when going from a nested OpenMP to a hybrid MPI/OpenMP approach. SIMULTECH 2014: 286-291 - [c1]M. Ali Rostami, H. Martin Bücker, Christian Vogt, Ralf Seidler, David Neuhäuser, Volker Rath:
A Distributed-Memory Parallelization of a Shared-Memory Parallel Ensemble Kalman Filter. SYNASC 2014: 455-462
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-10-15 21:36 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:
