DiGeo: Fundamental questions of discrete geometry

Journal papers

  • Inversion Sequences Avoiding a Triple of Patterns of 3 Letters (David Callan, Vít Jelínek, and Toufik Mansour).
    • In the Electronic Journal of Combinatorics (E-JC), 2023. [DOI]

Conference contributions

  • On ordered Ramsey numbers of matchings versus triangles (Martin Balko, Marian Poljak).
    • In the proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2023), 2023. [DOI]
  • Improved Bounds for the Binary Paint Shop Problem (Jaroslav Hančl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Šámal, and Pavel Valtr).
    • In the proceedings of the International Computing and Combinatorics Conference (COCOON 2023), 2023. [DOI]
  • The Hierarchy of Hereditary Sorting Operators (Vít Jelínek, Michal Opler, and Jakub Pekárek).
    • In the proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024), 2024. [DOI]
  • String graphs with precise number of intersections (Petr Chmel and Vít Jelínek).
    • In the proceedings of the International Symposium on Graph Drawing and Network Visualization (GD 2023), 2023. [DOI]
  • The Parametrized Complexity of the Segment Number (Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff).
    • In the proceedings of the International Symposium on Graph Drawing and Network Visualization (GD 2023), 2023. [DOI]
    • arXiv:2308.15416 (2023)
  • Three Edge-disjoint Plane Spanning Paths in a Point Set (Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr).
    • In the proceedings of the International Symposium on Graph Drawing and Network Visualization (GD 2023), 2023. [DOI]
    • arXiv:2306.07237 (2023)
  • Computing Largest Minimum Color-Spanning Intervals of Imprecise Points (Ankush Acharyya, Vahideh Keikha, Maria Saumell, and Rodrigo I. Silveira).
    • In the proceedings of the 16th Latin American Symposium on Theoretical Informatics (LATIN 2024), 2024. [DOI]

Preprints

  • Structure of betweenness uniform graphs with low values of betweenness centrality (Babak Ghanbari, David Hartman, Vít Jelínek, Aneta Pokorná, Robert Šámal, and Pavel Valtr).
  • Extending simple monotone drawings (Jan Kynč and Jan Soukup).






This project is funded by the Czech Science Foundation under the grant agreement no. 23-04949X.