| Efficient algorithms for measuring the funnel-likeness of DAGs M Garlet Millani, H Molter, R Niedermeier, M Sorge Journal of Combinatorial Optimization 39, 216-245, 2020 | 17 | 2020 |
| Colouring non-even digraphs MG Millani, R Steiner, S Wiederrecht arXiv preprint arXiv:1903.02872, 2019 | 16 | 2019 |
| A polynomial kernel for funnel arc deletion set M Garlet Milani Algorithmica 84 (8), 2358-2378, 2022 | 3 | 2022 |
| A parameterized algorithmics framework for degree sequence completion problems in directed graphs R Bredereck, V Froese, M Koseler, M Garlet Millani, A Nichterlein, ... Algorithmica 81, 1584-1614, 2019 | 3 | 2019 |
| Colouring non-even digraphs M Garlet Millani, R Steiner, S Wiederrecht arXiv e-prints, arXiv: 1903.02872, 2019 | 2 | 2019 |
| A parameterized algorithmics framework for digraph degree sequence completion problems R Bredereck, V Froese, M Koseler, MG Millani, A Nichterlein, ... arXiv preprint arXiv:1604.06302, 2018 | 2 | 2018 |
| Digraph tango: from structure to algorithms and back again MG Milani PQDT-Global, 2024 | 1 | 2024 |
| Cycles of well-linked sets and an elementary bound for the directed grid theorem M Hatzel, S Kreutzer, MG Milani, I Muzi 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 1-20, 2024 | | 2024 |
| Directed Ear Anonymity MG Milani Latin American Symposium on Theoretical Informatics, 77-97, 2024 | | 2024 |
| Digraph Tango: from structure to algorithms and back again M Garlet Milani | | 2024 |
| Directed Ear Anonymity M Garlet Milani arXiv e-prints, arXiv: 2401.07640, 2024 | | 2024 |
| Algorithmic Complexity of Problems on Special Directed Acyclic Graphs MG Millani Technische Universität Berlin, 2017 | | 2017 |
| Algoritmos e complexidade para anonimização de grau em grafos direcionados MG Millani | | 2015 |
| FOCS 2024 M Hatzel, S Kreutzer, MG Milani, J Dreier, I Eleftheriadis, S Toruńczyk, ... | | |
