Jan Soukup

According to our database, Jan Soukup authored at least 5 papers between 2019 and 2024.

Collaborative distances:

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

2024

Connected Matchings.

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

CoRR, 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

2023

Extending simple monotone drawings.

Jan Kyncl, Jan Soukup

CoRR, 2023

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