Search Results - Paesani, Giacomo

Refine Results
  1. 1
    On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest

    On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest by Dabrowski, Konrad K., Feghali, Carl, Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël, Rzążewski, Paweł

    Published in Algorithmica
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Classifying subset feedback vertex set for H-free graphs

    Classifying subset feedback vertex set for H-free graphs by Paesani, Giacomo, Paulusma, Daniël, Rzążewski, Paweł

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  3. 3
    Connected Vertex Cover for (sP1+P5)-Free Graphs

    Connected Vertex Cover for (sP1+P5)-Free Graphs by Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël

    Published in Algorithmica
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    Computing subset transversals in H-free graphs

    Computing subset transversals in H-free graphs by Brettell, Nick, Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs

    Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs by Paesani, Giacomo, Paulusma, Daniël, Rzążwski, Paweł

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  6. 6
    Bounding the mim‐width of hereditary graph classes

    Bounding the mim‐width of hereditary graph classes by Brettell, Nick, Horsfield, Jake, Munaro, Andrea, Paesani, Giacomo, Paulusma, Daniël

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    On the price of independence for vertex cover, feedback vertex set and odd cycle transversal

    On the price of independence for vertex cover, feedback vertex set and odd cycle transversal by Dabrowski, Konrad K., Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël, Zamaraev, Viktor

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  8. 8
    Steiner trees for hereditary graph classes: A treewidth perspective

    Steiner trees for hereditary graph classes: A treewidth perspective by Bodlaender, Hans L., Brettell, Nick, Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël, van Leeuwen, Erik Jan

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  9. 9
    A General Theoretical Framework for Learning Smallest Interpretable Models

    A General Theoretical Framework for Learning Smallest Interpretable Models by Ordyniak, Sebastian, Paesani, Giacomo, Rychlicki, Mateusz, Szeider, Stefan

    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  10. 10
    Learning Small Decision Trees for Data of Low Rank-Width

    Learning Small Decision Trees for Data of Low Rank-Width by Dabrowski, Konrad K., Eiben, Eduard, Ordyniak, Sebastian, Paesani, Giacomo, Szeider, Stefan

    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  11. 11
    Bounding the Mim-Width of Hereditary Graph Classes

    Bounding the Mim-Width of Hereditary Graph Classes by Brettell, Nick, Horsfield, Jake, Munaro, Andrea, Paesani, Giacomo, Paulusma, Daniel

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Toward a Unified Graph-Based Representation of Medical Data for Precision Oncology Medicine

    Toward a Unified Graph-Based Representation of Medical Data for Precision Oncology Medicine by Belluomo, Davide, Calamoneri, Tiziana, Paesani, Giacomo, Salvo, Ivano

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Explaining Decisions in ML Models: a Parameterized Complexity Analysis

    Explaining Decisions in ML Models: a Parameterized Complexity Analysis by Ordyniak, Sebastian, Paesani, Giacomo, Rychlicki, Mateusz, Szeider, Stefan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A Tight Subexponential-time Algorithm for Two-Page Book Embedding

    A Tight Subexponential-time Algorithm for Two-Page Book Embedding by Ganian, Robert, Mueller, Haiko, Ordyniak, Sebastian, Paesani, Giacomo, Rychlicki, Mateusz

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Classifying Subset Feedback Vertex Set for \(H\)-Free Graphs

    Classifying Subset Feedback Vertex Set for \(H\)-Free Graphs by Paesani, Giacomo, Paulusma, Daniël, Rzążewski, Paweł

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs

    Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs by Paesani, Giacomo, Paulusma, Daniël, Rzążewski, Paweł

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Computing Subset Transversals in \(H\)-Free Graphs

    Computing Subset Transversals in \(H\)-Free Graphs by Brettell, Nick, Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Connected Vertex Cover for \((sP_1+P_5)\)-Free Graphs

    Connected Vertex Cover for \((sP_1+P_5)\)-Free Graphs by Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniel

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective

    Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective by Bodlaender, Hans, Brettell, Nick, Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniel, van Leeuwen, Erik Jan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal

    On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal by Dabrowski, Konrad K, Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël, Zamaraev, Viktor

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: