- Classes of Boolean Formulae with Effectively Solvable SAT2010 | Faculty of Mathematics and Physics
- Making Path Consistency Stronger for SAT2008 | Faculty of Mathematics and Physics
- Solving difficult SAT instances using greedy clique decomposition2007 | Faculty of Mathematics and Physics
- An Efficient Heuristic for SAT Exploiting Connected Components of the Problem2009 | Faculty of Mathematics and Physics
- Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT2016 | Faculty of Mathematics and Physics
- Clothes make the man, uniform the nurse2014 | Faculty of Humanities
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing2005 | Faculty of Mathematics and Physics
- Reinforced Encoding for Planning as SATPublication without faculty affiliation
- Corrupted Judgeby Iuvenalis (Sat. XIII 1 - 4).2006 | Faculty of Law
- A SAT attack on the Erdős-Szekeres conjecture +12017 | Faculty of Mathematics and Physics
- Exploiting Global Properties in Path-Consistency Applied on SAT2011 | Faculty of Mathematics and Physics
- On the gap between the complexity of SAT and minimization for certain classes of boolean formulas2014 | Faculty of Mathematics and Physics
- A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints2012 | Faculty of Mathematics and Physics
- Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks2018 | Faculty of Mathematics and Physics
- A SEPARATOR THEOREM FOR HYPERGRAPHS AND A CSP-SAT ALGORITHM2021 | Faculty of Mathematics and Physics
- SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition2018 | Faculty of Mathematics and Physics
- Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors2015 | Faculty of Mathematics and Physics
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | Faculty of Mathematics and Physics
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | Faculty of Mathematics and Physics
- Variants of independence detection in SAT-based optimal multi-agent path finding2017 | Faculty of Mathematics and Physics
- On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective2019 | Faculty of Mathematics and Physics
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Faculty of Mathematics and Physics
- On the publication and citation of case law : why cesa law is sometimes as Emperior´s New Clothes2005 | Faculty of Law
- On the publication and citation of case law : why cesa law is sometimes as Emperior s New Clothes2005 | Faculty of Law
- Metamorphoses of body by wear2001 | Faculty of Arts
- The film as a diary. About clothers and towns.2002 | Faculty of Arts
- Not only fine feathers make fine birds2006 | Faculty of Education
- Returns to our old soft clothes2006 | Faculty of Education
- A note on SAT algorithms and proof complexity2012 | Faculty of Mathematics and Physics