The following pages link to Antoine Deza (Q173841):
Displayed 50 items.
- A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
- A note on lower bounds for colourful simplicial depth (Q350647) (← links)
- Corrigendum to: ``On a lemma of Crochemore and Rytter'' (Q350728) (← links)
- A computational framework for determining run-maximal strings (Q396644) (← links)
- On the structure of run-maximal strings (Q414413) (← links)
- How many double squares can a string contain? (Q476303) (← links)
- On a lemma of Crochemore and Rytter (Q491147) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- More colourful simplices (Q629837) (← links)
- Primitive zonotopes (Q724942) (← links)
- A linear optimization oracle for zonotope computation (Q824329) (← links)
- Polytopes and arrangements: diameter and curvature (Q935228) (← links)
- The colourful feasibility problem (Q944700) (← links)
- A continuous \(d\)-step conjecture for polytopes (Q1017920) (← links)
- McMullen's conditions and some lower bounds for general convex polytopes (Q1337108) (← links)
- Fullerenes and coordination polyhedra versus half-cube embeddings (Q1584443) (← links)
- Solitaire lattices (Q1606024) (← links)
- On component commonality for periodic review assemble-to-order systems (Q1657397) (← links)
- Small primitive zonotopes (Q1740472) (← links)
- A primal-simplex based Tardos' algorithm (Q1785451) (← links)
- Charging station optimization for balanced electric car sharing (Q2064295) (← links)
- Distance between vertices of lattice polytopes (Q2174873) (← links)
- Correction to: ``Distance between vertices of lattice polytopes'' (Q2174875) (← links)
- On the generalized Berge sorting conjecture (Q2266928) (← links)
- On inventory allocation for periodic review assemble-to-order systems (Q2297661) (← links)
- On a conjecture of Erdős for multiplicities of cliques (Q2376784) (← links)
- One of the ``problèmes plaisants et délectables'' by Claude Berge (Un des ``problèmes plaisants et délectables'' de Claude Berge). (Q2433697) (← links)
- A counterexample to the dominating set conjecture (Q2458916) (← links)
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds (Q2476985) (← links)
- The isometries of the cut, metric and hypermetric cones (Q2494270) (← links)
- Colourful simplicial depth (Q2498935) (← links)
- A Further Generalization of the Colourful Carathéodory Theorem (Q2848999) (← links)
- Selected Open Problems in Discrete Geometry and Optimization (Q2849006) (← links)
- (Q2895333) (← links)
- (Q2906427) (← links)
- A d-Step Approach for Distinct Squares in Strings (Q3011845) (← links)
- (Q3012574) (← links)
- Polytopal balls arising in optimization (Q3391332) (← links)
- The central path visits all the vertices of the Klee–Minty cube (Q3423600) (← links)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- Hyperplane Arrangements with Large Average Diameter (Q3622257) (← links)
- (Q4309968) (← links)
- (Q4313881) (← links)
- (Q4320810) (← links)
- (Q4547798) (← links)
- Optimization over Degree Sequences (Q4579955) (← links)
- SMALL DEGENERATE SIMPLICES CAN BE BAD FOR SIMPLEX METHODS (Q4609153) (← links)
- (Q4761958) (← links)
- (Q4836292) (← links)