Dirk Oliver Theis

From MaRDI portal
Person:257226

Available identifiers

zbMath Open theis.dirk-oliverMaRDI QIDQ257226

List of research outcomes





PublicationDate of PublicationType
"Proper" Shift Rules for Derivatives of Perturbed-Parametric Quantum Evolutions2022-07-04Paper
On the combinatorial lower bound for the extension complexity of the spanning tree polytope2019-06-11Paper
Complexity and approximability of extended spanning star forest problems in general and complete graphs2019-05-29Paper
Fooling sets and the spanning tree polytope2018-03-16Paper
Extended spanning star forest problems2018-02-26Paper
Optimizing Bivariate Partial Information Decomposition2018-02-12Paper
BROJA-2PID: A robust estimator for bivariate partial information decomposition2018-02-07Paper
Short note on the number of 1-ascents in dispersed Dyck paths2017-12-14Paper
The (minimum) rank of typical fooling-set matrices2017-08-22Paper
The rectangle covering number of random Boolean matrices2017-07-13Paper
Nondeterministic communication complexity of random Boolean functions (extended abstract)2017-05-19Paper
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)2017-04-07Paper
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope2017-02-05Paper
On the Graph of the Pedigree Polytope2016-11-25Paper
New conjectures for union-closed families2016-09-13Paper
Compact formulations of the Steiner traveling salesman problem and related problems2016-03-15Paper
A branch and cut solver for the maximum stable set problem2015-08-24Paper
The cops and robber game on graphs with forbidden (induced) subgraphs2015-07-24Paper
Fooling-sets and rank2015-06-02Paper
On the facial structure of symmetric and graphical traveling salesman polyhedra2015-04-09Paper
Fooling-sets and rank in nonzero characteristic (extended abstract)2014-06-11Paper
A note on the cops and robber game on graphs embedded in non-orientable surfaces2014-03-24Paper
An algorithm for random signed 3-SAT with intervals2014-02-11Paper
The chromatic number of random lifts of \(K_5\setminus e\)2013-07-19Paper
Symmetry Matters for Sizes of Extended Formulations2013-01-04Paper
Combinatorial bounds on nonnegative rank and extended formulations2012-11-22Paper
Random lifts of \({K_5}\setminus{e}\) are 3-colorable2012-08-22Paper
Small minors in dense graphs2012-06-18Paper
On the satisfiability of random regular signed SAT formulas2011-12-06Paper
Good edge-labelings and graphs with girth at least five2011-09-06Paper
The VPN Problem with Concave Costs2011-06-17Paper
On a class of metrics related to graph layout problems2010-11-05Paper
A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone2010-10-11Paper
Symmetry matters for the sizes of extended formulations2010-06-22Paper
Odd Minimum Cut Sets and b-Matchings Revisited2009-11-27Paper
The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract)2008-12-12Paper
Computing finest mincut partitions of a graph and application to routing problems2008-02-26Paper
On the general routing polytope2008-02-26Paper
The Cops & Robber game on series-parallel graphs2007-12-18Paper
The VPN Tree Routing Conjecture for Outerplanar Networks2007-11-16Paper
Not Every GTSP Facet Induces an STSP Facet2007-08-30Paper
On some lower bounds on the number of bicliques needed to cover a bipartite graph2007-08-08Paper
On the graphical relaxation of the symmetric traveling salesman polytope2007-04-19Paper
On convex sets associated with permutations, cuts, and certain metrics2007-02-19Paper
A note on the undirected rural postman problem polytope2006-06-14Paper
https://portal.mardi4nfdi.de/entity/Q52908242006-05-03Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
Transformation of Facets of the General Routing Problem Polytope2005-09-16Paper

Research outcomes over time

This page was built for person: Dirk Oliver Theis