Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Academic Journal

Computing the fully optimal spanning tree of an ordered bipolar directed graph

Subjects: Bipolar directed graph; Spanning tree; Computational complexity

  • Source: ISSN: 0012-365X ; Discrete Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449 ; Discrete Mathematics, 2024, 347 (5),

Record details

×
Academic Journal

Computing the fully optimal spanning tree of an ordered bipolar directed graph

Subjects: Bipolar directed graph; Spanning tree; Computational complexity

  • Source: ISSN: 0012-365X ; Discrete Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449 ; Discrete Mathematics, In press.

Record details

×
Conference

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces

Subjects: Universal obstruction; Surface containment; Erdős-Pósa propertyTallin; EstoniaTallin, Estonia

  • Source: ICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04702132 ; ICALP 2024 - 51st International Colloquium on Automata, Languages,

Record details

×
Academic Journal

FPT algorithms for packing k-safe spanning rooted sub(di)graphs

Subjects: Digraphs; Packing problems; Arborescences

  • Source: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990 ; Discrete Applied Mathematics, 2024,

Record details

×
Conference

Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations

Subjects: hitting subgraphs; Hitting induced subgraphs; Parameterized complexityTallinn; EstoniaTallinn, Estonia

  • Source: Leibniz International Proceedings in Informatics (LIPIcs) ; ICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04700560 ; ICALP

Record details

×
Conference

Kolmogorov complexity as a combinatorial tool

Subjects: Kolmorogov complexity; Combinatorial game; [INFO]Computer Science [cs]Amsterdam; Netherlands

  • Source: Twenty Years of Theoretical and Practical Synergies ; CiE 2024 - 20th Conference on Computability in Europe ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04647436 ; CiE 2024 - 20th Conference on

Record details

×
Academic Journal

Faster parameterized algorithms for modification problems to minor-closed classes

Subjects: Graph minors; Graph modification problems; Vertex deletion

  • Source: EISSN: 2751-4838 ; TheoretiCS ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04698814 ; TheoretiCS, 2024, 3, ⟨10.46298/theoretics.24.19⟩

Record details

×
Conference

Kernelization for Graph Packing Problems via Rainbow Matching

Subjects: Kernelization; Parameterized algorithms; Rainbow matchingFlorence; ItalyFlorence, Italy

  • Source: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ; SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms ; https://hal.science/hal-04042995 ; SODA 2023 - ACM-SIAM

Record details

×
  • 1-10 of  793 results for ""Mathematics""