Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Paper https://portal.mardi4nfdi.de/entity/Q5002626 2021-07-28 Paper Inapproximability of the Independent Set Polynomial in the Complex Plane 2020-10-26 Paper...
    10 bytes (16 words) - 00:01, 9 December 2023
  • 2016-10-21 Paper Roman domination in subgraphs of grids 2016-10-17 Paper Inapproximability of the lid-chromatic number 2016-10-17 Paper Complexity aspects of...
    10 bytes (18 words) - 02:38, 10 December 2023
  • polynomial inapproximability and fixed parameter approximability of Edge Dominating Set 2015-05-29 Paper On subexponential and FPT-time inapproximability 2015-05-04...
    10 bytes (16 words) - 12:40, 28 January 2024
  • problems in rotagraphs and fasciagraphs 2016-05-18 Paper Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured...
    10 bytes (16 words) - 15:05, 10 December 2023
  • Paper Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations 2007-05-02 Paper Minimum 2SAT-DELETION: Inapproximability results...
    10 bytes (16 words) - 16:17, 8 December 2023
  • guarding. 2002-07-14 Paper Inapproximability of finding maximum hidden sets on polygons and terrains 2002-03-14 Paper Inapproximability results for guarding...
    10 bytes (19 words) - 08:05, 9 December 2023
  • Paper Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations 2007-05-02 Paper Minimum 2SAT-DELETION: Inapproximability results...
    10 bytes (16 words) - 05:54, 12 December 2023
  • 2008-12-21 Paper Inapproximability results for combinatorial auctions with submodular utility functions 2008-09-12 Paper Optimal Inapproximability Results for...
    10 bytes (19 words) - 23:24, 11 December 2023
  • request-service problem 2010-10-26 Paper Parameterized lower bound and inapproximability of polylogarithmic string barcoding 2008-09-02 Paper...
    10 bytes (18 words) - 20:26, 12 December 2023
  • functions 2013-03-27 Paper Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems 2012-11-02 Paper Inapproximability of NP-Complete Variants...
    10 bytes (16 words) - 06:00, 7 October 2023
  • 2015-10-27 Paper Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region 2015-06-26 Paper Improved inapproximability results for...
    10 bytes (16 words) - 03:36, 25 September 2023
  • Complexity and inapproximability results for parallel task scheduling and strip packing 2020-02-27 Paper Complexity and inapproximability results for parallel...
    10 bytes (16 words) - 17:47, 24 September 2023
  • Complexity and inapproximability results for parallel task scheduling and strip packing 2020-02-27 Paper Complexity and inapproximability results for parallel...
    10 bytes (16 words) - 17:47, 24 September 2023
  • connectivity problems 2010-05-25 Paper Inapproximability of survivable networks 2009-05-28 Paper Inapproximability of Survivable Networks 2008-11-27 Paper...
    10 bytes (16 words) - 13:52, 7 October 2023
  • Paper https://portal.mardi4nfdi.de/entity/Q5377222 2019-05-23 Paper Inapproximability results related to monophonic convexity 2015-09-30 Paper...
    10 bytes (18 words) - 03:45, 12 December 2023
  • Affine Codes for Correcting Insertions/Deletions 2023-06-14 Paper Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms 2023-04-04 Paper https://portal...
    10 bytes (17 words) - 21:31, 8 December 2023
  • 2019-10-22 Paper Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension 2018-01-31 Paper Inapproximability of Truthful...
    10 bytes (16 words) - 10:08, 25 September 2023
  • Publication Date of Publication Type Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension 2018-01-31 Paper...
    10 bytes (16 words) - 12:49, 7 October 2023
  • Approximation hardness of graphic TSP on cubic graphs 2015-10-20 Paper New inapproximability bounds for TSP 2015-08-31 Paper Nearly tight approximation bounds for...
    10 bytes (16 words) - 09:56, 6 October 2023
  • 2017-07-27 Paper Inapproximability Results for the Weight Problems of Subgroup Permutation Codes 2017-06-08 Paper On the inapproximability of maximum intersection...
    10 bytes (18 words) - 09:44, 7 October 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)