PPaperPicks

Dusan Knop

10 papers at tracked venues · 6 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. Dividing Indivisible Items for the Benefit of All: It Is Hard to Be Fair Without Social Awareness
  2. Exact Algorithms for Distance to Unique Vertex Cover
  3. Balanced and Fair Partitioning of Friends
  4. Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
  5. Participatory Budgeting Project Strength via Candidate Control
  6. Participatory Budgeting Project Strength via Candidate Control
  7. Solving Multiagent Path Finding on Highly Centralized Networks
  8. Aggregation of Continuous Preferences in One Dimension
  9. Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology
  10. Individual Rationality in Topological Distance Games Is Surprisingly Hard