Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaria Predari
Person information
- affiliation: Humboldt University of Berlin, Department of Computer Science, Germany
- affiliation: University of Bordeaux, LaBRI, Talence, France
- affiliation: University of Patras, CEID, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Maria Predari, Lukas Berner, Robert Kooij, Henning Meyerhenke:
Greedy optimization of resistance-based graph robustness with global and local edge insertions. Soc. Netw. Anal. Min. 13(1): 130 (2023)- [i7]Maria Predari, Lukas Berner, Robert Kooij, Henning Meyerhenke:
Greedy Optimization of Resistance-based Graph Robustness with Global and Local Edge Insertions. CoRR abs/2309.08271 (2023) - 2022
- [c11]Maria Predari, Robert Kooij, Henning Meyerhenke:
Faster Greedy Optimization of Resistance-based Graph Robustness. ASONAM 2022: 1-8 - [c10]Alexander van der Grinten, Maria Predari, Florian Willich:
A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks. SEA 2022: 11:1-11:18 - 2021
- [c9]Maria Predari, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke:
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. Euro-Par 2021: 167-182 - [c8]Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke:
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. SDM 2021: 136-144 - [i6]Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke:
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. CoRR abs/2101.06192 (2021) - [i5]Maria Predari, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke
:
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. CoRR abs/2107.02539 (2021) - 2020
- [c7]Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke:
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. ESA 2020: 6:1-6:24 - [c6]Charilaos Tzovas, Maria Predari, Henning Meyerhenke:
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study. HiPC 2020: 72-81 - [i4]Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke:
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. CoRR abs/2006.13679 (2020) - [i3]Charilaos Tzovas, Maria Predari, Henning Meyerhenke:
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study. CoRR abs/2011.01814 (2020)
2010 – 2019
- 2019
- [j2]Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas:
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms 12(7): 127 (2019) - [i2]Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas:
Guidelines for Experimental Algorithmics in Network Analysis. CoRR abs/1904.04690 (2019) - 2018
- [c5]Roland Glantz, Maria Predari, Henning Meyerhenke:
Topology-induced Enhancement of Mappings. ICPP 2018: 9:1-9:10 - [i1]Roland Glantz, Maria Predari, Henning Meyerhenke:
Topology-induced Enhancement of Mappings. CoRR abs/1804.07131 (2018) - 2017
- [j1]Maria Predari, Aurélien Esnard, Jean Roman:
Comparison of initial partitioning methods for multilevel direct k-way graph partitioning with fixed vertices. Parallel Comput. 66: 22-39 (2017) - 2016
- [b1]Maria Predari:
Load Balancing for Parallel Coupled Simulations. (Equilibrage de la charge de codes couplés massivement parallèles). University of Bordeaux, France, 2016 - [c4]Maria Predari, Aurélien Esnard:
A k-Way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications. PDP 2016: 280-287 - 2014
- [c3]Maria Predari, Aurélien Esnard:
Coupling-aware graph partitioning algorithms: Preliminary study. HiPC 2014: 1-10 - 2013
- [c2]Eugenia-Maria Kontopoulou, Maria Predari, Efstratios Gallopoulos:
Onomatology and content analysis of ergodic literature. NHT@HT 2013: 5 - 2012
- [c1]Eugenia-Maria Kontopoulou, Maria Predari, Thymios Kostakis, Efstratios Gallopoulos:
Graph and matrix metrics to analyze ergodic literature for children. HT 2012: 133-142
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 2023-11-02 23:52 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:
