Jan Soukup

Orcid: 0000-0002-5039-3872

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.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

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

[BibT_eX]

[DOI]

David Miksaník

Ariel Schvartzman

Jan Soukup

CoRR, 2024

Connected Matchings.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Extending simple monotone drawings.

[BibT_eX]

[DOI]

Jan Kyncl

Jan Soukup

CoRR, 2023

2021

On longest palindromic subwords of finite binary words.

[BibT_eX]

[DOI]

Jan Petr

Jan Soukup

Discret. Math., 2021

2019

Improved lower bounds on parity vertex colourings of binary trees.

[BibT_eX]

[DOI]

Jan Soukup

CoRR, 2019

Jan Soukup

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...