default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 19 matches
- 2024
- 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) - 2023
- Chun-Hung Liu, Irene Muzi:
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation. J. Comb. Theory B 158(Part): 210-251 (2023) - Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl:
Computing Complexity Measures of Degenerate Graphs. IPEC 2023: 14:1-14:21 - Nathan J. Bowler, Florian Gut, Meike Hatzel, Ken-ichi Kawarabayashi, Irene Muzi, Florian Reich:
Decomposition of (infinite) digraphs along directed 1-separations. CoRR abs/2305.09192 (2023) - Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl:
Computing complexity measures of degenerate graphs. CoRR abs/2308.08868 (2023) - 2022
- Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Cycles Quarter- and Half-Integrally. Comb. 42(Supplement 2): 1409-1438 (2022) - Pål Grønås Drange, Irene Muzi, Felix Reidl:
Harmless Sets in Sparse Classes. IWOCA 2022: 299-312 - 2021
- Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. SODA 2021: 1702-1719 - Pål Grønås Drange, Irene Muzi, Felix Reidl:
Kernelization and hardness of harmless sets in sparse classes. CoRR abs/2111.11834 (2021) - 2020
- Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. CoRR abs/2003.02475 (2020) - 2019
- Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Circuits Quarter-Integrally. ESA 2019: 72:1-72:13 - Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Algorithmic Properties of Sparse Digraphs. STACS 2019: 46:1-46:20 - Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing directed circuits quarter-integrally. CoRR abs/1907.02494 (2019) - 2017
- Katherine Edwards, Irene Muzi, Paul Wollan:
Half-Integral Linkages in Highly Connected Directed Graphs. ESA 2017: 36:1-36:12 - Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan:
Being Even Slightly Shallow Makes Life Hard. MFCS 2017: 79:1-79:13 - Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan:
Being even slightly shallow makes life hard. CoRR abs/1705.06796 (2017) - 2016
- Katherine Edwards, Irene Muzi, Paul Wollan:
Half-integral linkages in highly connected directed graphs. CoRR abs/1611.01004 (2016) - 2013
- János Körner, Irene Muzi:
Degree-Doubling Graph Families. SIAM J. Discret. Math. 27(3): 1575-1583 (2013) - 2012
- János Körner, Irene Muzi:
Degree-doubling graph families. CoRR abs/1208.1963 (2012)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-11 11:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint