The following pages link to Dirk Oliver Theis (Q257226):
Displaying 39 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- (Q311523) (redirect page) (← links)
- New conjectures for union-closed families (Q311524) (← links)
- Small minors in dense graphs (Q427808) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone (Q708346) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- Extended spanning star forest problems (Q1699782) (← links)
- Fooling sets and the spanning tree polytope (Q1705643) (← links)
- Combinatorial bounds on nonnegative rank and extended formulations (Q1759811) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- Fooling-sets and rank (Q2346587) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- The (minimum) rank of typical fooling-set matrices (Q2399380) (← links)
- On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165) (← links)
- Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
- A note on the cops and robber game on graphs embedded in non-orientable surfaces (Q2441345) (← links)
- On the general routing polytope (Q2473035) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- A note on the undirected rural postman problem polytope (Q2492671) (← links)
- An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
- The chromatic number of random lifts of (Q2840555) (← links)
- Random Lifts of $K_5\backslashe$ are 3-Colorable (Q2902895) (← links)
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract) (Q2971660) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- The VPN Problem with Concave Costs (Q3008029) (← links)
- Symmetry Matters for the Sizes of Extended Formulations (Q3569814) (← links)
- Not Every GTSP Facet Induces an STSP Facet (Q3596367) (← links)
- Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited (Q3648510) (← links)
- Short note on the number of 1-ascents in dispersed Dyck paths (Q4597962) (← links)
- Symmetry Matters for Sizes of Extended Formulations (Q4899066) (← links)
- The Cops and Robber game on graphs with forbidden (induced) subgraphs (Q5265407) (← links)
- (Q5290824) (← links)
- Transformation of Facets of the General Routing Problem Polytope (Q5317556) (← links)
- Fooling-sets and rank in nonzero characteristic (extended abstract) (Q5419994) (← links)
- Integer Programming and Combinatorial Optimization (Q5712453) (← links)
- BROJA-2PID: A robust estimator for bivariate partial information decomposition (Q6297441) (← links)
- "Proper" Shift Rules for Derivatives of Perturbed-Parametric Quantum Evolutions (Q6403943) (← links)
