default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Munaro
Person information
- affiliation: University of Parma, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Flavia Bonomo-Braberman, Nick Brettell
, Andrea Munaro, Daniël Paulusma:
Solving problems on generalized convex graphs via mim-width. J. Comput. Syst. Sci. 140: 103493 (2024)- [i15]Clément Dallard, Matjaz Krnc, O.-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht:
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR abs/2402.11222 (2024) - [i14]Esther Galby, Andrea Munaro, Shizhou Yang:
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs. CoRR abs/2402.18352 (2024) - 2023
- [j13]James A. Long Jr., Kevin G. Milans, Andrea Munaro:
Non-Empty Intersection of Longest Paths in $H$-Free Graphs. Electron. J. Comb. 30(1) (2023) - [j12]Andrea Munaro, Shizhou Yang:
On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs. Theor. Comput. Sci. 955: 113825 (2023) - [c4]Esther Galby, Andrea Munaro, Shizhou Yang:
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. SoCG 2023: 34:1-34:15 - [i13]James A. Long Jr., Kevin G. Milans, Andrea Munaro:
Non-empty intersection of longest paths in H-free graphs. CoRR abs/2302.07110 (2023) - [i12]Esther Galby, Andrea Munaro, Shizhou Yang:
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. CoRR abs/2303.07444 (2023) - [i11]Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang:
Comparing Width Parameters on Graph Classes. CoRR abs/2308.05817 (2023) - 2022
- [j11]Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma:
List k-colouring Pt-free graphs: A Mim-width perspective. Inf. Process. Lett. 173: 106168 (2022) - [j10]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the mim-width of hereditary graph classes. J. Graph Theory 99(1): 117-151 (2022) - [i10]Andrea Munaro, Shizhou Yang:
On algorithmic applications of sim-width and mim-width of (H1, H2)-free graphs. CoRR abs/2205.15160 (2022) - 2021
- [j9]Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28(4) (2021) - [j8]Nicolas Champseix, Esther Galby, Andrea Munaro, Bernard Ries:
CPG graphs: Some structural and hardness results. Discret. Appl. Math. 290: 17-35 (2021) - [j7]James A. Long Jr., Kevin G. Milans, Andrea Munaro:
Sublinear Longest Path Transversals. SIAM J. Discret. Math. 35(3): 1673-1677 (2021) - [c3]Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving Problems on Generalized Convex Graphs via Mim-Width. WADS 2021: 200-214 - 2020
- [j6]Esther Galby, Andrea Munaro, Bernard Ries:
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. Theor. Comput. Sci. 814: 28-48 (2020) - [c2]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the Mim-Width of Hereditary Graph Classes. IPEC 2020: 6:1-6:18 - [i9]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the Mim-Width of Hereditary Graph Classes. CoRR abs/2004.05018 (2020) - [i8]Esther Galby, Andrea Munaro:
Approximating Independent Set and Dominating Set on VPG graphs. CoRR abs/2004.07566 (2020) - [i7]James A. Long Jr., Kevin G. Milans, Andrea Munaro:
Sublinear Longest Path Transversals and Gallai Families. CoRR abs/2005.02716 (2020) - [i6]Nick Brettell, Andrea Munaro, Daniël Paulusma:
List k-Colouring Pt-Free Graphs with No Induced 1-Subdivision of K1, s: a Mim-width Perspective. CoRR abs/2008.01590 (2020) - [i5]Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving problems on generalized convex graphs via mim-width. CoRR abs/2008.09004 (2020)
2010 – 2019
- 2019
- [i4]Esther Galby, Andrea Munaro, Bernard Ries:
CPG graphs: Some structural and hardness results. CoRR abs/1903.01805 (2019) - 2018
- [j5]Andrea Munaro:
Triangle Packings and Transversals of Some K4 -Free Graphs. Graphs Comb. 34(4): 647-668 (2018) - [c1]Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries:
On Contact Graphs of Paths on a Grid. GD 2018: 317-330 - [i3]Esther Galby, Andrea Munaro, Bernard Ries:
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. CoRR abs/1810.06872 (2018) - 2017
- [j4]Andrea Munaro:
On line graphs of subcubic triangle-free graphs. Discret. Math. 340(6): 1210-1226 (2017) - [j3]Andrea Munaro:
Bounded clique cover of some sparse graphs. Discret. Math. 340(9): 2208-2216 (2017) - [j2]Andrea Munaro:
Boundary classes for graph problems involving non-local properties. Theor. Comput. Sci. 692: 46-71 (2017) - 2016
- [j1]Andrea Munaro:
The VC-dimension of graphs with respect to k-connected subgraphs. Discret. Appl. Math. 211: 163-174 (2016) - 2013
- [i2]Andrea Munaro:
The VC-dimension of graphs with respect to k-connected subgraphs. CTW 2013: 187-190 - [i1]Andrea Munaro:
The VC-Dimension of Graphs with Respect to k-Connected Subgraphs. CoRR abs/1302.6500 (2013)
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-06-10 20:30 CEST 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:
