collaborators

5 papers

cs.DC2025

Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection

Krishnendu Chatterjee, Jan Matyáš Křišťan, Stefan Schmid +2

Payment channel networks (PCNs) are a promising technology that alleviates blockchain scalability by shifting the transaction load from the blockchain to the PCN. Nevertheless, the…

cs.CC2025

Solving Multiagent Path Finding on Highly Centralized Networks

Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan +3

The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destin…

cs.CC2025

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures

Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan +2

Consider the scenario where multiple agents have to move in an optimal way through a network, each one towards their ending position while avoiding collisions. By optimal, we mean…

math.CO2024

Reconfiguration Using Generalized Token Jumping

Jan Matyáš Křišťan, Jakub Svoboda

In reconfiguration, we are given two solutions to a graph problem, such as Vertex Cover or Dominating Set, with each solu tion represented by a placement of tokens on vertices of t…

cs.DC2024

Decreasing verification radius in local certification

Laurent Feuilloley, Jan Janoušek, Jan Matyáš Křišťan +1

This paper deals with local certification, specifically locally checkable proofs: given a graph property, the task is to certify whether a graph satisfies the property. The verific…