Hybrid computing using a neural network with dynamic external memory A Graves, G Wayne, M Reynolds, T Harley, I Danihelka, ... Nature 538 (7626), 471-476, 2016 | 1606 | 2016 |

Pathnet: Evolution channels gradient descent in super neural networks C Fernando, D Banarse, C Blundell, Y Zwols, D Ha, AA Rusu, A Pritzel, ... arXiv preprint arXiv:1701.08734, 2017 | 699 | 2017 |

Solving mixed integer programs using neural networks V Nair, S Bartunov, F Gimeno, I Von Glehn, P Lichocki, I Lobov, ... arXiv preprint arXiv:2012.13349, 2020 | 125 | 2020 |

Woulda, coulda, shoulda: Counterfactually-guided policy search L Buesing, T Weber, Y Zwols, S Racaniere, A Guez, JB Lespiau, N Heess arXiv preprint arXiv:1811.06272, 2018 | 109 | 2018 |

Linear and integer optimization: theory and practice G Sierksma, Y Zwols CRC Press, 2015 | 100 | 2015 |

Analyzing the performance of greedy maximal scheduling via local pooling and graph theory B Birand, M Chudnovsky, B Ries, P Seymour, G Zussman, Y Zwols Proceedings of the 2010 ACM workshop on Wireless of the students, by the …, 2010 | 50 | 2010 |

Deep reinforcement learning with attention for slate markov decision processes with high-dimensional states and actions P Sunehag, R Evans, G Dulac-Arnold, Y Zwols, D Visentin, B Coppin arXiv preprint arXiv:1512.01124, 2015 | 39 | 2015 |

Generative temporal models with spatial memory for partially observed environments M Fraccaro, D Rezende, Y Zwols, A Pritzel, SMA Eslami, F Viola International conference on machine learning, 1549-1558, 2018 | 28 | 2018 |

A De Bruijn-Erdos theorem for chordal graphs L Beaudou, A Bondy, X Chen, E Chiniforooshan, M Chudnovsky, ... arXiv preprint arXiv:1201.6376, 2012 | 26 | 2012 |

Grabska-Barwi nska A Graves, G Wayne, M Reynolds, T Harley, I Danihelka A., Colmenarejo, SG, Grefenstette, E., Ramalho, T., Agapiou, J., et al, 471-476, 2016 | 24* | 2016 |

Large cliques or stable sets in graphs with no four‐edge path and no five‐edge path in the complement M Chudnovsky, Y Zwols Journal of Graph theory 70 (4), 449-472, 2012 | 23 | 2012 |

The complexity of minimum-length path decompositions D Dereniowski, W Kubiak, Y Zwols Journal of Computer and System Sciences 81 (8), 1715-1747, 2015 | 16 | 2015 |

Lines in hypergraphs L Beaudou, A Bondy, X Chen, E Chiniforooshan, M Chudnovsky, ... Combinatorica 33, 633-654, 2013 | 16 | 2013 |

OR Practice—Training Optimization for the Decathlon Y Zwols, G Sierksma Operations research 57 (4), 812-822, 2009 | 9 | 2009 |

Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs M Chudnovsky, B Ries, Y Zwols Discrete applied mathematics 159 (17), 1971-1995, 2011 | 7* | 2011 |

Erdős theorem for chordal graphs L Beaudou, A Bondy, X Chen, E Chiniforooshan, M Chudnovsky, ... Electron J. Combin 22, 2015 | 5 | 2015 |

*K*_{4}‐free graphs with no odd hole: Even pairs and the circular chromatic numberY Zwols Journal of Graph Theory 65 (4), 303-322, 2010 | 4 | 2010 |

Multi-task neural networks with task-specific paths DP Wierstra, CT Fernando, A Pritzel, DS Banarse, C Blundell, AA Rusu, ... US Patent App. 16/995,655, 2020 | 1 | 2020 |

Optimal edge‐coloring with edge rate constraints D Dereniowski, W Kubiak, B Ries, Y Zwols Networks 62 (3), 165-182, 2013 | 1 | 2013 |

Using local pooling to characterize networks in which greedy scheduling performs well B Birand, M Chudnovsky, B Ries, P Seymour, G Zussman, Y Zwols Columbia University, EE, Tech. Rep, 07-30, 2009 | 1 | 2009 |