| Publication | Date of Publication | Type |
|---|
| Efficiently approximating high-dimensional Pareto frontiers for tree-structured networks using expansion and compression | 2023-10-04 | Paper |
| Efficient projection algorithms onto the weighted \(\ell_1\) ball | 2022-04-11 | Paper |
| An efficient relaxed projection method for constrained non-negative matrix factorization with application to the phase-mapping problem in materials science | 2018-11-21 | Paper |
| Boosting efficiency for computing the Pareto frontier on tree structured networks | 2018-11-21 | Paper |
| In search of balance: the challenge of generating balanced Latin rectangles | 2017-08-04 | Paper |
| Relaxation methods for constrained matrix factorization problems: solving the phase mapping problem in materials discovery | 2017-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740444 | 2016-07-26 | Paper |
| On the Erdős Discrepancy Problem | 2015-07-21 | Paper |
| Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search | 2014-09-26 | Paper |
| Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability | 2013-08-05 | Paper |
| Wildlife corridors as a connected subgraph problem | 2012-10-25 | Paper |
| Upgrading Shortest Paths in Networks | 2011-05-26 | Paper |
| Solving Connected Subgraph Problems in Wildlife Conservation | 2010-06-22 | Paper |
| Backdoors in the Context of Learning | 2009-07-07 | Paper |
| Backdoors to Combinatorial Optimization: Feasibility and Optimality | 2009-06-03 | Paper |
| A generative power-law search tree model | 2009-04-03 | Paper |
| Connections in Networks: Hardness of Feasibility Versus Optimality | 2009-03-10 | Paper |
| Short XORs for Model Counting: From Theory to Practice | 2009-03-10 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Tradeoffs in the Complexity of Backdoor Detection | 2008-09-02 | Paper |
| Sensor networks and distributed CSP: communication, computation and complexity | 2007-10-23 | Paper |
| Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning | 2007-10-11 | Paper |
| QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency | 2007-09-04 | Paper |
| Regular-SAT: A many-valued approach to solving combinatorial problems | 2007-08-23 | Paper |
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2007-04-30 | Paper |
| Statistical regimes across constrainedness regions | 2006-11-03 | Paper |
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2005-12-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5710226 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667442 | 2005-04-19 | Paper |
| An improved approximation algorithm for the partial Latin square extension problem. | 2005-01-11 | Paper |
| Approximations and randomization to boost CSP techniques | 2004-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475627 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475647 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460805 | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749853 | 2001-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741510 | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741540 | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741541 | 2001-09-24 | Paper |
| Heavy-tailed phenomena in satisfiability and constraint satisfaction problems | 2001-09-03 | Paper |
| Algorithm portfolios | 2001-08-20 | Paper |
