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
- 2025
[j50]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The complexity of optimizing atomic congestion. Artif. Intell. 338: 104241 (2025)- 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) - [c106]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The Complexity of Optimizing Atomic Congestion. AAAI 2024: 20044-20052 - [c105]Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity Of Extending Stack Layouts. GD 2024: 12:1-12:17 - [c104]Robert Ganian, Martin Nöllenburg, Sebastian Röder:
Minimizing Switches in Cased Graph Drawings (Poster Abstract). GD 2024: 43:1-43:3 - [c103]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 - [c102]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 - [c101]Robert Ganian, Viktoriia Korchemna, Stefan Szeider:
Revisiting Causal Discovery from a Complexity-Theoretic Perspective. IJCAI 2024: 3377-3385 - [c100]Jakub Balabán, Robert Ganian, Mathis Rocton:
Computing Twin-Width Parameterized by the Feedback Edge Number. STACS 2024: 7:1-7:19 - [i76]Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger:
The Boundaries of Tractability in Hierarchical Task Network Planning. CoRR abs/2401.14174 (2024) - [i75]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) - [i74]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR abs/2404.15950 (2024) - [i73]Robert Ganian, Hung P. Hoang, Simon Wietheger:
Parameterized Complexity of Efficient Sortation. CoRR abs/2404.16741 (2024) - [i72]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) - [i71]Jakub Balabán, Robert Ganian, Mathis Rocton:
Twin-Width Meets Feedback Edges and Vertex Integrity. CoRR abs/2407.15514 (2024) - [i70]Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity of Extending Stack Layouts. CoRR abs/2409.02833 (2024) - [i69]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR abs/2409.19410 (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]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. CoRR abs/2008.08288 (2020) - [i34]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. CoRR abs/2012.00079 (2020) - [i33]Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber:
Crossing-Optimal Extension of Simple Drawings. CoRR abs/2012.07457 (2020)
2010 – 2019
- 2019
- [j22]Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa:
Parameterized Complexity of Asynchronous Border Minimization. Algorithmica 81(1): 201-223 (2019) - [j21]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 81(4): 1657-1683 (2019) - [j20]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f-Factor Problems. Algorithmica 81(6): 2606-2632 (2019) - [j19]Robert Ganian, Sebastian Ordyniak:
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey. Algorithms 12(12): 248 (2019) - [j18]Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez:
Shrub-depth: Capturing Height of Dense Graphs. Log. Methods Comput. Sci. 15(1) (2019) - [c56]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI 2019: 1477-1484 - [c55]Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. ALENEX 2019: 117-129 - [c54]Robert Ganian, Sebastian Ordyniak, Stefan Szeider:
A Join-Based Hybrid Parameter for Constraint Satisfaction. CP 2019: 195-212 - [c53]Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. ESA 2019: 48:1-48:16 - [c52]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. GD 2019: 147-161 - [c51]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. GD 2019: 365-378 - [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 - [c47]Robert Ganian, Sebastian Ordyniak:
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. WG 2019: 190-204 - [i32]Robert Ganian, Sebastian Ordyniak, Stefan Szeider:
A Join-Based Hybrid Parameter for Constraint Satisfaction. CoRR abs/1907.12335 (2019) - [i31]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. CoRR abs/1908.05345 (2019) - [i30]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. CoRR abs/1908.08911 (2019) - [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) - [i27]Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. CoRR abs/1911.12995 (2019) - 2018
- [j17]Robert Ganian, Sebastian Ordyniak:
The complexity landscape of decompositional parameters for ILP. Artif. Intell. 257: 61-71 (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) - [c46]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. ICML 2018: 1642-1651 - [c45]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. ICTAI 2018: 733-737 - [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 - [c41]Robert Ganian, Fabian Klute, Sebastian Ordyniak:
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. STACS 2018: 33:1-33:14 - [i26]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. CoRR abs/1804.03423 (2018) - [i25]Robert Ganian, Sebastian Ordyniak:
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. CoRR abs/1808.03496 (2018) - [i24]Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. CoRR abs/1808.06954 (2018) - [i23]Robert Ganian, Sebastian Ordyniak:
The Complexity Landscape of Decompositional Parameters for ILP. CoRR abs/1809.00585 (2018) - [i22]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f -Factor Problems. CoRR abs/1812.02037 (2018) - 2017
- [j12]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Trans. Algorithms 13(2): 29:1-29:32 (2017) - [c40]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Going Beyond Primal Treewidth for (M)ILP. AAAI 2017: 815-821 - [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 - [c38]Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. ISAAC 2017: 36:1-36:13 - [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 - [c36]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoor Treewidth for SAT. SAT 2017: 20-37 - [c35]Robert Ganian, Stefan Szeider:
New Width Parameters for Model Counting. SAT 2017: 38-52 - [c34]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. STACS 2017: 36:1-36:17 - [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) - [i20]Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez:
Shrub-depth: Capturing Height of Dense Graphs. CoRR abs/1707.00359 (2017) - [i19]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. CoRR abs/1711.02076 (2017) - [i18]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Small Resolution Proofs for QBF using Dependency Treewidth. CoRR abs/1711.02120 (2017) - 2016
- [j11]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with structural parameters. J. Comput. Syst. Sci. 82(2): 333-346 (2016) - [j10]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are there any good digraph width measures? J. Comb. Theory B 116: 250-286 (2016) - [j9]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified conjunctive queries on partially ordered sets. Theor. Comput. Sci. 618: 72-84 (2016) - [j8]Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. ACM Trans. Comput. Log. 17(2): 10 (2016) - [c33]Robert Ganian, Sebastian Ordyniak:
The Complexity Landscape of Decompositional Parameters for ILP. AAAI 2016: 710-716 - [c32]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Using Decomposition-Parameters for QBF: Mind the Prefix! AAAI 2016: 964-970 - [c31]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoors to Tractable Valued CSP. CP 2016: 233-250 - [c30]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. ESA 2016: 39:1-39:18 - [c29]Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff:
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. IPDPS 2016: 638-647 - [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 - [c27]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f-Factor Problems. MFCS 2016: 41:1-41:14 - [c26]Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On Existential MSO and its Relation to ETH. MFCS 2016: 42:1-42:14 - [c25]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. SODA 2016: 1670-1681 - [i17]Eduard Eiben, Robert Ganian, O-joung Kwon:
A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion. CoRR abs/1604.06056 (2016) - [i16]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. CoRR abs/1610.03298 (2016) - [i15]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoors to Tractable Valued CSP. CoRR abs/1612.05733 (2016) - 2015
- [j7]Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska:
FO Model Checking of Interval Graphs. Log. Methods Comput. Sci. 11(4) (2015) - [j6]Robert Ganian:
Improving Vertex Cover as a Graph Parameter. Discret. Math. Theor. Comput. Sci. 17(2): 77-100 (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 - [c22]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. MFCS (2) 2015: 348-360 - [c21]Robert Ganian, Stefan Szeider:
Community Structure Inspired Algorithms for SAT and #SAT. SAT 2015: 223-237 - [c20]Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa:
Parameterized Complexity of Asynchronous Border Minimization. TAMC 2015: 428-440 - [c19]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. WADS 2015: 314-326 - [i14]Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa:
Parameterized Complexity of Asynchronous Border Minimization. CoRR abs/1503.08078 (2015) - [i13]Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff:
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. CoRR abs/1506.09100 (2015) - [i12]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. CoRR abs/1507.02479 (2015) - [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) - 2014
- [j5]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168: 88-107 (2014) - [j4]Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower bounds on the complexity of MSO1 model-checking. J. Comput. Syst. Sci. 80(1): 180-194 (2014) - [c18]Simone Bova, Robert Ganian, Stefan Szeider:
Model checking existential logic on partially ordered sets. CSL-LICS 2014: 21:1-21:10 - [c17]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified Conjunctive Queries on Partially Ordered Sets. IPEC 2014: 122-134 - [i8]Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. CoRR abs/1405.2891 (2014) - [i7]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified Conjunctive Queries on Partially Ordered Sets. CoRR abs/1408.4263 (2014) - 2013
- [j3]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Eur. J. Comb. 34(3): 680-701 (2013) - [j2]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Fundam. Informaticae 123(1): 59-76 (2013) - [c16]Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska:
FO Model Checking of Interval Graphs. ICALP (2) 2013: 250-262 - [c15]Robert Ganian, Jan Obdrzálek:
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. IWOCA 2013: 164-177 - [c14]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with Structural Parameters. MFCS 2013: 457-468 - [i6]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-Kernelization with Structural Parameters. CoRR abs/1303.1786 (2013) - [i5]Robert Ganian, Jan Obdrzálek:
Expanding the expressive power of Monadic Second-Order logic on restricted graph classes. CoRR abs/1306.5571 (2013) - 2012
- [c13]Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai:
When Trees Grow Low: Shrubs and Fast MSO1. MFCS 2012: 419-430 - [c12]Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS 2012: 326-337 - [i4]Robert Ganian:
Using Neighborhood Diversity to Solve Hard Problems. CoRR abs/1201.3091 (2012) - 2011
- [c11]Robert Ganian:
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics. IPEC 2011: 259-271 - [c10]Robert Ganian:
New Results on the Complexity of the Max- and Min-Rep Problems. SOFSEM 2011: 238-247 - [c9]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Clique-width: When Hard Does Not Mean Impossible. STACS 2011: 404-415 - [i3]Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower Bounds on the Complexity of MSO1 Model-Checking. CoRR abs/1109.5804 (2011) - 2010
- [j1]Robert Ganian, Petr Hlinený:
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discret. Appl. Math. 158(7): 851-867 (2010) - [c8]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS 2010: 73-83 - [c7]Robert Ganian:
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications. IWOCA 2010: 38-42 - [c6]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are There Any Good Digraph Width Measures? IPEC 2010: 135-146 - [c5]Robert Ganian, Petr Hlinený:
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. SOFSEM 2010: 428-439 - [i2]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are there any good digraph width measures? CoRR abs/1004.1485 (2010) - [i1]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better algorithms for satisfiability problems for formulas of bounded rank-width. CoRR abs/1006.5621 (2010)
2000 – 2009
- 2009
- [c4]Robert Ganian, Petr Hlinený:
Better Polynomial Algorithms on Graphs of Bounded Rank-Width. IWOCA 2009: 266-277 - [c3]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197 - [c2]Robert Ganian:
The Parameterized Complexity of Oriented Colouring. MEMICS 2009 - 2008
- [c1]Petr Hlinený, Robert Ganian:
Automata approach to graphs of bounded rank-width. IWOCA 2008: 4-15
Coauthor Index
[c103] [i74] [i72] [j46] [j43] [c98] [c95] [c92] [c91] [i60] [i59] [i58] [i57] [i55] [j36] [c83] [c79] [c78] [j33] [j30] [j28] [c73] [c70] [i40] [j25] [c66] [c63] [c58] [c57] [i37] [i36] [i34] [j21] [c56] [c50] [c49] [c48] [i29] [i28] [j16] [j15] [j14] [j13] [c44] [c43] [c42] [c39] [c37] [i21] [i18] [c32] [c30] [c28] [i17] [c24] [c23] [c19] [i11] [i10] [i9]
Iyad Kanj
aka: Iyad A. Kanj
aka: Iyad A. Kanj
[c102] [i75] [i72] [i69] [j46] [j44] [j43] [c92] [c91] [c89] [i67] [i60] [i59] [i57] [c83] [c79] [j33] [j32] [j31] [j30] [j29] [c74] [c73] [c70] [j25] [c67] [c66] [i34] [j21] [j20] [j19] [c56] [c55] [c54] [c53] [c50] [c47] [i32] [i28] [i27] [j17] [c46] [c44] [c43] [c42] [c41] [i26] [i25] [i24] [i23] [i22] [c40] [c39] [c38] [c37] [i21] [i19] [i18] [c33] [c32] [c30] [c27]
M. S. Ramanujan 0001
aka: Ramanujan Sridharan
aka: Ramanujan Sridharan
[c101] [i72] [j43] [c92] [c91] [i59] [i57] [j40] [j39] [j38] [j35] [c83] [c76] [e1] [d1] [i49] [i48] [i43] [j34] [c73] [j23] [c67] [c60] [c59] [c55] [c54] [c48] [i32] [i28] [i27] [j16] [j14] [c46] [c45] [i26] [j12] [c36] [c35] [c34] [j11] [j9] [j8] [c31] [c29] [c26] [c25] [i16] [i15] [c23] [c22] [c21] [c19] [i13] [i12] [i11] [i10] [c18] [c17] [i8] [i7] [c14] [i6]
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-11-07 20:24 CET 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:
