| Iterative plan construction for the workflow satisfiability problem D Cohen, J Crampton, A Gagarin, G Gutin, M Jones Journal of Artificial Intelligence Research 51, 555-577, 2014 | 51 | 2014 |
| Simultaneously Satisfying Linear Equations Over : MaxLin2 and Max--Lin2 Parameterized Above Average R Crowston, M Fellows, G Gutin, M Jones, F Rosamond, S Thomassé, ... arXiv preprint arXiv:1104.1135, 2011 | 37 | 2011 |
| Max-cut parameterized above the Edwards-Erdős bound R Crowston, M Jones, M Mnich Algorithmica 72 (3), 734-757, 2015 | 30 | 2015 |
| Systems of Linear Equations over and Problems Parameterized above Average R Crowston, G Gutin, M Jones, EJ Kim, IZ Ruzsa Algorithm Theory-SWAT 2010: 12th Scandinavian Symposium and Workshops on …, 2010 | 30 | 2010 |
| On the workflow satisfiability problem with class-independent constraints for hierarchical organizations J Crampton, A Gagarin, G Gutin, M Jones, M Wahlström ACM Transactions on Privacy and Security (TOPS) 19 (3), 1-29, 2016 | 29 | 2016 |
| Algorithms for the workflow satisfiability problem engineered for counting constraints D Cohen, J Crampton, A Gagarin, G Gutin, M Jones Journal of Combinatorial Optimization 32 (1), 3-24, 2016 | 29 | 2016 |
| The mixed Chinese postman problem parameterized by pathwidth and treedepth G Gutin, M Jones, M Wahlström SIAM Journal on Discrete Mathematics 30 (4), 2177-2205, 2016 | 29 | 2016 |
| Max-cut parameterized above the Edwards-Erdős bound R Crowston, M Jones, M Mnich International Colloquium on Automata, Languages, and Programming, 242-253, 2012 | 29 | 2012 |
| Parameterized complexity of directed steiner tree on sparse graphs M Jones, D Lokshtanov, MS Ramanujan, S Saurabh, O Suchý Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013 | 27 | 2013 |
| Exploring the tiers of rooted phylogenetic network space using tail moves R Janssen, M Jones, PL Erdős, L Van Iersel, C Scornavacca Bulletin of mathematical biology 80, 2177-2208, 2018 | 26 | 2018 |
| Chinese postman problem on edge-colored multigraphs G Gutin, M Jones, B Sheng, M Wahlström, A Yeo Discrete Applied Mathematics 217, 196-202, 2017 | 25 | 2017 |
| Maximum balanced subgraph problem parameterized above lower bound R Crowston, G Gutin, M Jones, G Muciaccia Theoretical Computer Science 513, 53-64, 2013 | 24 | 2013 |
| Rearrangement moves on rooted phylogenetic networks P Gambette, L Van Iersel, M Jones, M Lafond, F Pardi, C Scornavacca PLoS computational biology 13 (8), e1005611, 2017 | 23 | 2017 |
| Structural parameterizations of the mixed chinese postman problem G Gutin, M Jones, M Wahlström Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 22 | 2015 |
| Engineering algorithms for workflow satisfiability problem with user-independent constraints D Cohen, J Crampton, A Gagarin, G Gutin, M Jones Frontiers in Algorithmics: 8th International Workshop, FAW 2014, Zhangjiajie …, 2014 | 21 | 2014 |
| Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes E Gross, L van Iersel, R Janssen, M Jones, C Long, Y Murakami Journal of Mathematical Biology 83, 1-24, 2021 | 20 | 2021 |
| Parameterized complexity of directed Steiner tree on sparse graphs M Jones, D Lokshtanov, MS Ramanujan, S Saurabh, O Suchý SIAM Journal on Discrete Mathematics 31 (2), 1294-1327, 2017 | 19 | 2017 |
| Parameterized study of the test cover problem R Crowston, G Gutin, M Jones, S Saurabh, A Yeo International Symposium on Mathematical Foundations of Computer Science, 283-295, 2012 | 19 | 2012 |
| Reconstructing tree-child networks from reticulate-edge-deleted subnetworks Y Murakami, L van Iersel, R Janssen, M Jones, V Moulton Bulletin of mathematical biology 81, 3823-3863, 2019 | 18 | 2019 |
| Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound R Crowston, M Jones, G Muciaccia, G Philip, A Rai, S Saurabh arXiv preprint arXiv:1310.2928, 2013 | 18 | 2013 |
