The following pages link to Friedrich Eisenbrand (Q378117):
Displaying 50 items.
- Testing additive integrality gaps (Q378120) (← links)
- Coloring fuzzy circular interval graphs (Q412282) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Convexly independent subsets of the Minkowski sum of planar point sets (Q1010661) (← links)
- Detecting directed 4-cycles still faster (Q1014385) (← links)
- Multiline addressing by network flow (Q1016524) (← links)
- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently (Q1028588) (← links)
- On the membership problem for the elementary closure of a polyhedron (Q1125619) (← links)
- Primal separation for 0/1 polytopes (Q1396830) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- Bounds on the Chvatal rank of polytopes in the 0/1-cube (Q1416165) (← links)
- (Q1603455) (redirect page) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- A note on non-degenerate integer programs with small sub-determinants (Q1755835) (← links)
- A linear algorithm for integer programming in the plane (Q1771307) (← links)
- Pope Gregory, the calendar, and continued fractions (Q1946011) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- On the Chvátal rank of polytopes in the 0/1 cube (Q1961231) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Geometric random edge (Q2364496) (← links)
- Carathéodory bounds for integer cones (Q2480055) (← links)
- Coloring Fuzzy Circular Interval Graphs (Q2851514) (← links)
- (Q2921760) (← links)
- Bin Packing via Discrepancy of Permutations (Q2933654) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- Max-sum diversity via convex programming (Q3132860) (← links)
- Parametric Integer Programming in Fixed Dimension (Q3168997) (← links)
- Network Formulations of Mixed-Integer Programs (Q3169026) (← links)
- Diameter of Polyhedra: Limits of Abstraction (Q3169119) (← links)
- Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups (Q3434548) (← links)
- Node-Balancing by Edge-Increments (Q3452807) (← links)
- PACKING A TRUCK — NOW WITH A TWIST! (Q3503017) (← links)
- New Approaches for Virtual Private Network Design (Q3507517) (← links)
- ENERGY-AWARE STAGE ILLUMINATION (Q3521594) (← links)
- A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation (Q3521924) (← links)
- Integer Programming and Algorithmic Geometry of Numbers (Q3565243) (← links)
- (Q3579459) (← links)
- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods (Q3586447) (← links)
- Scheduling Periodic Tasks in a Hard Real-Time Environment (Q3587387) (← links)
- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs (Q3596357) (← links)
- (Q3602889) (← links)
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations (Q3623003) (← links)
- New Hardness Results for Diophantine Approximation (Q3638871) (← links)
- On factor refinement in number fields (Q4221983) (← links)
- (Q4263708) (← links)
- (Q4471338) (← links)
- (Q4518860) (← links)
- (Q4537737) (← links)
- Local Search for Max-Sum Diversification (Q4575743) (← links)
