vix.ing · top · new · best · stats · spec

Lima, Paloma T.

  1. XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure
    2022/01/31 by Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo +2 · 4 citations
    #Computational Complexity (cs.CC) #FOS: Computer and information sciences
  2. Tree decompositions meet induced matchings: beyond Max Weight Independent Set
    2024/02/24 by Lima, Paloma T., Milanič, Martin, Muršič, Peter +3 · 6 citations
    #05C05 #05C12 #05C15 #05C38 #05C40 #05C70 #05C75 #05C76 #05C83 (Secondary) #05C85 (Primary) #68Q25 #68R10 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  3. b-Coloring Parameterized by Clique-Width
    2020/03/09 by Lars Jaffke, Paloma T. Lima, Jaffke, Lars +3 · 2 citations
    Computer Science · Engineering · #05C15 #05C85 #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2 #Scheduling and Optimization Algorithms
  4. Parameterized Aspects of Strong Subgraph Closure
    2018/02/28 by Golovach, Petr A., Heggernes, Pinar, Konstantinidis, Athanasios L. +2 · 2 citations
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  5. Transversals of Longest Paths
    2017/12/19 by Cerioli, Márcia R., Fernandes, Cristina G., Gómez, Renzo +2 · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  6. Taming graphs with no large creatures and skinny ladders
    2022/05/02 by Gajarský, Jakub, Jaffke, Lars, Lima, Paloma T. +4 · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics