Future Projects
I welcome collaboration with anyone who would like to work with me on one (or more) of the following. These are only the projects for which I HAVE a clear research path in mind, with specific implementations, experiments, and analysis to do, I just didn’t have the time to implement them yet. Please get in touch with me even just to chat about them, or if you’re interested in collaborating.
- Can RL learn Combinatorial Games? Reinforcement Learning (RL) is really good at games, but is possibly really bad at Graph Theory (although initial results were quite optimistic [1, 2]). Would RL be good at Combinatorial Games? I am particularly interested to explore this about games on graphs. In particular the Balance Game or some Maker Breaker games.
- What can RL do in Graph Theory? There are some results that seem to indicate that RL is not good at Graph Theoretical problems [3, 4]. However, RL is clearly good at solving certain Graph-theoretical problems, and initial results were quite optimistic [1, 2]. What is the reason behind this variying behaviour?
- Sparsity? Quantization? What about both? Two well-known memory-reduction methods in Neural Networks are Sparsity and Quantization. These two methods are not orthogonal. However I do believe that there is a way of improving the current SotA to produce a lighter version of NN using the interplay between the two. The literature in the area seems to go towards a natural direction that hasn’t been developed, in my opinion, to the fullest.
- Let’s make EU healthier This is a project that has a wider breath and is not only linked to research. If you’re passionate about nutrition, hardcore computer science, and want to make a tangible impact, do get in touch.
Past and Present Projects
Methodology for carbon credit assessment |
A. Perrella, G. Marastoni, D.M. |
2025+ |
LSE |
|
Combinatorial Theorems |
P. Allen, J. Böttcher, D.M. |
2025+ |
LSE |
|
Partition universality for hypergraphs |
P. Allen, J. Böttcher, J. Lada, D.M. |
2025+ |
LSE |
|
Re-ILS: a metaheuristic approach for cardinality-constrained optimization |
Amazon ATS team |
2024 |
Amazon |
|
Reinforcement Learning, Collusion, and the Folk Theorem |
G. Ashkenazi-Golan, D.M., E. Plumb |
2024 |
LSE |
|
Dirac’s theorem for graphs of bounded bandwidth |
A.E. Díaz, P. Gupta, D.M., O. Parczyk, A. Sgueglia |
2024 |
LSE |
|
On product Schur triples in the integers |
L. Mattos, D.M., O. Parczyk |
2023 |
LSE |
|
Graphs with large minimum degree and no small odd cycles are 3-colourable |
J. Böttcher, N. Frankl, D. M., O. Parczyk, J. Skokan |
2022 |
LSE |
|
The Ramsey numbers of squares of paths and cycles |
Peter Allen, D.M., Barnaby Roberts, Jozef Skokan |
2022 |
LSE |
|
Density of small diameter subgraphs in \(K_r\)-free graphs |
Eng Keat Hng, D.M. |
2021 |
LSE |
|
DMV |
Oct ’23 |
Ilmenau |
|
Conference (invited) |
LSE |
CPMC |
Sept ’23 |
Zagreb |
|
Workshop |
LSE |
Eurocomb |
Aug ’23 |
Prague |
|
Conference |
LSE |
EEML |
Jul ’23 |
Košice |
|
Summer School |
LSE |
ALGA |
Jun ’23 |
Ragusa |
|
Conference |
CIVICA Grant |
UCLW |
May ’23 |
London |
UCL |
Workshop |
|
PSSC |
Apr ’23 |
Prague |
Charles Uni. |
Summer School |
Charles Uni. |
PCC |
Mar ’23 |
Birmingham |
|
Conference |
LSE |
Research Visit |
Aug ’22 |
Berlin |
FU Berlin |
Visit |
LMS Grant |
RSA |
Aug ’22 |
Gniezno |
|
Conference |
LSE |
Research visit |
Jul ’22 |
Prague |
Czech Academy of Science |
Visit |
Czech Academy of Science |
PSSDM |
Jul ’22 |
Prague |
Charles Uni. |
Summer School |
Summer School |
ICGT |
Jul ’22 |
Montpellier |
|
Conference |
LSE |
Research visit |
May ’22 |
Hamburg |
TU Hamburg |
Visit |
TU Hamburg |
- Organiser
- PCC (Main organiser), Apr 2023, University of London and BCC. (National conference for postgraduate students).
- LSE PhD CGO Seminar (Main Organiser), 2022/23.
- Grants and invitations
- DMV Invited Speaker. Ilmenau. 2023.
- LMS Computer Science Small Grant (700£). London Mathematical Society. Funded visit to Berlin. 2022.
- LSE Contribution Award. Dept of Mathematics. LSE. 2021.