A Faster Exact Separation Algorithm for Blossom Inequalities. - Adam N. Letchford; Gerhard Reinelt; Dirk Oliver Theis (IPCO, 2004)

Not Every GTSP Facet Induces an STSP Facet. - Marcus Oswald; Gerhard Reinelt; Dirk Oliver Theis (IPCO, 2005)

Transformation of Facets of the General Routing Problem Polytope. - Gerhard Reinelt; Dirk Oliver Theis (SIAM J. Optim., 2005)

Odd minimum cut sets and b-matchings revisited. - Adam N. Letchford; Dirk Oliver Theis (CoRR, 2006)

A note on the Undirected Rural Postman Problem polytope. - Gerhard Reinelt; Dirk Oliver Theis (Math. Program., 2006)

On the graphical relaxation of the symmetric traveling salesman polytope. - Marcus Oswald; Gerhard Reinelt; Dirk Oliver Theis (Math. Program., 2007)

On the general routing polytope. - Gerhard Reinelt; Dirk Oliver Theis (Discret. Appl. Math., 2008)

Computing finest mincut partitions of a graph and application to routing problems. - Gerhard Reinelt; Dirk Oliver Theis; Klaus Michael Wenger (Discret. Appl. Math., 2008)

Odd Minimum Cut Sets and b-Matchings Revisited. - Adam N. Letchford; Gerhard Reinelt; Dirk Oliver Theis (SIAM J. Discret. Math., 2008)

The chromatic number of random lifts of K5 e. - Babak Farzad; Dirk Oliver Theis (Electron. Notes Discret. Math., 2009)

The Cops and Robber game on graphs with forbidden (induced) subgraphs. - Gwenaël Joret; Marcin Kaminski 001; Dirk Oliver Theis (Contributions Discret. Math., 2010)

A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone. - Dirk Oliver Theis (Discret. Appl. Math., 2010)

The VPN Problem with Concave Costs. - Samuel Fiorini; Gianpaolo Oriolo; Laura Sanità; Dirk Oliver Theis (SIAM J. Discret. Math., 2010)

On the satisfiability of random regular signed SAT formulas - Christian Laus; Dirk Oliver Theis (CoRR, 2011)

A Branch and Cut solver for the maximum stable set problem. - Steffen Rebennack; Marcus Oswald; Dirk Oliver Theis; Hanna Seitz; Gerhard Reinelt; Panos M. Pardalos (J. Comb. Optim., 2011)

Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems. - Troy Lee; Dirk Oliver Theis (CTW, 2012)

Fooling sets (a.k.a. cross-free matchings) and rank in non-zero characteristic - Mirjam Friesen; Dirk Oliver Theis (CoRR, 2012)

Small minors in dense graphs. - Samuel Fiorini; Gwenaël Joret; Dirk Oliver Theis; David R. Wood (Eur. J. Comb., 2012)

Random Lifts of $K_5 backslashe$ are 3-Colorable. - Babak Farzad; Dirk Oliver Theis (SIAM J. Discret. Math., 2012)

Symmetry Matters for Sizes of Extended Formulations. - Volker Kaibel; Kanstantsin Pashkovich; Dirk Oliver Theis (SIAM J. Discret. Math., 2012)

Fooling-sets and rank in nonzero characteristic. - Mirjam Friesen; Dirk Oliver Theis (CTW, 2013)

Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices - LeRoy Beasely; Troy Lee; Hartmut Klauck; Dirk Oliver Theis (CoRR, 2013)

Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). - LeRoy B. Beasley; Hartmut Klauck; Troy Lee; Dirk Oliver Theis (Dagstuhl Reports, 2013)

Combinatorial bounds on nonnegative rank and extended formulations. - Samuel Fiorini; Volker Kaibel; Kanstantsin Pashkovich; Dirk Oliver Theis (Discret. Math., 2013)

Compact formulations of the Steiner Traveling Salesman Problem and related problems. - Adam N. Letchford; Saeideh D. Nasiri; Dirk Oliver Theis (Eur. J. Oper. Res., 2013)

On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra. - Dirk Oliver Theis (Discret. Optim., 2014)

A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces. - Nancy E. Clarke; Samuel Fiorini; Gwenaël Joret; Dirk Oliver Theis (Graphs Comb., 2014)

An algorithm for random signed 3-SAT with intervals. - Kathrin Ballerstein; Dirk Oliver Theis (Theor. Comput. Sci., 2014)

Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082). - Hartmut Klauck; Troy Lee; Dirk Oliver Theis; Rekha R. Thomas (Dagstuhl Reports, 2015)

Fooling-sets and rank. - Mirjam Friesen; Aya Hamed; Troy Lee; Dirk Oliver Theis (Eur. J. Comb., 2015)

New Conjectures for Union-Closed Families. - Jonad Pulaj; Annie Raymond; Dirk Oliver Theis (Electron. J. Comb., 2016)

On the Graph of the Pedigree Polytope. - Abdullah Makkeh; Mozhgan Pourmoradnasseri; Dirk Oliver Theis (CoRR, 2016)

The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). - Abdullah Makkeh; Mozhgan Pourmoradnasseri; Dirk Oliver Theis (CALDAM, 2017)

Extended Spanning Star Forest Problems. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Dirk Oliver Theis (COCOA (1), 2017)

The (Minimum) Rank of Typical Fooling-Set Matrices. - Mozhgan Pourmoradnasseri; Dirk Oliver Theis (CSR, 2017)

Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). - Mozhgan Pourmoradnasseri; Dirk Oliver Theis (TAMC, 2017)

The Rectangle Covering Number of Random Boolean Matrices. - Mozhgan Pourmoradnasseri; Dirk Oliver Theis (Electron. J. Comb., 2017)

Short note on the number of 1-ascents in dispersed Dyck paths. - Kairi Kangro; Mozhgan Pourmoradnasseri; Dirk Oliver Theis (Discret. Math. Algorithms Appl., 2017)

Bivariate Partial Information Decomposition: The Optimization Perspective. - Abdullah Makkeh; Dirk Oliver Theis; Raul Vicente (Entropy, 2017)

Analyzing Information Distribution in Complex Systems. - Sten Sootla; Dirk Oliver Theis; Raul Vicente (Entropy, 2017)

Note on (active-)QRAM-style data access as a quantum circuit. - Tore Vincent Carstens; Dirk Oliver Theis (CoRR, 2018)

BROJA-2PID: A Robust Estimator for Bivariate Partial Information Decomposition. - Abdullah Makkeh; Dirk Oliver Theis; Raul Vicente (Entropy, 2018)

Fooling sets and the Spanning Tree polytope. - Kaveh Khoshkhah; Dirk Oliver Theis (Inf. Process. Lett., 2018)

On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope. - Kaveh Khoshkhah; Dirk Oliver Theis (Oper. Res. Lett., 2018)

Input Redundancy for Parameterized Quantum Circuits. - Javier Gil Vidal; Dirk Oliver Theis (CoRR, 2019)

MAXENT3D_PID: An Estimator for the Maximum-Entropy Trivariate Partial Information Decomposition. - Abdullah Makkeh; Daniel Chicharro; Dirk Oliver Theis; Raul Vicente (Entropy, 2019)

Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Dirk Oliver Theis (Theor. Comput. Sci., 2019)

Partial Information Decomposition of Boolean Functions: a Fourier Analysis perspective. - Abdullah Makkeh; Dirk Oliver Theis; Raul Vicente (CoRR, 2020)

"Proper" Shift Rules for Derivatives of Perturbed-Parametric Quantum Evolutions. - Dirk Oliver Theis (Quantum, 2023)