Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • and prime gaps 2021-12-03 Paper Assouad dimensions and spectra of Moran cut-out sets 2020-11-23 Paper QUASI-LOWER DIMENSION AND QUASI-LIPSCHITZ MAPPING 2017-10-02...
    10 bytes (16 words) - 00:10, 25 September 2023
  • 2007-07-02 Paper https://portal.mardi4nfdi.de/entity/Q5292159 2007-06-19 Paper Cut-out sets and the Zipf law for fractal voids 2006-12-14 Paper https://portal.mardi4nfdi...
    10 bytes (16 words) - 09:55, 7 October 2023
  • Type Rough set models of some abstract algebras close to pre-rough algebra 2024-04-18 Paper Algebras and Logics Emerging Out of Rough Sets (An Invited...
    10 bytes (18 words) - 23:58, 10 December 2023
  • Achievable Throughput 2017-08-08 Paper Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets 2017-07-27 Paper On the Optimal Compressions in the...
    10 bytes (17 words) - 01:56, 13 December 2023
  • Waiting 2022-06-27 Paper Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems 2022-05-20 Paper Near real-time...
    10 bytes (20 words) - 16:37, 6 December 2023
  • of 1-out-of-2:G repairable dependent system 1989-01-01 Paper Performance measure estimation for repairable systems 1987-01-01 Paper Analysis of 1-out-of-2:G...
    10 bytes (19 words) - 09:09, 13 December 2023
  • Waiting 2022-06-27 Paper Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems 2022-05-20 Paper Near real-time...
    10 bytes (18 words) - 15:40, 10 December 2023
  • 2012-06-20 Paper Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study 2012-06-18 Paper Laying Out Sparse Graphs with Provably Minimum...
    10 bytes (16 words) - 17:05, 8 December 2023
  • heuristics for the maximum independent set problem 2009-03-31 Paper An Algorithm for Enhancing Spreadsheet Regression with Out-of-Sample Statistics 2008-12-04...
    10 bytes (16 words) - 07:42, 9 December 2023
  • 2011-02-18 Paper On covering by translates of a set 2011-01-17 Paper Clique percolation 2010-11-09 Paper The cut metric, random graphs, and branching processes...
    10 bytes (17 words) - 21:02, 9 December 2023
  • estimation based on ranked set sampling 2002-07-28 Paper Statistical and information based (physical) minimal repair for k out of n Systems 1999-02-02 Paper...
    10 bytes (18 words) - 23:24, 12 December 2023
  • convex sets in acyclic digraphs 2009-12-10 Paper Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs 2009-11-27 Paper Minimum leaf out-branching...
    10 bytes (18 words) - 10:09, 8 December 2023
  • eigenvalues of the Laplacian with a Neumann boundary condition on a thin cut-out tube 2011-10-14 Paper Asymptotics of the eigenelements of the Laplace operator...
    10 bytes (18 words) - 18:44, 12 December 2023
  • Paper Universally-Optimal Distributed Exact Min-Cut 2024-03-26 Paper Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs 2024-03-26 Paper...
    10 bytes (16 words) - 12:54, 28 January 2024
  • \(k\)-hop connected dominating set problem: approximation and hardness 2017-11-09 Paper The \(k\)-hop connected dominating set problem: hardness and polyhedra...
    10 bytes (20 words) - 10:58, 7 October 2023
  • 2010-09-16 Paper A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts 2010-06-22 Paper An In-Out Approach to Disjunctive Optimization 2010-06-22 Paper...
    10 bytes (16 words) - 20:19, 24 September 2023
  • Connectivity for Feedback Vertex Set 2014-10-14 Paper A Reconfigurations Analogue of Brooks’ Theorem 2014-10-14 Paper Knocking Out P k -free Graphs 2014-10-14...
    10 bytes (16 words) - 13:28, 8 December 2023
  • accesses 2023-12-08 Paper Load balancing with dynamic set of balls and bins 2023-11-14 Paper How to cut corners and get bounded convex curvature 2023-05-12...
    10 bytes (17 words) - 20:42, 9 December 2023
  • for generalizations of directed feedback vertex set 2020-02-06 Paper Domination When the Stars Are Out 2019-11-25 Paper A time- and space-optimal algorithm...
    10 bytes (17 words) - 03:04, 7 October 2023
  • 2018-10-23 Paper Lagrangian and branch-and-cut approaches for upgrading spanning tree problems 2018-07-11 Paper A relax-and-cut framework for large-scale maximum...
    10 bytes (17 words) - 07:43, 7 October 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)