I am currently a research associate at the Faculty of Economics of the university of Cambridge working with Peter Bossaerts.
My main research interests are temporal graph theory, swarm intelligence, and optimization.
I also enjoy the occasional coding project and learning about new subjects.
For more information, feel free to browse around or contact me via jason.schoeters.cs@gmail.com.
Some selected figures from my work:
With Peter Bossaerts, we aim to better understand the correlations and/or differences between human brains and computers artificial intelligence when faced with complex problems. One goal is to find and characterize problems where humans have the advantage, such as when intuition, context, and/or pattern recognition plays a key role.
With Eric Sanlaville, we have mainly studied connected components in temporal graphs, presenting numerous temporal extensions and corresponding structural and algorithmic results, which were either novel or which completed related work. A secondary subject considered dense spanners in temporal graphs, for which we obtained preliminary results.
A year mainly filled with teaching. I tied up some loose ends from my PhD and started new projects by myself or with new people. I also took some time to broaden my horizons and even obtaining results in other domains, including learning about probability theory with Luis Fredes and bioinformatics with Clément Larue.
Subjects: Gossiping, influence diffusion, temporal spanners
at school of computing science, invited by Joseph G. Peters.
Subject: Contributions to temporal graph theory and mobility-related problems [pdf]
at LaBRI, supervised by Arnaud Casteigts.
Internship: VectorTSP
at LaBRI, supervised by Arnaud Casteigts.
Internship: Image processing, network theory and graphical art
at LaBRI, supervised by Guy Melançon.
This section is divided into Publications, Talks, Software development, and Students.
All my scientific papers and the international conferences and international journals they were peer reviewed and published by.
TBD
Journal version submitted
16th Int. Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)
Journal of Computer Systems and Science, Elsevier (JCSS), Vol. 121, 1-17
46th Int. Colloquium on Automata, Languages, and Programming (ICALP)
All presentations and talks in seminars, open question sessions, team meetings, national conferences, international conferences and anything in between, including my PhD defense. During the COVID-19 pandemic, most of these were given online.
Microeconomics seminar, Cambridge, United Kingdom
TEMPOGRAL seminar, Poitiers, France [slides]
Journées Graphes et Algorithmes, Paris, France [PDF]
Heudiasyc CID seminar, Compiegne, France
Temporal graphs seminar open problem session (online), Dagstuhl, Germany [Seminar report]
CITI CHROMA seminar, Lyon, France
AlgoTel, La Rochelle, France
LITIS RI2C seminar, Le Havre, France
LaBRI distributed algorithms seminar, Bordeaux, France
ALGOSENSORS (online), Pisa, Italy [recording]
SFU theory seminar, Vancouver, Canada
LITIS RI2C seminar, Le Havre, France
ROADEF, Lyon, France
LIP6 complex networks seminar (online), Paris, France
SFU discrete maths seminar, Vancouver, Canada
AlgoTel (best student paper award), Narbonne, France
Workshop CoA, Roscoff, France
LaBRI distributed algorithms and graph and optimisation joined seminar, Bordeaux, France
Journées Graphes et Algorithmes, Grenoble, France
All my coding projects, from experimental benchmarks for my own research subjects to automatic data processing for colleagues in biology. I mostly code in Java, due to my visualisation library of choice being JBotSim, although I prefer Python for small projects.
Java program computing VectorTSP benchmarks for multiple algorithms adapted with multiPointAStar
Available on Github here
Java program computing canopied areas covered by given buffer zone
Available on Github here
Visualization using JBotSim of the Monte Carlo method shown here, and of the Quadtree method shown here
Java library using JBotSim for inducing temporal graph properties in the underlying communication of mobile ad hoc networks
Available on Github here
Java program analyzing Excel DNA data files for potential mismatches of parent/child associations
Available on Github here
All the students I have (co-)supervised which at the moment consists of internships only. As a rule, I prefer to work with my students as colleagues, not just teach them and review their findings.
Internship: Dense spanners and related problems
at LITIS, co-supervised with Eric Sanlaville
Internship: Algorithmic analysis of the fireworks technique
at LaBRI, co-supervised with Arnaud Casteigts
Following is a list of the classes I have given over the years, currently totalling at more or less 350 hours.
To my students, I like to keep useful links here (recordings, test/answer sheets, ...) for this year's classes.
As is the case with everyone, teachers can forget; contact me via jason.schoeters.cs@gmail.com if something is missing.
TBD
Mobility algorithms (2nd year Master of Networking)
Models for programming and computing (3rd year Bachelor of CS)
Techniques for algorithms and programming (3rd year Bachelor of CS)
Excel and CS basics (2nd year Bachelor of Economics and Management)
Array algorithms (1st year Bachelor of Math and CS)
CS basics (1st year Bachelor of Math and Science)
CS specialty (1st year Bachelor of Math and Science)
Mobility algorithms (2nd year Master of Networking)
Array algorithms (1st year Bachelor of Math and CS)
CS basics (1st year Bachelor of Math and Science)
Basic data structure algorithms (2nd year Bachelor of CS)
Networking (2nd year Bachelor of CS)
Basic data structure algorithms (2nd year Bachelor of CS)
Array algorithms (1st year Bachelor of Math and CS)
I was part of Maths à modeler in 2018, and of Math en jeans in 2019. Both aim to present some higher level maths (proper proofs, lower/upper bounds, divide and conquer, etc.) at highschools under the guise of an interesting and fun problem. For Maths à modeler, the students are generally guided along several weeks towards the solution(s) and props such as boards, tokens and tiles are often used to offer hands-on learning. Math en jeans leaves more room for the students to advance at the pace they like and in the direction they deem interesting. Both ultimately end with students presenting their findings at a seminar.
This section contains any other information which may be of interest.
I am particularly fond of reviewing scientific papers, as it helps me stay up to date within my research areas. Below is a collection of the national and international conferences and journals I agreed to review for.
Algorithmica
AlgoTel
Journal of Computer and System Sciences
International Colloquium on Automata, Languages and Programming
ALGOSENSORS
Computing
Computer Networks
ROADEF
ALGOSENSORS
Journal of Interconnection Networks
Theoretical Computer Science
Journal of Computer and System Sciences
International Symposium on Mathematical Foundations of Computer Science
Discrete Applied Mathematics
AlgoTel: program committee member
AlgoTel: program committee member
AlgoTel: graph session chair
Société Informatique de France: member
AlgoTel: shadow program committee member
IWOCA: organization committee member
AlgoDist seminar: co-organiser
AFoDIB: secretary and seminar head
FCT: organization committee member
ResCom (assistant and attendant)
GraphMasters workshop (online)
International Workshop on Graph-Theoretic Concepts (online)
ICALP Algorithmic Aspects of Temporal Graphs (online)
French-Israeli Laboratory on Foundations of Computer Science
Annual workshop of the French Working Group on Complexity and Algorithms
In my free time I like to meet with friends to have a drink or do an activity.
When it is rainy however, I like to read, or play (card, board, video) games with friends.
Concerning sports, I'm particularly fond of bouldering, and I like dancing, running, and hiking.