default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcelo Garlet Milani
Person information
- affiliation: Technical University of Berlin, Institute for Software Engineering and Theoretical Computer Science, Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j4]Marcelo Garlet Milani
:
A Polynomial Kernel for Funnel Arc Deletion Set. Algorithmica 84(8): 2358-2378 (2022)- [j3]Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht:
Colouring Non-Even Digraphs. Electron. J. Comb. 29(4) (2022) - 2020
- [j2]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. 39(1): 216-245 (2020) - 2019
- [j1]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica 81(4): 1584-1614 (2019)
Conference and Workshop Papers
- 2024
- [c5]Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi:
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. FOCS 2024: 1-20 - [c4]Marcelo Garlet Milani:
Directed Ear Anonymity. LATIN (2) 2024: 77-97 - 2020
- [c3]Marcelo Garlet Milani:
A Polynomial Kernel for Funnel Arc Deletion Set. IPEC 2020: 13:1-13:13 - 2018
- [c2]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO 2018: 183-195 - 2016
- [c1]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC 2016: 10:1-10:14
Informal and Other Publications
- 2024
- [i6]Marcelo Garlet Milani:
Directed Ear Anonymity. CoRR abs/2401.07640 (2024) - [i5]Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi:
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. CoRR abs/2404.19222 (2024) - 2019
- [i4]Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht:
Colouring Non-Even Digraphs. CoRR abs/1903.02872 (2019) - [i3]Marcelo Garlet Milani:
A Polynomial Kernel for Funnel Arc Deletion Set. CoRR abs/1911.05520 (2019) - 2018
- [i2]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR abs/1801.10401 (2018) - 2016
- [i1]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR abs/1604.06302 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
