| Publication | Date of Publication | Type |
|---|
| "Proper" Shift Rules for Derivatives of Perturbed-Parametric Quantum Evolutions | 2022-07-04 | Paper |
On the combinatorial lower bound for the extension complexity of the spanning tree polytope
Operations Research Letters | 2019-06-11 | Paper |
Complexity and approximability of extended spanning star forest problems in general and complete graphs
Theoretical Computer Science | 2019-05-29 | Paper |
Fooling sets and the spanning tree polytope
Information Processing Letters | 2018-03-16 | Paper |
| Extended spanning star forest problems | 2018-02-26 | Paper |
| Optimizing Bivariate Partial Information Decomposition | 2018-02-12 | Paper |
| BROJA-2PID: A robust estimator for bivariate partial information decomposition | 2018-02-07 | Paper |
Short note on the number of 1-ascents in dispersed Dyck paths
Discrete Mathematics, Algorithms and Applications | 2017-12-14 | Paper |
The (minimum) rank of typical fooling-set matrices
(available as arXiv preprint) | 2017-08-22 | Paper |
The rectangle covering number of random Boolean matrices
The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
Nondeterministic communication complexity of random Boolean functions (extended abstract)
Lecture Notes in Computer Science | 2017-05-19 | Paper |
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
(available as arXiv preprint) | 2017-02-05 | Paper |
| On the Graph of the Pedigree Polytope | 2016-11-25 | Paper |
New conjectures for union-closed families
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
Compact formulations of the Steiner traveling salesman problem and related problems
European Journal of Operational Research | 2016-03-15 | Paper |
A branch and cut solver for the maximum stable set problem
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
The cops and robber game on graphs with forbidden (induced) subgraphs
(available as arXiv preprint) | 2015-07-24 | Paper |
Fooling-sets and rank
European Journal of Combinatorics | 2015-06-02 | Paper |
On the facial structure of symmetric and graphical traveling salesman polyhedra
Discrete Optimization | 2015-04-09 | Paper |
Fooling-sets and rank in nonzero characteristic
(available as arXiv preprint) | 2014-06-11 | Paper |
A note on the cops and robber game on graphs embedded in non-orientable surfaces
Graphs and Combinatorics | 2014-03-24 | Paper |
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science | 2014-02-11 | Paper |
The chromatic number of random lifts of \(K_5\setminus e\)
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Symmetry Matters for Sizes of Extended Formulations
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Combinatorial bounds on nonnegative rank and extended formulations
Discrete Mathematics | 2012-11-22 | Paper |
Random lifts of \({K_5}\setminus{e}\) are 3-colorable
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Small minors in dense graphs
European Journal of Combinatorics | 2012-06-18 | Paper |
| On the satisfiability of random regular signed SAT formulas | 2011-12-06 | Paper |
| Good edge-labelings and graphs with girth at least five | 2011-09-06 | Paper |
The VPN Problem with Concave Costs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
On a class of metrics related to graph layout problems
Linear Algebra and its Applications | 2010-11-05 | Paper |
On a class of metrics related to graph layout problems
Linear Algebra and its Applications | 2010-11-05 | Paper |
A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone
Discrete Applied Mathematics | 2010-10-11 | Paper |
Symmetry matters for the sizes of extended formulations
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
| The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract) | 2008-12-12 | Paper |
Computing finest mincut partitions of a graph and application to routing problems
Discrete Applied Mathematics | 2008-02-26 | Paper |
On the general routing polytope
Discrete Applied Mathematics | 2008-02-26 | Paper |
| The Cops & Robber game on series-parallel graphs | 2007-12-18 | Paper |
| The VPN Tree Routing Conjecture for Outerplanar Networks | 2007-11-16 | Paper |
Not Every GTSP Facet Induces an STSP Facet
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
| On some lower bounds on the number of bicliques needed to cover a bipartite graph | 2007-08-08 | Paper |
On the graphical relaxation of the symmetric traveling salesman polytope
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
| On convex sets associated with permutations, cuts, and certain metrics | 2007-02-19 | Paper |
A note on the undirected rural postman problem polytope
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
| scientific article; zbMATH DE number 5021774 (Why is no real title available?) | 2006-05-03 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Transformation of Facets of the General Routing Problem Polytope
SIAM Journal on Optimization | 2005-09-16 | Paper |
