


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Eduard Eiben
Royal Holloway, University of London, UK
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 131 matches
- 2024
- Argyrios Deligkas
, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
:
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. Inf. Comput. 299: 105171 (2024) - Argyrios Deligkas
, Eduard Eiben, Tiger-Lily Goldsmith:
The parameterized complexity of welfare guarantees in Schelling segregation. Theor. Comput. Sci. 1017: 114783 (2024) - Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
:
Learning Small Decision Trees for Data of Low Rank-Width. AAAI 2024: 10476-10483 - Argyrios Deligkas
, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
:
The Complexity of Fair Division of Indivisible Items with Externalities. AAAI 2024: 9653-9661 - Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS 2024: 425-433 - Argyrios Deligkas
, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP 2024: 53:1-53:18 - Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich:
Individual Rationality in Topological Distance Games Is Surprisingly Hard. IJCAI 2024: 2782-2790 - Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. SODA 2024: 377-423 - Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Bi-objective Optimization in Role Mining. CoRR abs/2403.16757 (2024) - Argyrios Deligkas
, Eduard Eiben, Dusan Knop, Simon Schierreich
:
Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR abs/2404.14128 (2024) - Argyrios Deligkas
, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR abs/2404.15950 (2024) - Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. CoRR abs/2407.10699 (2024) - Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit:
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs. CoRR abs/2408.17107 (2024) - Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna:
EF1 and EFX Orientations. CoRR abs/2409.13616 (2024) - 2023
- Eduard Eiben
, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
:
Parameterized complexity of envy-free resource allocation in social networks. Artif. Intell. 315: 103826 (2023) - Jungho Ahn
, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica 85(10): 3058-3087 (2023) - Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
:
On the parameterized complexity of clustering problems for incomplete data. J. Comput. Syst. Sci. 134: 1-19 (2023) - Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
:
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940(Part): 222-230 (2023) - Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI 2023: 6313-6321 - Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS 2023: 2860-2862 - Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas:
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. AAMAS 2023: 2222-2230 - Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. SoCG 2023: 28:1-28:16 - Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. ICML 2023: 9060-9070 - Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
:
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI 2023: 2642-2650 - Argyrios Deligkas, Eduard Eiben, George Skretas
:
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. IJCAI 2023: 5333-5340 - Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani
, Stefan Szeider
:
Learning Small Decision Trees with Large Domain. IJCAI 2023: 3184-3192 - Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC 2023: 16:1-16:14 - Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS 2023: 45:1-45:15 - Argyrios Deligkas
, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas:
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source. CoRR abs/2303.11703 (2023) - Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. CoRR abs/2304.02091 (2023)
skipping 101 more matches
loading more results
failed to load more results, please try again later

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.
retrieved on 2025-02-14 22:27 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint