Podklady pro hodnocení kateder na základě článků v impaktovaných časopisech ohodnocených podle pozice časopisu v oborovém žebříčku dle JCR a konferenčních příspěvků ohodnocených dle interních pravidel. Jde o výsledky vykázané za FI nebo s deklarovaným podílem FI (konkrétní výše podílu není nijak zohledněna).
Hodnoty výsledků dělím rovným dílem mezi domácí autory s vazbou k jedné z kateder. Základem pro rozřazení autorů ke katedrám je seznam zaměstnanců kateder. Doktorandi jsou řazeni na katedru svého školitele, ze zbylých domácích autorů jsou ti, kteří mají spoluautory pouze z jedné katedry, zařazeni na tuto katedru, z ostatních jsou ti s významnějším přínosem zařazeni ručně (např. magisterští studenti dle vedoucího DP), podíl těch s marginálním přínosem je rozdělen mezi jejich spoluautory.
RNDr. Robert Ganian (IS), mimo katedry
Články v impaktovaných časopisech dle IS MU 2016–2020 (celkem 4.392)Hodnota se počítá jako (Nmax - N + 1) / N, kde Nmax je počet časopisů v kategorii a N pořadí časopisu dle IF. Při zařazení časopisu do více kategorií nebo shodě IF se bere průměr. Najetím myší na hodnotu se zobrazí pořadí v oborových žebříčcích daného ročníku JCR (pro 2020 JCR2019; JCR2020 ještě nevyšlo), odkaz vede na stránku časopisu v JCR (oborové žebříčky tam jsou pod odkazem Rank), funguje ale jen z IP adres MU a je potřeba kliknout alespoň dvakrát, první přístup pouze inicializuje session.
| rank | rok | title | započítaní | ostatní | nakladatel | sborník |
|---|---|---|---|---|---|---|
| A* AAAI | 2019 | Solving Integer Quadratic Programming via Explicit and Structural Restrictions (DOI) | Ganian | Eiben, Knop, Ordyniak | AAAI Press | Proceedings of the AAAI Conference on Artificial Intelligence |
| A* NIPS | 2019 | The Parameterized Complexity of Cascading Portfolio Scheduling | Ganian | Eiben, Kanj, Szeider | Neural Information Processing Systems Foundation, Inc. | Advances in Neural Information Processing Systems 32 (NIPS 2019) |
| A* IJCAI | 2018 | Unary Integer Linear Programming with Structural Restrictions (DOI) | Ganian | Eiben, Knop, Ordyniak | ijcai.org | Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence |
| A* IJCAI | 2018 | A Structural Approach to Activity Selection (DOI) | Ganian | Eiben, Ordyniak | ijcai.org | Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI) |
| A* ICML | 2018 | Parameterized Algorithms for the Matrix Completion Problem | Ganian | Kanj, Ordyniak, Szeider | PMLR | Proceedings of the 35th International Conference on Machine Learning (ICML) |
| A* AAAI | 2017 | Going Beyond Primal Treewidth for {(M)ILP} | Ganian | Ramanujan, Ordyniak | AAAI | Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA |
| A* IJCAI | 2017 | Solving Integer Linear Programs with a Small Number of Global Variables and Constraints (DOI) | Ganian | Dvorak, Eiben, Knop, Ordyniak | ijcai.org | Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017 |
| A* AAAI | 2016 | The Complexity Landscape of Decompositional Parameters for ILP | Ganian | Ordyniak | AAAI Press | Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence |
| A* AAAI | 2016 | Using Decomposition-Parameters for QBF: Mind the Prefix! | Ganian | Ordyniak, Eiben | AAAI Press | Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence |
| A ALENEX | 2019 | SAT-Encodings for Treecut Width and Treedepth (DOI) | Ganian | Lodha, Ordyniak, Szeider | SIAM | ALENEX 2019 |
| A CP | 2019 | A Join-Based Hybrid Parameter for Constraint Satisfaction (DOI) | Ganian | Ordyniak, Szeider | Springer | Principles and Practice of Constraint Programming - 25th International Conference |
| A ESA | 2019 | Group Activity Selection with Few Agent Types (DOI) | Ganian | Ordyniak, Rahul | Dagstuhl | 27th Annual European Symposium on Algorithms (ESA 2019) |
| A GD | 2019 | On Strict (Outer-)Confluent Graphs (DOI) | Ganian | Forster, Klute, Nollenburg | Springer | Graph Drawing and Network Visualization - 27th International Symposium, GD 2019 |
| A GD | 2019 | Parameterized Algorithms for Book Embedding Problems (DOI) | Ganian | Bhore, Montecchiani, Nollenburg | Springer | Graph Drawing and Network Visualization - 27th International Symposium, GD 2019 |
| A IPCO | 2019 | Integer Programming and Incidence Treedepth (DOI) | Ganian | Eiben, Knop, Ordyniak, Pilipczuk, Wrochna | Springer | Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019 |
| A MFCS | 2019 | Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth (DOI) | Ganian | Eiben, Hamm, Kwon | Dagstuhl | 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) |
| A WG | 2019 | The Power of Cut-Based Parameters for Computing Edge Disjoint Paths (DOI) | Ganian | Ordyniak | Springer | WG 2019: Graph-Theoretic Concepts in Computer Science |
| A STACS | 2018 | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (DOI) | Ganian | Klute, Ordyniak | Dagstuhl | STACS 2018 |
| A STACS | 2018 | Small Resolution Proofs for QBF using Dependency Treewidth (DOI) | Ganian | Eiben, Ordyniak | Dagstuhl | STACS 2018 |
| A ISAAC | 2017 | On Structural Parameterizations of the Edge Disjoint Paths Problem (DOI) | Ganian | Ordyniak, Ramanujan | LIPIcs | 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand |
| A MFCS | 2017 | Towards a Polynomial Kernel for Directed Feedback Vertex Set (DOI) | Ganian | Eiben, Ordyniak, Ramanujan, Bergougnoux | LIPIcs | 42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark |
| A SAT | 2017 | Backdoor Treewidth for SAT (DOI) | Ganian | Ramanujan, Szeider | Springer | Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings |
| A SAT | 2017 | New Width Parameters for Model Counting (DOI) | Ganian | Szeider | Springer | Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings |
| A STACS | 2017 | Combining Treewidth and Backdoors for CSP (DOI) | Ganian | Ramanujan, Szeider | Dagstuhl-LIPIcs | 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany |
| A CP | 2016 | Backdoors to Tractable Valued CSP (DOI) | Ganian | Ramanujan, Szeider | SPRINGER INT PUBLISHING AG | PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016 |
| A ESA | 2016 | Counting Linear Extensions: Parameterizations by Treewidth (DOI) | Ganian | Ordyniak, Eiben, Kustaa | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik | 24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark |
| A IPDPS | 2016 | Polynomial-time Construction of Optimal MPI Derived Datatype Trees (DOI) | Ganian | Kalany, Szeider, Traff | IEEE | 2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016) |
| A MFCS | 2016 | A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion (DOI) | Ganian | Eiben, Kwon | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik | 41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland |
| A MFCS | 2016 | On the Complexity Landscape of Connected f-Factor Problems (DOI) | Ganian | Narayanaswamy, Ordyniak, Rahul, Ramanujan | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik | 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26 |
| A MFCS | 2016 | On Existential MSO and its Relation to ETH (DOI) | Ganian | de Haan, Szeider, Kanj | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik | 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26 |
| B ICTAI | 2018 | Sum-of-Products with Default Values: Algorithms and Complexity Results (DOI) | Ganian | Kim, Slivovsky, Szeider | IEEE | IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI) |