Search results

From MaRDI portal
  • polynomial kernel for bipartite permutation vertex deletion 2022-10-27 Paper Parameterized Complexity of Fair Feedback Vertex Set Problem 2022-10-19 Paper Kernelization...
    10 bytes (17 words) - 02:43, 25 September 2023
  • and Covering Immersion Models of Planar Subcubic Graphs 2016-12-22 Paper Irrelevant vertices for the planar disjoint paths problem 2016-11-25 Paper Planar...
    10 bytes (19 words) - 15:04, 10 December 2023
  • analytical approximate technique for a class of strongly non-linear oscillators 2009-05-22 Paper A general Struble's technique for solving an \(n\)-th...
    10 bytes (15 words) - 02:18, 25 September 2023
  • Initial-value technique for self-adjoint singular perturbation boundary value problems 2009-11-13 Paper Erratum to the article ``Initial-value technique for self-adjoint...
    10 bytes (15 words) - 21:03, 22 September 2023
  • Publication date: 18 July 2022 zbMATH Keywords planar graphs; irrelevant vertex technique; modification problems Mathematics Subject Classification ID 68Qxx:...
    15 bytes (38 words) - 13:46, 8 February 2024
  • meta-theorems; graph modification problems; first order logic; irrelevant vertex technique; surface embeddable graphs Mathematics Subject Classification...
    15 bytes (62 words) - 06:58, 7 March 2024
  • 00882 zbMATH Keywords treewidth; obstructions; graph minors; irrelevant vertex technique; flat wall theorem Mathematics Subject Classification ID 05C83:...
    15 bytes (69 words) - 17:15, 25 April 2024
  • linkages; parameterized algorithms; graph minors; bidimensionality; irrelevant vertex technique Mathematics Subject Classification ID 68Q25: Analysis of algorithms...
    15 bytes (82 words) - 21:12, 3 February 2024
  • de/LIPIcs/frontdoor_8f12.html zbMATH Keywords parameterized complexity; irrelevant vertex technique; subexponential time algorithms; partial cover problems Mathematics...
    15 bytes (83 words) - 21:13, 3 February 2024
  • graphs; fixed parameter tractability; odd cycles; induced packing; irrelevant vertex technique Mathematics Subject Classification ID 68R10: Graph theory (including...
    15 bytes (107 words) - 11:26, 30 January 2024
  • different service phase initiations 2019-03-29 Paper Geometric programming technique to optimize power distribution system 2019-03-29 Paper Estimating across-trial...
    10 bytes (15 words) - 21:06, 24 September 2023
  • Brave) zbMATH Keywords perturbation; polyhedron; convex polytopes; degenerate vertex; incident edges Mathematics Subject Classification ID 52B12: Special polytopes...
    15 bytes (238 words) - 13:02, 31 January 2024
  • Method A Technique for Resolving Degeneracy in Linear Programming A note on cycling in the simplex method An Algorithm for Determining Irrelevant Constraints...
    15 bytes (269 words) - 13:02, 31 January 2024
  • Network Simplex Method A Technique for Resolving Degeneracy in Linear Programming Cycling in the transportation problem Techniques for Removing Nonbinding...
    15 bytes (576 words) - 13:02, 31 January 2024
  • applications, Discrepancy and approximations for bounded VC-dimension, Bounding the vertex cover number of a hypergraph, Sparse approximate multiquadric interpolation...
    15 bytes (1,091 words) - 22:26, 4 February 2024