Dirk Oliver Theis

60 papers B 3C 3Misc 1Journal 51Unranked 2

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