![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Zeina Abu-Aisheh
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j5]Zeina Abu-Aisheh
, Romain Raveaux, Jean-Yves Ramel
:
Efficient k-nearest neighbors search in graph space. Pattern Recognit. Lett. 134: 77-86 (2020)
2010 – 2019
- 2018
- [j4]Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel
, Patrick Martineau:
A parallel graph edit distance algorithm. Expert Syst. Appl. 94: 41-57 (2018) - [c7]Zeina Abu-Aisheh, Sébastien Bougleux
, Olivier Lézoray:
p-Laplacian Regularization of Signals on Directed Graphs. ISVC 2018: 650-661 - 2017
- [j3]Julien Lerouge, Zeina Abu-Aisheh, Romain Raveaux, Pierre Héroux
, Sébastien Adam:
New binary linear programming formulation to compute the graph edit distance. Pattern Recognit. 72: 254-265 (2017) - [j2]Zeina Abu-Aisheh, Benoit Gaüzère, Sébastien Bougleux
, Jean-Yves Ramel
, Luc Brun, Romain Raveaux, Pierre Héroux
, Sébastien Adam:
Graph edit distance contest: Results and future challenges. Pattern Recognit. Lett. 100: 96-103 (2017) - [c6]Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel
:
Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy. GbRPR 2017: 197-207 - [c5]Frédéric Rayar, Zeina Abu-Aisheh:
Photo(Graph) Gallery: An "Exhibition" of Graph Classification. IV 2017: 262-267 - 2016
- [b1]Zeina Abu-Aisheh:
Approches anytime et distribuées pour l'appariment de graphes. (Anytime and distributed approaches for graph matching). François Rabelais University, Tours, France, 2016 - [j1]Zeina Abu-Aisheh
, Romain Raveaux, Jean-Yves Ramel
:
Anytime graph matching. Pattern Recognit. Lett. 84: 215-224 (2016) - [c4]Julien Lerouge, Zeina Abu-Aisheh, Romain Raveaux, Pierre Héroux
, Sébastien Adam:
Exact Graph Edit Distance Computation Using a Binary Linear Program. S+SSPR 2016: 485-495 - 2015
- [c3]Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel
:
A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance. GbRPR 2015: 138-147 - [c2]Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel, Patrick Martineau:
An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems. ICPRAM (1) 2015: 271-278 - [i1]Julien Lerouge, Zeina Abu-Aisheh, Romain Raveaux, Pierre Héroux
, Sébastien Adam:
Graph edit distance : a new binary linear programming formulation. CoRR abs/1505.05740 (2015) - 2014
- [c1]Dimitri Masson
, Alexandre Demeure, Zeina Abu-Aisheh, Gaëlle Calvary, Gilles Bisson:
Web design galleries: please give me similar styles!: a claim for ground truth datasets. NordiCHI 2014: 357-360
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint