Jan Soukup

According to our database, Jan Soukup authored at least 6 papers between 2019 and 2025.

Collaborative distances:

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

2025

Connected matchings.

Oswin Aichholzer, Sergio Cabello, Viola Mészáros, Patrick Schnider, Jan Soukup

Comput. Geom., 2025

Extending Simple Monotone Drawings.

Jan Kyncl, Jan Soukup

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

2024

Many Views of Planar Point Sets.

Jan Kyncl, Jan Soukup

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

On Approximately Strategy-Proof Tournament Rules for Collusions of Size at Least Three.

David Miksaník, Ariel Schvartzman, Jan Soukup

Proceedings of the Algorithmic Decision Theory - 8th International Conference, 2024

2021

On longest palindromic subwords of finite binary words.

Jan Petr, Jan Soukup

Discret. Math., 2021

2019

Improved lower bounds on parity vertex colourings of binary trees.

Jan Soukup

CoRR, 2019