Skip to content
Universidad del Mar SIBUMAR Descubridor Institucional UMAR
  • Inicio
  • Búsqueda avanzada
  • Explorar
  • Login
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
Advanced
  • $O(n +f(k))$: Truly Linear FPT
Cover Image

$O(n +f(k))$: Truly Linear FPT

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Bumpus, Benjamin Merlin, Downey, Rod, Eagling-Vose, Tala, Enright, Jessica, Fellows, Michael R., Kutner, David C., Larios-Jones, Laura, Martin, Barnaby, Rosamond, Frances, Yates, Ella
Format: Preprint
Published: 2026
Subjects:
Computational Complexity
Discrete Mathematics
Data Structures and Algorithms
Online Access:
Acceder al recurso
Tags: Add Tag
No Tags, Be the first to tag this record!
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Save to List
  • Permanent link
  • Holdings
  • Description
  • Comments
  • Similar Items
  • Staff View

Internet

https://arxiv.org/abs/2606.02492

Similar Items

  • Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
    by: Eagling-Vose, Tala, et al.
    Published: (2025)
  • Steiner Forest for $H$-Subgraph-Free Graphs
    by: Eagling-Vose, Tala, et al.
    Published: (2026)
  • Finding d-Cuts in Claw-free Graphs
    by: Ahn, Jungho, et al.
    Published: (2025)
  • Finding $d$-Cuts in Probe $H$-Free Graphs
    by: Dabrowski, Konrad K., et al.
    Published: (2025)
  • Temporal Reachability Dominating Sets: contagion in temporal graphs
    by: Kutner, David C., et al.
    Published: (2023)
Universidad del Mar
Universidad del MarSistema Bibliotecario de la Universidad del MarDescubridor Institucional UMARImplementación y desarrollo: Mtro. Carlos Alonso Albores Pérez
InicioBúsqueda avanzadaExplorar
Visitas al Descubridor: 33,245© 2026 Universidad del Mar