Остановите войну!
for scientists:
default search action
Robert Ganian
- > Home > Persons > Robert Ganian
Publications
- 2023
- [j46]Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
Parameterized complexity of envy-free resource allocation in social networks. Artif. Intell. 315: 103826 (2023) - [j43]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) - [c98]Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI 2023: 6313-6321 - [c95]Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. SoCG 2023: 28:1-28:16 - [c92]Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. ICML 2023: 9060-9070 - [c91]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 - [i60]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. CoRR abs/2312.07043 (2023) - [i59]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. CoRR abs/2312.07103 (2023) - [i58]Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. CoRR abs/2312.07144 (2023) - [i57]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. CoRR abs/2312.07628 (2023) - [i55]Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. CoRR abs/2312.08385 (2023) - 2022
- [j36]Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj:
On Covering Segments with Unit Intervals. SIAM J. Discret. Math. 36(2): 1200-1230 (2022) - [c83]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. ESA 2022: 47:1-47:14 - [c79]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. IJCAI 2022: 237-243 - [c78]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 - 2021
- [j33]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) - [j30]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) - [j28]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) - [c73]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Parameterized Complexity of Clustering Incomplete Data. AAAI 2021: 7296-7304 - [c70]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Parameterized Complexity of Connected Fair Division. IJCAI 2021: 139-145 - [i40]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) - 2020
- [j25]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci. 110: 1-21 (2020) - [c66]Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. AAAI 2020: 7135-7142 - [c63]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. ICALP 2020: 43:1-43:19 - [c58]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 - [c57]Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj:
On Covering Segments with Unit Intervals. STACS 2020: 13:1-13:17 - [i37]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. CoRR abs/2004.12222 (2020) - [i36]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) - [i34]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. CoRR abs/2012.00079 (2020) - 2019
- [j21]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 81(4): 1657-1683 (2019) - [c56]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI 2019: 1477-1484 - [c50]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. IPCO 2019: 194-204 - [c49]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 - [c48]Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider:
The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS 2019: 7666-7676 - [i29]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) - [i28]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On Clustering Incomplete Data. CoRR abs/1911.01465 (2019) - 2018
- [j16]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. Algorithmica 80(2): 742-771 (2018) - [j15]Eduard Eiben, Robert Ganian, Juho Lauri:
On the complexity of rainbow coloring problems. Discret. Appl. Math. 246: 38-48 (2018) - [j14]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using well-structured modulators. Discret. Appl. Math. 248: 153-167 (2018) - [j13]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) - [c44]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
A Structural Approach to Activity Selection. IJCAI 2018: 203-209 - [c43]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Unary Integer Linear Programming with Structural Restrictions. IJCAI 2018: 1284-1290 - [c42]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Small Resolution Proofs for QBF using Dependency Treewidth. STACS 2018: 28:1-28:15 - 2017
- [c39]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 - [c37]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 - [i21]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) - [i18]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Small Resolution Proofs for QBF using Dependency Treewidth. CoRR abs/1711.02120 (2017) - 2016
- [c32]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Using Decomposition-Parameters for QBF: Mind the Prefix! AAAI 2016: 964-970 - [c30]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. ESA 2016: 39:1-39:18 - [c28]Eduard Eiben, Robert Ganian, O-joung Kwon:
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. MFCS 2016: 34:1-34:14 - [i17]Eduard Eiben, Robert Ganian, O-joung Kwon:
A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion. CoRR abs/1604.06056 (2016) - 2015
- [c24]Eduard Eiben, Robert Ganian, Juho Lauri:
On the Complexity of Rainbow Coloring Problems. IWOCA 2015: 209-220 - [c23]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using Well-structured Modulators. IPEC 2015: 114-126 - [c19]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. WADS 2015: 314-326 - [i11]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. CoRR abs/1507.05463 (2015) - [i10]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-Kernelization using Well-Structured Modulators. CoRR abs/1507.05544 (2015) - [i9]Eduard Eiben, Robert Ganian, Juho Lauri:
On the Complexity of Rainbow Coloring Problems. CoRR abs/1510.03614 (2015)
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-07 23:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint