default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Ganian
Person information
- affiliation: Technische Universität Wien, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j49]Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. Algorithmica 86(8): 2714-2738 (2024)- [j48]Martin Balko
, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. 38(2): 1537-1565 (2024) - [j47]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20(3): 19 (2024) - [c103]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The Complexity of Optimizing Atomic Congestion. AAAI 2024: 20044-20052 - [c102]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 - [c101]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP 2024: 68:1-68:18 - [c100]Jakub Balabán, Robert Ganian, Mathis Rocton:
Computing Twin-Width Parameterized by the Feedback Edge Number. STACS 2024: 7:1-7:19 - [i75]Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger:
The Boundaries of Tractability in Hierarchical Task Network Planning. CoRR abs/2401.14174 (2024) - [i74]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR abs/2404.14087 (2024) - [i73]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR abs/2404.15950 (2024) - [i72]Robert Ganian, Hung P. Hoang, Simon Wietheger:
Parameterized Complexity of Efficient Sortation. CoRR abs/2404.16741 (2024) - [i71]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) - [i70]Jakub Balabán, Robert Ganian, Mathis Rocton:
Twin-Width Meets Feedback Edges and Vertex Integrity. CoRR abs/2407.15514 (2024) - [i69]Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity of Extending Stack Layouts. CoRR abs/2409.02833 (2024) - 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) - [j45]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic diversity games: A complexity picture with more than two colors. Artif. Intell. 325: 104017 (2023) - [j44]Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. Algorithmica 85(5): 1111-1155 (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) - [j42]Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Worbel: Aggregating Point Labels into Word Clouds. ACM Trans. Spatial Algorithms Syst. 9(3): 19:1-19:32 (2023) - [c99]Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov:
The Parameterized Complexity of Network Microaggregation. AAAI 2023: 6262-6270 - [c98]Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI 2023: 6313-6321 - [c97]Cornelius Brand, Robert Ganian, Kirill Simonov:
A Parameterized Theory of PAC Learning. AAAI 2023: 6834-6841 - [c96]Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG 2023: 18:1-18:16 - [c95]Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. SoCG 2023: 28:1-28:16 - [c94]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA 2023: 18:1-18:18 - [c93]Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager:
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. GD (2) 2023: 66-81 - [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 - [c90]Robert Ganian, Liana Khazaliya, Kirill Simonov:
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. IPEC 2023: 18:1-18:17 - [c89]Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. LICS 2023: 1-14 - [c88]Cornelius Brand, Robert Ganian, Mathis Rocton:
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training. NeurIPS 2023 - [c87]Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý:
Maximizing Social Welfare in Score-Based Social Distance Games. TARK 2023: 272-286 - [i68]Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable. CoRR abs/2302.10046 (2023) - [i67]Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. CoRR abs/2304.13896 (2023) - [i66]Cornelius Brand, Robert Ganian, Kirill Simonov:
A Parameterized Theory of PAC Learning. CoRR abs/2304.14058 (2023) - [i65]Jan Dreier, Robert Ganian, Thekla Hamm:
Approximate Evaluation of Quantitative Second Order Queries. CoRR abs/2305.02056 (2023) - [i64]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR abs/2307.01285 (2023) - [i63]Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager:
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. CoRR abs/2308.10600 (2023) - [i62]Robert Ganian, Liana Khazaliya, Kirill Simonov:
Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity. CoRR abs/2308.11416 (2023) - [i61]Jakub Balabán, Robert Ganian, Mathis Rocton:
Computing Twin-Width Parameterized by the Feedback Edge Number. CoRR abs/2310.08243 (2023) - [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) - [i56]Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý:
Maximizing Social Welfare in Score-Based Social Distance Games. CoRR abs/2312.07632 (2023) - [i55]Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. CoRR abs/2312.08385 (2023) - [i54]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The Complexity of Optimizing Atomic Congestion. CoRR abs/2312.10219 (2023) - [i53]Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya:
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). Dagstuhl Reports 13(4): 58-97 (2023) - 2022
- [j41]Robert Ganian, Thekla Hamm, Topi Talvitie:
An efficient algorithm for counting Markov equivalent DAGs. Artif. Intell. 304: 103648 (2022) - [j40]Robert Ganian, Jan Kratochvíl, Stefan Szeider:
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. Discret. Appl. Math. 312: 1-2 (2022) - [j39]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. 73: 535-552 (2022) - [j38]Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. J. Artif. Intell. Res. 74: 1687-1713 (2022) - [j37]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. J. Graph Algorithms Appl. 26(3): 335-352 (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) - [j35]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. SIAM J. Discret. Math. 36(4): 2635-2666 (2022) - [c86]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. AAAI 2022: 5034-5042 - [c85]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Parameterized Algorithms for Upward Planarity. SoCG 2022: 26:1-26:16 - [c84]Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. ESA 2022: 11:1-11:13 - [c83]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. ESA 2022: 47:1-47:14 - [c82]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Testing Upward Planarity of Partial 2-Trees. GD 2022: 175-187 - [c81]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ICALP 2022: 66:1-66:20 - [c80]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Complexity of k-Means Clustering when Little is Known. ICML 2022: 6960-6987 - [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 - [c77]Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. IPEC 2022: 15:1-15:18 - [c76]Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width. SAT 2022: 15:1-15:17 - [c75]Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna:
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. WG 2022: 98-113 - [e1]Stefan Szeider, Robert Ganian, Alexandra Silva:
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria. LIPIcs 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-256-3 [contents] - [d1]Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width: Experimental Results. Zenodo, 2022
- [i52]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. CoRR abs/2202.09210 (2022) - [i51]Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna:
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. CoRR abs/2202.13661 (2022) - [i50]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Parameterized Algorithms for Upward Planarity. CoRR abs/2203.05364 (2022) - [i49]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. CoRR abs/2206.00752 (2022) - [i48]Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width. CoRR abs/2206.01706 (2022) - [i47]Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. CoRR abs/2206.15091 (2022) - [i46]Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and computing obstacle numbers of graphs. CoRR abs/2206.15414 (2022) - [i45]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Testing Upward Planarity of Partial 2-Trees. CoRR abs/2208.12548 (2022) - [i44]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. CoRR abs/2210.06845 (2022) - [i43]André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. CoRR abs/2210.07040 (2022) - 2021
- [j34]Robert Ganian, Stefan Szeider:
New width parameters for SAT and #SAT. Artif. Intell. 295: 103460 (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) - [j32]Robert Ganian, Fabian Klute, Sebastian Ordyniak:
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Algorithmica 83(1): 297-336 (2021) - [j31]Robert Ganian, Sebastian Ordyniak:
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. Algorithmica 83(2): 726-752 (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) - [j29]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica 83(6): 1605-1637 (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) - [j27]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. J. Graph Algorithms Appl. 25(1): 481-512 (2021) - [c74]Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Object Association in Multiple Object Tracking. AAAI 2021: 1388-1396 - [c73]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Parameterized Complexity of Clustering Incomplete Data. AAAI 2021: 7296-7304 - [c72]Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Worbel: Aggregating Point Labels into Word Clouds. SIGSPATIAL/GIS 2021: 256-267 - [c71]Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber:
Crossing-Optimal Extension of Simple Drawings. ICALP 2021: 72:1-72:17 - [c70]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Parameterized Complexity of Connected Fair Division. IJCAI 2021: 139-145 - [c69]Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with Two Moplexes. LAGOS 2021: 248-256 - [c68]Robert Ganian, Viktoriia Korchemna:
The Complexity of Bayesian Network Learning: Revisiting the Superstructure. NeurIPS 2021: 430-442 - [i42]Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with at most two moplexes. CoRR abs/2106.10049 (2021) - [i41]Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Worbel: Aggregating Point Labels into Word Clouds. CoRR abs/2109.04368 (2021) - [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) - [i39]Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi:
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports 11(6): 82-123 (2021) - 2020
- [j26]Derek G. Corneil, Robert Ganian, Andrzej Proskurowski:
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada. Discret. Appl. Math. 278: 1-2 (2020) - [j25]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci. 110: 1-21 (2020) - [j24]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. J. Graph Algorithms Appl. 24(4): 603-620 (2020) - [j23]Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider:
On Existential MSO and Its Relation to ETH. ACM Trans. Comput. Theory 12(4): 22:1-22:32 (2020) - [c67]Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. AAAI 2020: 3906-3913 - [c66]Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. AAAI 2020: 7135-7142 - [c65]Robert Ganian, Thekla Hamm, Topi Talvitie:
An Efficient Algorithm for Counting Markov Equivalent DAGs. AAAI 2020: 10136-10143 - [c64]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. GD 2020: 40-54 - [c63]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. ICALP 2020: 43:1-43:19 - [c62]Jiehua Chen, Robert Ganian, Thekla Hamm:
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. IJCAI 2020: 146-152 - [c61]Robert Ganian, Thekla Hamm, Guillaume Mescoff:
The Complexity Landscape of Resource-Constrained Scheduling. IJCAI 2020: 1741-1747 - [c60]Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. IJCAI 2020: 1898-1904 - [c59]Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. KR 2020: 392-402 - [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 - [i38]Jiehua Chen, Robert Ganian, Thekla Hamm:
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. CoRR abs/2001.10087 (2020) - [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) - [i35]