Jason Schoeters

According to our database, Jason Schoeters authored at least 9 papers between 2020 and 2025.

Collaborative distances:

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

2025

Temporal Cycle Detection and Acyclic Temporization.

Davi de Andrade, Júlio Araújo, Allen Ibiapina, Andrea Marino, Jason Schoeters, Ana Silva

CoRR, March, 2025

Vector TSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints.

Arnaud Casteigts, Mathieu Raffinot, Mikhail A. Raskin, Jason Schoeters

Discret. Appl. Math., 2025

Spanner Enumeration for Temporal Graphs.

Kazuhiro Kurita, Andrea Marino, Jason Schoeters, Takeaki Uno

Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

Matching and Edge Cover in Temporal Graphs.

Lapo Cioni, Riccardo Dondi, Andrea Marino, Jason Schoeters, Ana Silva

Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

2024

Temporally connected components.

Stefan Balev, Eric Sanlaville, Jason Schoeters

Theor. Comput. Sci., 2024

On Inefficiently Connecting Temporal Networks.

Esteban Christiann, Eric Sanlaville, Jason Schoeters

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

2021

Contributions to temporal graph theory and mobility-related problems. (Contributions à la théorie des graphes temporels et aux problèmes de mobilité).

Jason Schoeters

PhD thesis, 2021

Temporal cliques admit sparse spanners.

Arnaud Casteigts, Joseph G. Peters, Jason Schoeters

J. Comput. Syst. Sci., 2021

2020

VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints.

Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters

Proceedings of the Algorithms for Sensor Systems, 2020