- Improving shortest paths in the Delaunay triangulation2012 | Faculty of Mathematics and Physics
- Shortest path embeddings of graphs on surfaces2016 | Faculty of Mathematics and Physics
- Shortest Path Embeddings of Graphs on Surfaces2017 | Faculty of Mathematics and Physics
- Speeding up shortest path search in public transport networks2009 | Faculty of Mathematics and Physics
- Shortest Path Approach to Edge Routing2013 | Faculty of Mathematics and Physics
- Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?2023 | Faculty of Mathematics and Physics
- Cosmic traveling2013 | Faculty of Mathematics and Physics
- Representation of Short Distances in Structurally Sparse Graphs2023 | Faculty of Mathematics and Physics
- Recipes from the KSP programming cookbook - part I +12005 | Faculty of Mathematics and Physics
- On the Connectivity and the Diameter of Betweenness-Uniform Graphs2021 | Faculty of Mathematics and Physics
- Proximity graphs inside large weighted graphs2013 | Faculty of Mathematics and Physics
- Constructions of Betweenness-Uniform Graphs from Trees2021 | Faculty of Mathematics and Physics
- ON THE STABILITY OF NETWORK INDICES DEFINED BY MEANS OF MATRIX FUNCTIONS2018 | Faculty of Mathematics and Physics
- Disrupted Network Topology Contributed to Spatial Navigation Impairment in Patients With Mild Cognitive Impairment2021 | Second Faculty of Medicine
- Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?2022 | Faculty of Mathematics and Physics
- Slowdown for the geodesic-biased random walk2019 | Faculty of Mathematics and Physics
- On the structure and values of betweenness centrality in dense betweenness-uniform graphs2023 | Faculty of Mathematics and Physics
- Travelling on Graphs with Small Highway Dimension2021 | Faculty of Mathematics and Physics
- Splitting and Identifying Czech Compounds: A Pilot Study2021 | Faculty of Mathematics and Physics
- Correction of Invalid XML Documents with Respect to Single Type Tree Grammars2011 | Faculty of Mathematics and Physics
- A Relaxed Version of Šoltés's Problem and Cactus Graphs2021 | Faculty of Mathematics and Physics
- On relaxed Šoltés's problem2019 | Faculty of Mathematics and Physics
- Parameterized Complexity of Length-bounded Cuts and Multicuts2018 | Faculty of Mathematics and Physics
- On the Eikonal Equation in the Pedestrian flow Problem2017 | Faculty of Mathematics and Physics
- A (1+epsilon)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH GRAPHS2018 | Faculty of Mathematics and Physics
- Small-world bias of correlation networks: From brain to climate2017 | Faculty of Mathematics and Physics
- Arc-anode attachment area in DC arc plasma torch2016 | Faculty of Mathematics and Physics