Dirk Oliver Theis

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 24

Top Topics

Boolean Functions

Traveling Salesman

Partial Information

Minimum Spanning Trees

Top Venues

Electron. J. Comb.

Theor. Comput. Sci.

Publications

Dirk Oliver Theis
"Proper" Shift Rules for Derivatives of Perturbed-Parametric Quantum Evolutions. Quantum 7 (2023)
Abdullah Makkeh, Dirk Oliver Theis, Raul Vicente
Partial Information Decomposition of Boolean Functions: a Fourier Analysis perspective. CoRR (2020)
Abdullah Makkeh, Daniel Chicharro, Dirk Oliver Theis, Raul Vicente
MAXENT3D_PID: An Estimator for the Maximum-Entropy Trivariate Partial Information Decomposition. Entropy 21 (9) (2019)
Javier Gil Vidal, Dirk Oliver Theis
Input Redundancy for Parameterized Quantum Circuits. CoRR (2019)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. Theor. Comput. Sci. 775 (2019)
Kaveh Khoshkhah, Dirk Oliver Theis
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope. Oper. Res. Lett. 46 (3) (2018)
Abdullah Makkeh, Dirk Oliver Theis, Raul Vicente
BROJA-2PID: A Robust Estimator for Bivariate Partial Information Decomposition. Entropy 20 (4) (2018)
Tore Vincent Carstens, Dirk Oliver Theis
Note on (active-)QRAM-style data access as a quantum circuit. CoRR (2018)
Kaveh Khoshkhah, Dirk Oliver Theis
Fooling sets and the Spanning Tree polytope. Inf. Process. Lett. 132 (2018)
Mozhgan Pourmoradnasseri, Dirk Oliver Theis
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). TAMC (2017)
Kairi Kangro, Mozhgan Pourmoradnasseri, Dirk Oliver Theis
Short note on the number of 1-ascents in dispersed Dyck paths. Discret. Math. Algorithms Appl. 9 (6) (2017)
Kaveh Khoshkhah, Dirk Oliver Theis
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope. CoRR (2017)
Abdullah Makkeh, Dirk Oliver Theis, Raul Vicente
Bivariate Partial Information Decomposition: The Optimization Perspective. Entropy 19 (10) (2017)
Mozhgan Pourmoradnasseri, Dirk Oliver Theis
The Rectangle Covering Number of Random Boolean Matrices. Electron. J. Comb. 24 (2) (2017)
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis
Extended Spanning Star Forest Problems. COCOA (1) (2017)
Mozhgan Pourmoradnasseri, Dirk Oliver Theis
The (Minimum) Rank of Typical Fooling-Set Matrices. CSR (2017)
Kaveh Khoshkhah, Dirk Oliver Theis
Fooling Sets and the Spanning Tree Polytope. CoRR (2017)
Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). CALDAM (2017)
Sten Sootla, Dirk Oliver Theis, Raul Vicente
Analyzing Information Distribution in Complex Systems. Entropy 19 (12) (2017)
Mozhgan Pourmoradnasseri, Dirk Oliver Theis
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). CoRR (2016)
Jonad Pulaj, Annie Raymond, Dirk Oliver Theis
New Conjectures for Union-Closed Families. Electron. J. Comb. 23 (3) (2016)
Jonad Pulaj, Annie Raymond, Dirk Oliver Theis
New Conjectures for Union-Closed Families. Electron. J. Comb. 23 (3) (2016)
Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis
On the Graph of the Pedigree Polytope. CoRR (2016)
Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). CoRR (2016)
Hartmut Klauck, Troy Lee, Dirk Oliver Theis, Rekha R. Thomas
Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082). Dagstuhl Reports 5 (2) (2015)
Mirjam Friesen, Aya Hamed, Troy Lee, Dirk Oliver Theis
Fooling-sets and rank. Eur. J. Comb. 48 (2015)
Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis
A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces. Graphs Comb. 30 (1) (2014)
Dirk Oliver Theis
On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra. Discret. Optim. 12 (2014)
Kathrin Ballerstein, Dirk Oliver Theis
An algorithm for random signed 3-SAT with intervals. Theor. Comput. Sci. 524 (2014)
LeRoy Beasely, Troy Lee, Hartmut Klauck, Dirk Oliver Theis
Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices CoRR (2013)
Mirjam Friesen, Dirk Oliver Theis
Fooling-sets and rank in nonzero characteristic. CTW (2013)
LeRoy B. Beasley, Hartmut Klauck, Troy Lee, Dirk Oliver Theis
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). Dagstuhl Reports 3 (2) (2013)
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
Compact formulations of the Steiner Traveling Salesman Problem and related problems. Eur. J. Oper. Res. 228 (1) (2013)
Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
Combinatorial bounds on nonnegative rank and extended formulations. Discret. Math. 313 (1) (2013)
Troy Lee, Dirk Oliver Theis
Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems. CTW (2012)
Mirjam Friesen, Dirk Oliver Theis
Fooling sets (a.k.a. cross-free matchings) and rank in non-zero characteristic CoRR (2012)
Troy Lee, Dirk Oliver Theis
Lower bounds for sizes of semidefinite formulations for some combinatorial optimization problems CoRR (2012)
Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood
Small minors in dense graphs. Eur. J. Comb. 33 (6) (2012)
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems CoRR (2012)
Babak Farzad, Dirk Oliver Theis
Random Lifts of $K_5\backslashe$ are 3-Colorable. SIAM J. Discret. Math. 26 (1) (2012)
Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
Symmetry Matters for Sizes of Extended Formulations. SIAM J. Discret. Math. 26 (3) (2012)
Kathrin Ballerstein, Dirk Oliver Theis
An algorithm for random signed 3-SAT with Intervals CoRR (2011)
Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
Combinatorial Bounds on Nonnegative Rank and Extended Formulations CoRR (2011)
Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, Panos M. Pardalos
A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. 21 (4) (2011)
Christian Laus, Dirk Oliver Theis
On the satisfiability of random regular signed SAT formulas CoRR (2011)
Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood
Small Minors in Dense Graphs. CoRR (2010)
Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
Symmetry Matters for the Sizes of Extended Formulations. IPCO (2010)
Dirk Oliver Theis
A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone. Discret. Appl. Math. 158 (10) (2010)
Gwenaël Joret, Marcin Kaminski, Dirk Oliver Theis
The Cops and Robber game on graphs with forbidden (induced) subgraphs. Contributions Discret. Math. 5 (2) (2010)
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis
The VPN Problem with Concave Costs. SIAM J. Discret. Math. 24 (3) (2010)
Babak Farzad, Dirk Oliver Theis
e. Electron. Notes Discret. Math. 35 (2009)
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discret. Math. 22 (4) (2008)
Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger
Computing finest mincut partitions of a graph and application to routing problems. Discret. Appl. Math. 156 (3) (2008)
Gerhard Reinelt, Dirk Oliver Theis
On the general routing polytope. Discret. Appl. Math. 156 (3) (2008)
Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
On the graphical relaxation of the symmetric traveling salesman polytope. Math. Program. 110 (1) (2007)
Adam N. Letchford, Dirk Oliver Theis
Odd minimum cut sets and b-matchings revisited. CoRR (2006)
Gerhard Reinelt, Dirk Oliver Theis
A note on the Undirected Rural Postman Problem polytope. Math. Program. 106 (3) (2006)
Gerhard Reinelt, Dirk Oliver Theis
Transformation of Facets of the General Routing Problem Polytope. SIAM J. Optim. 16 (1) (2005)
Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
Not Every GTSP Facet Induces an STSP Facet. IPCO (2005)
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO (2004)