Pages that link to "Item:Q3780763"
From MaRDI portal
The following pages link to Minkowski's Convex Body Theorem and Integer Programming (Q3780763):
Displaying 50 items.
- (Q5091027) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5111743) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- New Algorithmic Results for Bin Packing and Scheduling (Q5283351) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
- Cryptography Based on Quadratic Forms: Complexity Considerations (Q5504549) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5918435) (← links)
- Parameterized complexity of satisfactory partition problem (Q5918491) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Graph square roots of small distance from degree one graphs (Q5918752) (← links)
- On compact representations of Voronoi cells of lattices (Q5918916) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5925655) (← links)
- Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Lifts for Voronoi cells of lattices (Q6050227) (← links)
- Dynamic coloring on restricted graph classes (Q6057319) (← links)
- Sieve algorithms for some orthogonal integer lattices (Q6059067) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE (Q6108625) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- A survey on single server private information retrieval in a coding theory perspective (Q6157852) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
- On fluxes in the \(1^9\) Landau-Ginzburg model (Q6183498) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- Offensive alliances in graphs (Q6201327) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- A lattice attack on CRYSTALS-Kyber with correlation power analysis (Q6547868) (← links)
- Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing (Q6556087) (← links)
- Economical convex coverings and applications (Q6583674) (← links)
- On the concrete security of LWE with small secret (Q6611798) (← links)
