default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEduard Eiben
Person information
- affiliation: Royal Holloway, University of London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j25]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)- [j24]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The parameterized complexity of welfare guarantees in Schelling segregation. Theor. Comput. Sci. 1017: 114783 (2024) - [c59]Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich:
The Complexity of Fair Division of Indivisible Items with Externalities. AAAI 2024: 9653-9661 - [c58]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 - [c57]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS 2024: 425-433 - [c56]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 - [c55]Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich:
Individual Rationality in Topological Distance Games Is Surprisingly Hard. IJCAI 2024: 2782-2790 - [c54]Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. SODA 2024: 377-423 - [i47]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Bi-objective Optimization in Role Mining. CoRR abs/2403.16757 (2024) - [i46]Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich:
Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR abs/2404.14128 (2024) - [i45]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR abs/2404.15950 (2024) - [i44]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) - [i43]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) - [i42]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna:
EF1 and EFX Orientations. CoRR abs/2409.13616 (2024) - 2023
- [j23]Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
Parameterized complexity of envy-free resource allocation in social networks. Artif. Intell. 315: 103826 (2023) - [j22]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica 85(10): 3058-3087 (2023) - [j21]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) - [j20]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) - [c53]Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI 2023: 6313-6321 - [c52]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 - [c51]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. AAMAS 2023: 2860-2862 - [c50]Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. SoCG 2023: 28:1-28:16 - [c49]Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. ICML 2023: 9060-9070 - [c48]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 - [c47]Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider:
Learning Small Decision Trees with Large Domain. IJCAI 2023: 3184-3192 - [c46]Argyrios Deligkas, Eduard Eiben, George Skretas:
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. IJCAI 2023: 5333-5340 - [c45]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 - [c44]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS 2023: 45:1-45:15 - [i41]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) - [i40]Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. CoRR abs/2304.02091 (2023) - [i39]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR abs/2305.07124 (2023) - [i38]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR abs/2307.01109 (2023) - [i37]Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich:
The Complexity of Fair Division of Indivisible Items with Externalities. CoRR abs/2308.08869 (2023) - [i36]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR abs/2311.02708 (2023) - [i35]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Some coordination problems are harder than others. CoRR abs/2311.03195 (2023) - [i34]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. CoRR abs/2312.07043 (2023) - [i33]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. CoRR abs/2312.07103 (2023) - [i32]Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. CoRR abs/2312.07144 (2023) - [i31]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. CoRR abs/2312.07628 (2023) - [i30]Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. CoRR abs/2312.08385 (2023) - 2022
- [j19]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. Algorithmica 84(9): 2767-2784 (2022) - [j18]Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj:
On Covering Segments with Unit Intervals. SIAM J. Discret. Math. 36(2): 1200-1230 (2022) - [j17]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. 25(4): 28:1-28:32 (2022) - [c43]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. ESA 2022: 47:1-47:14 - [c42]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. IJCAI 2022: 237-243 - [c41]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
Parameterized Complexity of Hotelling-Downs with Party Nominees. IJCAI 2022: 244-250 - [c40]Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon:
A Unifying Framework for Characterizing and Computing Width Measures. ITCS 2022: 63:1-63:23 - [c39]Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the Parameterized Complexity of Symmetric Directed Multicut. IPEC 2022: 11:1-11:17 - [c38]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Generalized Noise Role Mining. SACMAT 2022: 91-102 - [c37]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
On the Lossy Kernelization for Connected Treedepth Deletion Set. WG 2022: 201-214 - [i29]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith:
The Parameterized Complexity of Welfare Guarantees in Schelling Segregation. CoRR abs/2201.06904 (2022) - [i28]Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the parameterized complexity of symmetric directed multicut. CoRR abs/2208.09017 (2022) - [i27]Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR abs/2212.00418 (2022) - 2021
- [j16]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. 300: 103561 (2021) - [j15]Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 83(5): 1201-1221 (2021) - [j14]Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad:
Bisection of bounded treewidth graphs by convolutions. J. Comput. Syst. Sci. 119: 125-132 (2021) - [j13]Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon:
Measuring what matters: A hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci. 121: 57-75 (2021) - [c36]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Parameterized Complexity of Clustering Incomplete Data. AAAI 2021: 7296-7304 - [c35]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Parameterized Complexity of Connected Fair Division. IJCAI 2021: 139-145 - [c34]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem. SACMAT 2021: 83-94 - [c33]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. SODA 2021: 2649-2659 - [i26]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem: Theory and Experiments. CoRR abs/2106.05761 (2021) - [i25]Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon:
A Unifying Framework for Characterizing and Computing Width Measures. CoRR abs/2109.14610 (2021) - [i24]Argyrios Deligkas, Eduard Eiben, George Skretas:
Minimizing Reachability Times on Temporal Graphs via Shifting Labels. CoRR abs/2112.08797 (2021) - [i23]Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference Swaps for the Stable Matching Problem. CoRR abs/2112.15361 (2021) - 2020
- [j12]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci. 110: 1-21 (2020) - [j11]Eduard Eiben, Carl Feghali:
Toward Cereceda's conjecture for planar graphs. J. Graph Theory 94(2): 267-277 (2020) - [j10]Eduard Eiben, Iyad Kanj:
A Colored Path Problem and Its Applications. ACM Trans. Algorithms 16(4): 47:1-47:48 (2020) - [c32]Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:
Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI 2020: 1902-1909 - [c31]Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. AAAI 2020: 7135-7142 - [c30]Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia:
On the Problem of Covering a 3-D Terrain. AAAI 2020: 10361-10368 - [c29]Eduard Eiben, Daniel Lokshtanov:
Removing Connected Obstacles in the Plane Is FPT. SoCG 2020: 39:1-39:14 - [c28]Eduard Eiben, William Lochet:
A Polynomial Kernel for Line Graph Deletion. ESA 2020: 42:1-42:15 - [c27]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. ICALP 2020: 43:1-43:19 - [c26]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. IPEC 2020: 2:1-2:16 - [c25]Eduard Eiben, William Lochet, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. IPEC 2020: 10:1-10:15 - [c24]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A Polynomial Kernel for 3-Leaf Power Deletion. MFCS 2020: 5:1-5:14 - [c23]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. MFCS 2020: 31:1-31:16 - [c22]Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj:
On Covering Segments with Unit Intervals. STACS 2020: 13:1-13:17 - [i22]Eduard Eiben, Daniel Lokshtanov:
Removing Connected Obstacles in the Plane is FPT. CoRR abs/2002.01218 (2020) - [i21]Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:
Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR abs/2002.07607 (2020) - [i20]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. CoRR abs/2004.12222 (2020) - [i19]Eduard Eiben, William Lochet:
A Polynomial Kernel for Line Graph Deletion. CoRR abs/2006.15584 (2020) - [i18]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. CoRR abs/2007.05346 (2020) - [i17]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. CoRR abs/2007.06896 (2020) - [i16]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. CoRR abs/2010.09580 (2020) - [i15]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. CoRR abs/2012.00079 (2020)
2010 – 2019
- 2019
- [j9]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 81(4): 1657-1683 (2019) - [j8]Eduard Eiben, Danny Hermelin, M. S. Ramanujan:
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. J. Comput. Syst. Sci. 105: 158-170 (2019) - [j7]Eduard Eiben, Robert Jajcay, Primoz Sparl:
Symmetry properties of generalized graph truncations. J. Comb. Theory B 137: 291-315 (2019) - [j6]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. 33(3): 1743-1771 (2019) - [c21]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI 2019: 1477-1484 - [c20]Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad:
Bisection of Bounded Treewidth Graphs by Convolutions. ESA 2019: 42:1-42:11 - [c19]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. IPCO 2019: 194-204 - [c18]Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon:
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. MFCS 2019: 42:1-42:15 - [c17]Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider:
The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS 2019: 7666-7676 - [c16]Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS 2019: 25:1-25:17 - [i14]Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon:
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. CoRR abs/1908.10132 (2019) - [i13]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On Clustering Incomplete Data. CoRR abs/1911.01465 (2019) - [i12]Eduard Eiben, William Lochet, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. CoRR abs/1911.03683 (2019) - [i11]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A polynomial kernel for $3$-leaf power deletion. CoRR abs/1911.04249 (2019) - 2018
- [j5]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. Algorithmica 80(2): 742-771 (2018) - [j4]Eduard Eiben, Robert Ganian, Juho Lauri:
On the complexity of rainbow coloring problems. Discret. Appl. Math. 246: 38-48 (2018) - [j3]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using well-structured modulators. Discret. Appl. Math. 248: 153-167 (2018) - [j2]Eduard Eiben, Robert Ganian, O-joung Kwon:
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. J. Comput. Syst. Sci. 97: 121-146 (2018) - [c15]Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl:
Improved Results for Minimum Constraint Removal. AAAI 2018: 6477-6484 - [c14]Eduard Eiben, Iyad A. Kanj:
How to Navigate Through Obstacles?. ICALP 2018: 48:1-48:13 - [c13]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
A Structural Approach to Activity Selection. IJCAI 2018: 203-209 - [c12]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Unary Integer Linear Programming with Structural Restrictions. IJCAI 2018: 1284-1290 - [c11]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Small Resolution Proofs for QBF using Dependency Treewidth. STACS 2018: 28:1-28:15 - [c10]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. STACS 2018: 29:1-29:15 - [i10]Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. CoRR abs/1802.08189 (2018) - [i9]Eduard Eiben, Carl Feghali:
Towards Cereceda's conjecture for planar graphs. CoRR abs/1810.00731 (2018) - 2017
- [c9]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. IJCAI 2017: 607-613 - [c8]Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS 2017: 36:1-36:15 - [c7]Eduard Eiben, Danny Hermelin, M. S. Ramanujan:
Lossy Kernels for Hitting Subgraphs. MFCS 2017: 67:1-67:14 - [i8]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. CoRR abs/1706.06084 (2017) - [i7]Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan:
Lossy Kernels for Connected Dominating Set on Sparse Graphs. CoRR abs/1706.09339 (2017) - [i6]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Small Resolution Proofs for QBF using Dependency Treewidth. CoRR abs/1711.02120 (2017) - [i5]Eduard Eiben, Iyad A. Kanj:
How to navigate through obstacles? CoRR abs/1712.04043 (2017) - 2016
- [j1]Eduard Eiben, Michal Kotrbcík:
Equimatchable Graphs on Surfaces. J. Graph Theory 81(1): 35-49 (2016) - [c6]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Using Decomposition-Parameters for QBF: Mind the Prefix! AAAI 2016: 964-970 - [c5]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. ESA 2016: 39:1-39:18 - [c4]Eduard Eiben, Robert Ganian, O-joung Kwon:
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. MFCS 2016: 34:1-34:14 - [i4]Eduard Eiben, Robert Ganian, O-joung Kwon:
A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion. CoRR abs/1604.06056 (2016) - 2015
- [c3]Eduard Eiben, Robert Ganian, Juho Lauri:
On the Complexity of Rainbow Coloring Problems. IWOCA 2015: 209-220 - [c2]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using Well-structured Modulators. IPEC 2015: 114-126 - [c1]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. WADS 2015: 314-326 - [i3]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. CoRR abs/1507.05463 (2015) - [i2]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-Kernelization using Well-Structured Modulators. CoRR abs/1507.05544 (2015) - [i1]Eduard Eiben, Robert Ganian, Juho Lauri:
On the Complexity of Rainbow Coloring Problems. CoRR abs/1510.03614 (2015)
Coauthor Index
[c56] [i45] [i44] [j23] [j21] [c53] [c50] [c49] [c45] [i34] [i33] [i32] [i31] [i30] [j18] [c43] [c42] [c40] [j16] [j15] [j13] [c36] [c35] [i25] [j12] [c31] [c27] [c23] [c22] [i20] [i18] [i15] [j9] [c21] [c19] [c18] [c17] [i14] [i13] [j5] [j4] [j3] [j2] [c13] [c12] [c11] [c9] [c8] [i8] [i6] [c6] [c5] [c4] [i4] [c3] [c2] [c1] [i3] [i2] [i1]
Iyad Kanj
aka: Iyad A. Kanj
aka: Iyad A. Kanj
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-21 21:26 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:
