default search action
Emmanuel Arrighi
Person information
- affiliation: University of Trier, Germany
- affiliation (former): University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2026
- [j3]Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf:
Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs. Discret. Appl. Math. 378: 102-119 (2026) - 2025
- [j2]Emmanuel Arrighi, Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi, Petra Wolf:
Defensive Alliances in Signed Networks. J. Artif. Intell. Res. 82: 2189-2232 (2025) - 2023
- [j1]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Order Reconfiguration under Width Constraints. J. Graph Algorithms Appl. 27(6): 409-431 (2023)
Conference and Workshop Papers
- 2023
- [c10]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Synchronization and Diversity of Solutions. AAAI 2023: 11516-11524 - [c9]Emmanuel Arrighi, Fedor V. Fomin
, Petr A. Golovach, Petra Wolf:
Kernelizing Temporal Exploration Problems. IPEC 2023: 1:1-1:18 - [c8]Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange
Cluster Editing with Overlapping Communities. IPEC 2023: 2:1-2:12 - [c7]Emmanuel Arrighi, Pål Grønås Drange
PACE Solver Description: Zygosity. IPEC 2023: 39:1-39:3 - [c6]Emmanuel Arrighi
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM 2023: 283-297 - 2021
- [c5]Emmanuel Arrighi, Henning Fernau
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS 2021: 34:1-34:15 - [c4]Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf:
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI 2021: 10-16 - [c3]Emmanuel Arrighi, Henning Fernau
Order Reconfiguration Under Width Constraints. MFCS 2021: 8:1-8:15 - [c2]Emmanuel Arrighi, Mateus de Oliveira Oliveira
Three Is Enough for Steiner Trees. SEA 2021: 5:1-5:15 - 2020
- [c1]Emmanuel Arrighi
Width Notions for Ordering-Related Problems. FSTTCS 2020: 9:1-9:18
Informal and Other Publications
- 2023
- [i5]Emmanuel Arrighi, Fedor V. Fomin
Kernelizing Temporal Exploration Problems. CoRR abs/2302.10110 (2023) - [i4]Emmanuel Arrighi, Zhidan Feng
Defensive Alliances in Signed Networks. CoRR abs/2309.06801 (2023) - 2022
- [i3]Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf:
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs. CoRR abs/2203.07401 (2022) - 2021
- [i2]Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf:
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. CoRR abs/2105.09413 (2021) - [i1]Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf:
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. CoRR abs/2110.01279 (2021)
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 2025-07-29 19:48 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: