Obserwuj
©imon Schierreich
©imon Schierreich
Department of Theoretical Computer Science, Faculty of Information Technology, CTU in Prague
Zweryfikowany adres z fit.cvut.cz
Tytuł
Cytowane przez
Cytowane przez
Rok
Hedonic diversity games: A complexity picture with more than two colors
R Ganian, T Hamm, D Knop, © Schierreich, O Suchý
Artificial Intelligence 325, 104017, 2023
112023
Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract)
D Knop, © Schierreich, O Suchý
Proceedings of the AAAI Conference on Artificial Intelligence 36 (11), 12987 …, 2022
8*2022
The parameterized complexity of network microaggregation
V Blaľej, R Ganian, D Knop, J Pokorný, © Schierreich, K Simonov
Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 6262-6270, 2023
42023
Evaluation of Project Performance in Participatory Budgeting
N Boehmer, P Faliszewski, Ł Janeczko, D Peters, G Pierczyński, ...
arXiv preprint arXiv:2312.14723, 2023
32023
Maximizing Social Welfare in Score-Based Social Distance Games
R Ganian, T Hamm, D Knop, S Roy, © Schierreich, O Suchý
Proceedings of the 19th Conference on Theoretical Aspects of Rationality and …, 2023
22023
Host Community Respecting Refugee Housing
D Knop, © Schierreich
Proceedings of the 2023 International Conference on Autonomous Agents and …, 2023
22023
Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract)
V Blaľej, D Knop, © Schierreich
Proceedings of the AAAI Conference on Artificial Intelligence 36 (11), 12919 …, 2022
22022
The Complexity of Fair Division of Indivisible Items with Externalities
A Deligkas, E Eiben, V Korchemna, © Schierreich
Proceedings of the AAAI Conference on Artificial Intelligence 38 (9), 9653-9661, 2024
12024
Anonymous Refugee Housing with Upper-Bounds
© Schierreich
arXiv preprint arXiv:2308.09501, 2023
12023
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
V Blaľej, P Choudhary, D Knop, © Schierreich, O Suchý, T Valla
30th Annual European Symposium on Algorithms, 22:1-22:16, 2022
12022
Waypoint routing on bounded treewidth graphs
© Schierreich, O Suchý
Information Processing Letters 173, 106165, 2022
12022
The Parameterized Complexity of Maximum Betweenness Centrality
© Schierreich, JG Smutný
Annual Conference on Theory and Applications of Models of Computation, 221-233, 2024
2024
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
V Blaľej, D Knop, J Pokorný, © Schierreich
arXiv preprint arXiv:2404.18968, 2024
2024
Individual Rationality in Topological Distance Games is Surprisingly Hard
A Deligkas, E Eiben, D Knop, © Schierreich
arXiv preprint arXiv:2404.14128, 2024
2024
Elections in the Post-Quantum Era: Is the Complexity Shield Strong Enough?
© Schierreich
arXiv preprint arXiv:2403.05273, 2024
2024
Maximizing influence spread through a dynamic social network (student abstract)
© Schierreich
Proceedings of the AAAI Conference on Artificial Intelligence 37 (13), 16316 …, 2023
2023
Establishing Herd Immunity is Hard Even in Simple Geometric Networks
M Dvořák, D Knop, © Schierreich
International Workshop on Algorithms and Models for the Web-Graph, 68-82, 2023
2023
Sum Graphs
© Schierreich
České vysoké učení technické v Praze. Výpočetní a informační centrum., 2020
2020
Praktická výkonnost různých implementací prioritní fronty
© Schierreich
České vysoké učení technické v Praze. Vypočetní a informační centrum., 2018
2018
Nie można teraz wykonać tej operacji. Spróbuj ponownie póĽniej.
Prace 1–19