A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. - Robert Bredereck; Vincent Froese; Marcel Koseler; Marcelo Garlet Millani; André Nichterlein; Rolf Niedermeier (CoRR, 2016)

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. - Robert Bredereck; Vincent Froese; Marcel Koseler; Marcelo Garlet Millani; André Nichterlein; Rolf Niedermeier (Algorithmica, 2019)

Efficient algorithms for measuring the funnel-likeness of DAGs. - Marcelo Garlet Millani; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (J. Comb. Optim., 2020)

A Polynomial Kernel for Funnel Arc Deletion Set. - Marcelo Garlet Milani (Algorithmica, 2022)

Colouring Non-Even Digraphs. - Marcelo Garlet Millani; Raphael Steiner; Sebastian Wiederrecht (Electron. J. Comb., 2022)

Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. - Meike Hatzel; Stephan Kreutzer; Marcelo Garlet Milani; Irene Muzi (FOCS, 2024)

Directed Ear Anonymity. - Marcelo Garlet Milani (LATIN (2), 2024)

Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors. - Ken-ichi Kawarabayashi; Nicola Lorenz; Marcelo Garlet Milani; Jacob Stegemann (CoRR, 2025)