Jan Pokorný

According to our database, Jan Pokorný authored at least 5 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Practical approach to <i>2</i>-Euclidean Preferences.

Michal Dvorák, Dusan Knop, Jan Pokorný, Martin Slavík

CoRR, February, 2025

Pathfinding in Self-Deleting Graphs.

Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

Participatory Budgeting Project Strength via Candidate Control.

Piotr Faliszewski, Lukasz Janeczko, Dusan Knop, Jan Pokorný, Simon Schierreich, Mateusz Sluszniak, Krzysztof Sornat

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

2024

Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra.

Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

The Parameterized Complexity of Network Microaggregation.

Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023