Dirk Oliver Theis

  • University of Tartu, Estonia, Institute of Computer Science

According to our database1, Dirk Oliver Theis authored at least 48 papers between 2004 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Partial Information Decomposition of Boolean Functions: a Fourier Analysis perspective.
CoRR, 2020

Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs.
Theor. Comput. Sci., 2019

MAXENT3D_PID: An Estimator for the Maximum-Entropy Trivariate Partial Information Decomposition.
Entropy, 2019

Input Redundancy for Parameterized Quantum Circuits.
CoRR, 2019

On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope.
Oper. Res. Lett., 2018

Fooling sets and the Spanning Tree polytope.
Inf. Process. Lett., 2018

BROJA-2PID: A Robust Estimator for Bivariate Partial Information Decomposition.
Entropy, 2018

Note on (active-)QRAM-style data access as a quantum circuit.
CoRR, 2018

Analyzing Information Distribution in Complex Systems.
Entropy, 2017

Bivariate Partial Information Decomposition: The Optimization Perspective.
Entropy, 2017

Short note on the number of 1-ascents in dispersed Dyck paths.
Discret. Math. Algorithms Appl., 2017

The Rectangle Covering Number of Random Boolean Matrices.
Electron. J. Comb., 2017

Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2017

The (Minimum) Rank of Typical Fooling-Set Matrices.
Proceedings of the Computer Science - Theory and Applications, 2017

Extended Spanning Star Forest Problems.
Proceedings of the Combinatorial Optimization and Applications, 2017

The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract).
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

On the Graph of the Pedigree Polytope.
CoRR, 2016

New Conjectures for Union-Closed Families.
Electron. J. Comb., 2016

Fooling-sets and rank.
Eur. J. Comb., 2015

Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082).
Dagstuhl Reports, 2015

An algorithm for random signed 3-SAT with intervals.
Theor. Comput. Sci., 2014

A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces.
Graphs Comb., 2014

On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra.
Discret. Optim., 2014

Compact formulations of the Steiner Traveling Salesman Problem and related problems.
Eur. J. Oper. Res., 2013

Combinatorial bounds on nonnegative rank and extended formulations.
Discret. Math., 2013

Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082).
Dagstuhl Reports, 2013

Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices
CoRR, 2013

Fooling-sets and rank in nonzero characteristic.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Symmetry Matters for Sizes of Extended Formulations.
SIAM J. Discret. Math., 2012

Random Lifts of $K_5\backslashe$ are 3-Colorable.
SIAM J. Discret. Math., 2012

Small minors in dense graphs.
Eur. J. Comb., 2012

Fooling sets (a.k.a. cross-free matchings) and rank in non-zero characteristic
CoRR, 2012

Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

A Branch and Cut solver for the maximum stable set problem.
J. Comb. Optim., 2011

On the satisfiability of random regular signed SAT formulas
CoRR, 2011

The VPN Problem with Concave Costs.
SIAM J. Discret. Math., 2010

A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone.
Discret. Appl. Math., 2010

The Cops and Robber game on graphs with forbidden (induced) subgraphs.
Contributions Discret. Math., 2010

The chromatic number of random lifts of K<sub>5</sub> e.
Electron. Notes Discret. Math., 2009

Odd Minimum Cut Sets and b-Matchings Revisited.
SIAM J. Discret. Math., 2008

Computing finest mincut partitions of a graph and application to routing problems.
Discret. Appl. Math., 2008

On the general routing polytope.
Discret. Appl. Math., 2008

On the graphical relaxation of the symmetric traveling salesman polytope.
Math. Program., 2007

A note on the Undirected Rural Postman Problem polytope.
Math. Program., 2006

Odd minimum cut sets and b-matchings revisited.
CoRR, 2006

Transformation of Facets of the General Routing Problem Polytope.
SIAM J. Optim., 2005

Not Every GTSP Facet Induces an STSP Facet.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

A Faster Exact Separation Algorithm for Blossom Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004