Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • 2022-09-23 Paper https://portal.mardi4nfdi.de/entity/Q4956552 2021-09-02 Paper Cycle traversability for claw-free graphs and polyhedral maps 2020-12-18 Paper...
    10 bytes (17 words) - 02:22, 11 December 2023
  • Multiple Realization Trees 2013-07-29 Paper Cycle transversals in bounded degree graphs 2013-07-19 Paper Cycle transversals in perfect graphs and cographs...
    10 bytes (18 words) - 23:42, 10 December 2023
  • Planar Graphs with Forbidden Cycles 2016-04-15 Paper Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle 2015-12-11 Paper 3-Coloring...
    10 bytes (17 words) - 23:42, 10 December 2023
  • algorithms and hardness results for cycle packing problems 2018-11-05 Paper Full subgraphs 2018-08-16 Paper Cycles in triangle-free graphs of large chromatic...
    10 bytes (17 words) - 00:25, 11 December 2023
  • vivification by unit propagation in CDCL SAT solvers 2020-01-20 Paper Breaking Cycle Structure to Improve Lower Bound for Max-SAT 2019-04-26 Paper An iterative...
    10 bytes (17 words) - 11:03, 11 December 2023
  • assignment problem on single-cycle permutations 2015-07-27 Paper On solvability of the axial 8-index assignment problem on single-cycle permutations 2015-07-17...
    10 bytes (18 words) - 03:38, 12 December 2023
  • based on refined observations 2018-03-26 Paper Planar vertex-disjoint cycle packing: new structures and improved kernel 2018-03-26 Paper SDTRLS: predicting...
    10 bytes (17 words) - 10:22, 11 December 2023
  • approach to the 2D bin packing and variable-sized bin packing problems 2014-07-27 Paper A reference length approach for the 3D strip packing problem 2012-12-29...
    10 bytes (16 words) - 09:49, 7 October 2023
  • number 2018-11-15 Paper Approximation algorithms and hardness results for cycle packing problems 2018-11-05 Paper Approximating the Diameter of Planar Graphs...
    10 bytes (17 words) - 11:59, 9 December 2023
  • self-complementary cyclic packing of forests 2009-04-07 Paper On arbitraly vertex decomposable unicyclic graphs with dominating cycle 2008-01-18 Paper Some...
    10 bytes (18 words) - 18:20, 9 December 2023
  • have 4-cycle decompositions 2008-05-29 Paper Maximum cyclic 4-cycle packings of the complete multipartite graph 2008-02-18 Paper Packing 5-cycles into balanced...
    10 bytes (17 words) - 11:58, 9 December 2023
  • node-capacitated undirected networks 2013-01-03 Paper An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks 2012-09-25 Paper Resilient Quicksort...
    10 bytes (18 words) - 22:42, 10 December 2023
  • conjecture on graph packing 2016-05-25 Paper A list version of graph packing 2016-05-18 Paper On 3-uniform hypergraphs without linear cycles 2016-02-19 Paper...
    10 bytes (16 words) - 06:12, 9 December 2023
  • a graph 2020-01-08 Paper Packing parameters in graphs: new bounds and a solution to an open problem 2019-10-29 Paper Packing and domination parameters...
    10 bytes (18 words) - 00:45, 10 December 2023
  • 2001-03-04 Paper Packing and covering triangles in graphs 2000-02-09 Paper https://portal.mardi4nfdi.de/entity/Q4370210 1999-04-25 Paper Packing and covering...
    10 bytes (19 words) - 13:37, 11 December 2023
  • 2020-08-03 Paper Packing arc-disjoint cycles in bipartite tournaments 2020-07-22 Paper The parameterized complexity of cycle packing: indifference is not...
    10 bytes (16 words) - 09:18, 7 October 2023
  • 2023-06-20 Paper Parallel online algorithms for the bin packing problem 2023-04-21 Paper Packing disks into disks with optimal worst-case density 2023-01-23...
    10 bytes (18 words) - 10:24, 8 December 2023
  • graphs without 4-cycles 2014-01-17 Paper Neighborhood unions for the existence of disjoint chorded cycles in graphs 2013-09-26 Paper Every cycle-connected multipartite...
    10 bytes (17 words) - 19:18, 9 December 2023
  • vertex-connectivity augmentation on the cycle 2022-10-19 Paper Approximating Geometric Knapsack via L-packings 2022-02-22 Paper On the cycle augmentation problem: hardness...
    10 bytes (16 words) - 23:45, 24 September 2023
  • Square of a Hamiltonian Cycle 1994-11-27 Paper Covering Graphs by Cycles 1993-04-01 Paper Tutte's 3-flow conjecture and short cycle covers 1993-01-01 Paper...
    10 bytes (17 words) - 09:01, 9 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)