Search results
From MaRDI portal
- freedom versus dimension for containment orders 1988-01-01 Paper Random interval graphs 1988-01-01 Paper On circle containment orders 1988-01-01 Paper On...10 bytes (19 words) - 19:55, 11 December 2023
- communication complexity 1992-09-27 Paper Geometric Containment and Partial Orders 1989-01-01 Paper Circle orders, n-gon orders and the crossing number 1988-01-01...10 bytes (18 words) - 02:06, 13 December 2023
- 2022-05-11 Paper Test for uniformity of exchangeable random variables on the circle 2022-04-27 Paper Generalized unnormalized optimal transport and its fast...10 bytes (17 words) - 14:16, 11 December 2023
- with the problem of packet losses when using the second-order neighbors' information 2019-02-08 Paper Necessary and sufficient conditions for circle formations...10 bytes (17 words) - 23:08, 9 December 2023
- Physarum Optimization: A Biology-Inspired Algorithm for the Steiner Tree Problem in Networks 2017-05-16 Paper An Online Mechanism for Resource Allocation...10 bytes (18 words) - 05:25, 9 December 2023
- Approximation Algorithms for Partial Set Multicover Problem 2021-06-23 Paper Influence maximization problem: properties and algorithms 2021-05-10 Paper On optimal...10 bytes (19 words) - 17:50, 7 December 2023
- functional analytic proof of a Borel selection theorem 1990-01-01 Paper On circle-valued cocycles of an ergodic measure preserving transformation 1988-01-01...10 bytes (18 words) - 20:12, 12 December 2023
- 1994-11-10 Paper On the de Bruijn torus problem 1993-12-02 Paper A short proof that \(N^ 3\) is not a circle containment order 1988-01-01 Paper...10 bytes (18 words) - 09:01, 9 December 2023
- lie within the unit circle 1976-01-01 Paper On the distance matrix of a tree 1976-01-01 Paper Some simplified NP-complete graph problems 1976-01-01 Paper...10 bytes (19 words) - 09:29, 13 December 2023
- Extremal problems in discrete geometry 1983-01-01 Paper The Ramsey number of a graph with bounded maximum degree 1983-01-01 Paper A combinatorial problem involving...10 bytes (21 words) - 03:42, 9 December 2023
- hypergraph sandwich problems 1998-10-14 Paper Interactive scheduling as a constraint satisfiability problem 1997-12-14 Paper Graph Sandwich Problems 1996-05-27...10 bytes (19 words) - 08:45, 9 December 2023
- Type Continuous and smooth images of sets 2013-08-01 Paper A factorization problem 2012-05-10 Paper https://portal.mardi4nfdi.de/entity/Q3503662 2008-06-06...10 bytes (16 words) - 17:25, 8 December 2023
- Paper Orientations of circle graphs 1982-01-01 Paper Circular permutation graphs 1982-01-01 Paper Finding maximum cliques in circle graphs 1981-01-01 Paper...10 bytes (18 words) - 13:27, 8 December 2023
- Paper https://portal.mardi4nfdi.de/entity/Q5750899 1989-01-01 Paper On circle containment orders 1988-01-01 Paper Subgraph counts in random graphs using incomplete...10 bytes (18 words) - 04:07, 12 December 2023
- algorithm for the critical node detection problem 2016-11-10 Paper A randomized algorithm with local search for containment of pandemic disease spread 2016-11-10...10 bytes (19 words) - 10:55, 11 December 2023
- nonrepetitive chromatic number 2020-10-20 Paper Bipartite complements of circle graphs 2020-04-21 Paper Local approximation of the maximum cut in regular...10 bytes (16 words) - 16:48, 24 September 2023
- kernels for packing problems 2019-04-25 Paper Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem 2019-01-18 Paper https://portal...10 bytes (17 words) - 14:13, 6 October 2023
- MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM 1996-02-26 Paper SIMULTANEOUS CONTAINMENT OF SEVERAL POLYGONS: ANALYSIS OF THE CONTACT CONFIGURATIONS...10 bytes (17 words) - 05:05, 9 December 2023
- drilling platform 2023-11-29 Paper A robust time‐inconsistent linear‐quadratic problem 2023-11-13 Paper Fault‐tolerant consensus for switched multiagent systems...10 bytes (18 words) - 13:52, 10 December 2023
- Approximation algorithms for the maximum weight internal spanning tree problem 2019-10-17 Paper https://portal.mardi4nfdi.de/entity/Q5196062 2019-10-02...10 bytes (16 words) - 02:39, 11 December 2023
