Search results
From MaRDI portal
- graphs of bounded genus and linklessly embeddable graphs 2020-01-29 Paper Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs...10 bytes (16 words) - 11:23, 8 December 2023
- 2004-10-01 Paper https://portal.mardi4nfdi.de/entity/Q4474212 2004-08-04 Paper Tight bound on Johnson's algorithm for maximum satisfiability 1999-11-09 Paper...10 bytes (18 words) - 21:56, 11 December 2023
- problems with inexact partial information 2007-12-10 Paper Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values 2007-10-26...10 bytes (16 words) - 14:20, 8 December 2023
- Date of Publication Type Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments 2023-05-23 Paper Tight Bounds for Online TSP on the Line...10 bytes (16 words) - 21:35, 24 September 2023
- Paper On sufficient conditions for spanning structures in dense graphs 2023-09-20 Paper Minimum degree conditions for tight Hamilton cycles 2023-08-21 Paper...10 bytes (18 words) - 09:19, 7 October 2023
- 2023-08-22 Paper Two completely independent spanning trees of \(P_4\)-free graphs 2023-04-24 Paper Laminar tight cuts in matching covered graphs 2021-07-06...10 bytes (16 words) - 16:11, 10 December 2023
- https://portal.mardi4nfdi.de/entity/Q5009600 2021-08-04 Paper A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths 2021-06-29...10 bytes (19 words) - 03:18, 12 December 2023
- expedients for the prize collecting Steiner tree problem 2013-05-31 Paper Tight compact models and comparative analysis for the prize collecting Steiner...10 bytes (16 words) - 12:56, 8 December 2023
- Correlation and Large Linear Span 2008-03-14 Paper A New Family of Gold-Like Sequences 2008-03-07 Paper On the linear span of the \(p\)-ary cascaded GMW...10 bytes (16 words) - 13:53, 6 October 2023
- connected-\(k\)-subgraph cover with connectivity requirement 2023-08-04 Paper Nearly tight approximation algorithm for (connected) Roman dominating set 2022-10-11 Paper...10 bytes (16 words) - 10:09, 6 October 2023
- 2019-11-21 Paper Spanning trees in random graphs 2019-10-10 Paper Fractional clique decompositions of dense graphs 2019-08-14 Paper Forcing large tight components...10 bytes (17 words) - 17:59, 24 September 2023
- scheduling of equal-length intervals on parallel machines 2012-07-20 Paper A tight lower bound for job scheduling with cancellation 2009-12-18 Paper Improved...10 bytes (18 words) - 15:50, 10 December 2023
- Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms 2024-02-09 Paper Shifting paths to avoidable ones 2023-10-05 Paper...10 bytes (19 words) - 11:53, 11 December 2023
- budgets 2021-06-11 Paper Tight welfare guarantees for pure Nash equilibria of the uniform price auction 2019-09-05 Paper Tight welfare guarantees for pure...10 bytes (18 words) - 14:54, 28 January 2024
- 2014-08-07 Paper Approximate polytope membership queries 2014-06-05 Paper Tight lower bounds for halfspace range searching 2014-04-03 Paper A dynamic data...10 bytes (19 words) - 04:25, 9 December 2023
- Storage in Byzantine Asynchronous Message-Passing Systems 2016-03-23 Paper Tight bound on mobile Byzantine agreement 2015-12-08 Paper Practically stabilizing...10 bytes (21 words) - 22:21, 10 December 2023
- de/entity/Q4926086 2013-06-20 Paper Symmetry feature and construction for the 3-band tight framelets with prescribed properties 2012-11-15 Paper Hamiltonian connectedness...10 bytes (17 words) - 22:17, 10 December 2023
- parameterized above and below tight bounds 2011-03-30 Paper A probabilistic approach to problems parameterized above or below tight bounds 2011-03-28 Paper https://portal...10 bytes (18 words) - 10:09, 8 December 2023
- Symbolic Program Analysis in Almost-Linear Time 1982-01-01 Paper Asymptotically tight bounds on time-space trade-offs in a pebble game 1982-01-01 Paper A Unified...10 bytes (19 words) - 21:52, 9 December 2023
- objects, maximal points and approximations using coresets 2021-10-21 Paper Tight bounds on the clique chromatic number 2021-09-28 Paper https://portal.mardi4nfdi...10 bytes (20 words) - 20:18, 8 December 2023
