default search action
Giacomo Paesani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani
, Daniël Paulusma
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Eur. J. Comb. 117: 103821 (2024) - [j7]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying subset feedback vertex set for H-free graphs. Theor. Comput. Sci. 1003: 114624 (2024) - [c13]Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees for Data of Low Rank-Width. AAAI 2024: 10476-10483 - [c12]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
A General Theoretical Framework for Learning Smallest Interpretable Models. AAAI 2024: 10662-10669 - [c11]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP 2024: 68:1-68:18 - [i11]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR abs/2404.14087 (2024) - [i10]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider:
Explaining Decisions in ML Models: a Parameterized Complexity Analysis. CoRR abs/2407.15780 (2024) - [i9]Davide Belluomo, Tiziana Calamoneri, Giacomo Paesani, Ivano Salvo:
Toward a Unified Graph-Based Representation of Medical Data for Precision Oncology Medicine. CoRR abs/2410.14739 (2024) - 2023
- [c10]Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani
Learning Small Decision Trees with Large Domain. IJCAI 2023: 3184-3192 - [c9]Sebastian Ordyniak, Giacomo Paesani
The Parameterized Complexity of Finding Concise Local Explanations. IJCAI 2023: 3312-3320 - 2022
- [j6]Nick Brettell
Bounding the mim-width of hereditary graph classes. J. Graph Theory 99(1): 117-151 (2022) - [j5]Giacomo Paesani
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. SIAM J. Discret. Math. 36(4): 2453-2472 (2022) - [j4]Nick Brettell
Computing subset transversals in H-free graphs. Theor. Comput. Sci. 902: 76-92 (2022) - [c8]Giacomo Paesani
Classifying Subset Feedback Vertex Set for H-Free Graphs. WG 2022: 412-424 - [i8]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Classifying Subset Feedback Vertex Set for H-Free Graphs. CoRR abs/2201.00430 (2022) - 2021
- [b1]Giacomo Paesani:
Graph transversals for hereditary graph classes : a complexity perspective. Durham University, UK, 2021 - [j3]Hans L. Bodlaender
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867: 30-39 (2021) - [c7]Giacomo Paesani
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. MFCS 2021: 82:1-82:14 - [i7]Giacomo Paesani, Daniël Paulusma
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. CoRR abs/2105.02736 (2021) - 2020
- [j2]Matthew Johnson
Connected Vertex Cover for (sP1+P5)-Free Graphs. Algorithmica 82(1): 20-40 (2020) - [j1]Konrad K. Dabrowski
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82(10): 2841-2866 (2020) - [c6]Nick Brettell
Bounding the Mim-Width of Hereditary Graph Classes. IPEC 2020: 6:1-6:18 - [c5]Hans L. Bodlaender
Steiner Trees for Hereditary Graph Classes. LATIN 2020: 613-624 - [c4]Nick Brettell
Computing Subset Transversals in H-Free Graphs. WG 2020: 187-199 - [i6]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
Bounding the Mim-Width of Hereditary Graph Classes. CoRR abs/2004.05018 (2020) - [i5]Hans L. Bodlaender
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR abs/2004.07492 (2020) - [i4]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
Computing Subset Transversals in H-Free Graphs. CoRR abs/2005.13938 (2020)
2010 – 2019
- 2019
- [c3]Carl Feghali
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT 2019: 258-273 - [i3]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR abs/1908.00491 (2019) - [i2]Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR abs/1910.05254 (2019) - 2018
- [c2]Konrad K. Dabrowski, Matthew Johnson
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS 2018: 63:1-63:15 - [c1]Matthew Johnson
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. WG 2018: 279-291 - 2017
- [i1]Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Connected Vertex Cover for (sP1+P5)-Free Graphs. CoRR abs/1712.08362 (2017)
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-11-28 20:30 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: