default search action
Dirk Oliver Theis
Person information
- affiliation: University of Tartu, Estonia, Institute of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j32]Dirk Oliver Theis:
"Proper" Shift Rules for Derivatives of Perturbed-Parametric Quantum Evolutions. Quantum 7: 1052 (2023) - 2020
- [i20]Abdullah Makkeh
, Dirk Oliver Theis, Raul Vicente:
Partial Information Decomposition of Boolean Functions: a Fourier Analysis perspective. CoRR abs/2010.06976 (2020)
2010 – 2019
- 2019
- [j31]Abdullah Makkeh
MAXENT3D_PID: An Estimator for the Maximum-Entropy Trivariate Partial Information Decomposition. Entropy 21(9): 862 (2019) - [j30]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. Theor. Comput. Sci. 775: 1-15 (2019) - [i19]Javier Gil Vidal, Dirk Oliver Theis:
Input Redundancy for Parameterized Quantum Circuits. CoRR abs/1901.11434 (2019) - 2018
- [j29]Abdullah Makkeh
BROJA-2PID: A Robust Estimator for Bivariate Partial Information Decomposition. Entropy 20(4): 271 (2018) - [j28]Kaveh Khoshkhah, Dirk Oliver Theis:
Fooling sets and the Spanning Tree polytope. Inf. Process. Lett. 132: 11-13 (2018) - [j27]Kaveh Khoshkhah, Dirk Oliver Theis:
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope. Oper. Res. Lett. 46(3): 352-355 (2018) - [i18]Tore Vincent Carstens, Dirk Oliver Theis:
Note on (active-)QRAM-style data access as a quantum circuit. CoRR abs/1810.10759 (2018) - 2017
- [j26]Mozhgan Pourmoradnasseri
The Rectangle Covering Number of Random Boolean Matrices. Electron. J. Comb. 24(2): 2 (2017) - [j25]Kairi Kangro, Mozhgan Pourmoradnasseri
Short note on the number of 1-ascents in dispersed Dyck paths. Discret. Math. Algorithms Appl. 9(6): 1750077:1-1750077:8 (2017) - [j24]Abdullah Makkeh
Bivariate Partial Information Decomposition: The Optimization Perspective. Entropy 19(10): 530 (2017) - [j23]Sten Sootla, Dirk Oliver Theis, Raul Vicente:
Analyzing Information Distribution in Complex Systems. Entropy 19(12): 636 (2017) - [c8]Abdullah Makkeh
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). CALDAM 2017: 294-307 - [c7]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei
Extended Spanning Star Forest Problems. COCOA (1) 2017: 195-209 - [c6]Mozhgan Pourmoradnasseri
The (Minimum) Rank of Typical Fooling-Set Matrices. CSR 2017: 273-284 - [c5]Mozhgan Pourmoradnasseri
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). TAMC 2017: 529-542 - [i17]Kaveh Khoshkhah, Dirk Oliver Theis:
Fooling Sets and the Spanning Tree Polytope. CoRR abs/1701.00350 (2017) - [i16]Kaveh Khoshkhah, Dirk Oliver Theis:
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope. CoRR abs/1702.01424 (2017) - 2016
- [j22]Jonad Pulaj, Annie Raymond
New Conjectures for Union-Closed Families. Electron. J. Comb. 23(3): 3 (2016) - [j21]Jonad Pulaj, Annie Raymond, Dirk Oliver Theis:
New Conjectures for Union-Closed Families. Electron. J. Comb. 23(3): P3.23 (2016) - [i15]Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). CoRR abs/1611.08400 (2016) - [i14]Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). CoRR abs/1611.08419 (2016) - [i13]Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
On the Graph of the Pedigree Polytope. CoRR abs/1611.08431 (2016) - 2015
- [j20]Mirjam Friesen, Aya Hamed, Troy Lee, Dirk Oliver Theis:
Fooling-sets and rank. Eur. J. Comb. 48: 143-153 (2015) - [i12]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): 109-127 (2015) - 2014
- [j19]Dirk Oliver Theis:
On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra. Discret. Optim. 12: 10-25 (2014) - [j18]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): 119-124 (2014) - [j17]Kathrin Ballerstein, Dirk Oliver Theis:
An algorithm for random signed 3-SAT with intervals. Theor. Comput. Sci. 524: 1-26 (2014) - 2013
- [j16]Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial bounds on nonnegative rank and extended formulations. Discret. Math. 313(1): 67-83 (2013) - [j15]Adam N. Letchford
Compact formulations of the Steiner Traveling Salesman Problem and related problems. Eur. J. Oper. Res. 228(1): 83-92 (2013) - [i11]Mirjam Friesen, Dirk Oliver Theis:
Fooling-sets and rank in nonzero characteristic. CTW 2013: 107-111 - [i10]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 abs/1305.4147 (2013) - [i9]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): 127-143 (2013) - 2012
- [j14]Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood
Small minors in dense graphs. Eur. J. Comb. 33(6): 1226-1245 (2012) - [j13]Babak Farzad, Dirk Oliver Theis:
Random Lifts of $K_5\backslashe$ are 3-Colorable. SIAM J. Discret. Math. 26(1): 169-176 (2012) - [j12]Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Symmetry Matters for Sizes of Extended Formulations. SIAM J. Discret. Math. 26(3): 1361-1382 (2012) - [c4]Troy Lee, Dirk Oliver Theis:
Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems. CTW 2012: 176-180 - [i8]Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis:
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems. CoRR abs/1203.3854 (2012) - [i7]Troy Lee, Dirk Oliver Theis:
Lower bounds for sizes of semidefinite formulations for some combinatorial optimization problems. CoRR abs/1203.3961 (2012) - [i6]Mirjam Friesen, Dirk Oliver Theis:
Fooling sets (a.k.a. cross-free matchings) and rank in non-zero characteristic. CoRR abs/1208.2920 (2012) - 2011
- [j11]Steffen Rebennack
A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. 21(4): 434-457 (2011) - [i5]Kathrin Ballerstein, Dirk Oliver Theis:
An algorithm for random signed 3-SAT with Intervals. CoRR abs/1105.2525 (2011) - [i4]Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial Bounds on Nonnegative Rank and Extended Formulations. CoRR abs/1111.0444 (2011) - [i3]Christian Laus, Dirk Oliver Theis:
On the satisfiability of random regular signed SAT formulas. CoRR abs/1112.1360 (2011) - 2010
- [j10]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) - [j9]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): 1118-1120 (2010) - [j8]Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis:
The VPN Problem with Concave Costs. SIAM J. Discret. Math. 24(3): 1080-1090 (2010) - [c3]Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Symmetry Matters for the Sizes of Extended Formulations. IPCO 2010: 135-148 - [i2]Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood:
Small Minors in Dense Graphs. CoRR abs/1005.0895 (2010)
2000 – 2009
- 2009
- [j7]Babak Farzad, Dirk Oliver Theis:
The chromatic number of random lifts of K5 e. Electron. Notes Discret. Math. 35: 311-316 (2009) - 2008
- [j6]Gerhard Reinelt, Dirk Oliver Theis:
On the general routing polytope. Discret. Appl. Math. 156(3): 368-384 (2008) - [j5]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): 385-396 (2008) - [j4]Adam N. Letchford
Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discret. Math. 22(4): 1480-1487 (2008) - 2007
- [j3]Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis:
On the graphical relaxation of the symmetric traveling salesman polytope. Math. Program. 110(1): 175-193 (2007) - 2006
- [j2]Gerhard Reinelt, Dirk Oliver Theis:
A note on the Undirected Rural Postman Problem polytope. Math. Program. 106(3): 447-452 (2006) - [i1]Adam N. Letchford, Dirk Oliver Theis:
Odd minimum cut sets and b-matchings revisited. CoRR abs/math/0607088 (2006) - 2005
- [j1]Gerhard Reinelt, Dirk Oliver Theis:
Transformation of Facets of the General Routing Problem Polytope. SIAM J. Optim. 16(1): 220-234 (2005) - [c2]Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis:
Not Every GTSP Facet Induces an STSP Facet. IPCO 2005: 468-482 - 2004
- [c1]Adam N. Letchford
A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO 2004: 196-205
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: