Nonpreemptive open shop with restricted processing times. - Ondrej Cepek; Milan Vlach; Dominique de Werra (Math. Methods Oper. Res., 1994)

On perfect 0, +/- 1 matrices, . - Endre Boros; Ondrej Cepek (Discret. Math., 1997)

Horn Minimization by Iterative Decomposition. - Endre Boros; Ondrej Cepek; Alexander Kogan (Ann. Math. Artif. Intell., 1998)

A Satisfiability Formulation of Problems on Level Graphs. - Bert Randerath; Ewald Speckenmeyer; Endre Boros; Peter L. Hammer; Alexander Kogan; Kazuhisa Makino; Bruno Simeone; Ondrej Cepek (Electron. Notes Discret. Math., 2001)

Nonpreemptive flowshop scheduling with machine dominance. - Ondrej Cepek; Masanori Okada; Milan Vlach (Eur. J. Oper. Res., 2002)

Unary Resource Constraint with Optional Activities. - Petr Vilím; Roman Barták; Ondrej Cepek (CP, 2004)

Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. - Petr Vilím; Roman Barták; Ondrej Cepek (Constraints An Int. J., 2005)

A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. - Ondrej Cepek; Shao Chin Sung (Comput. Oper. Res., 2005)

Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. - Ondrej Cepek; Petr Kucera (Discret. Appl. Math., 2005)

Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. - Roman Barták; Ondrej Cepek (ICAPS, 2006)

A Constraint Model for State Transitions in Disjunctive Resources. - Roman Barták; Ondrej Cepek (CSCLP, 2006)

Modelling Alternatives in Temporal Networks. - Roman Barták; Ondrej Cepek; Pavel Surynek (CISched, 2007)

Temporal Reasoning in Nested Temporal Networks with Alternatives. - Roman Barták; Ondrej Cepek; Martin Hejna (CSCLP, 2007)

Temporal Networks with Alternatives: Complexity and Model. - Roman Barták; Ondrej Cepek (FLAIRS, 2007)

Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. - Roman Barták; Ondrej Cepek (AIMSA, 2008)

Nested temporal networks with alternatives: recognition and tractability. - Roman Barták; Ondrej Cepek (SAC, 2008)

Recognition of interval Boolean functions. - Ondrej Cepek; David Kronus; Petr Kucera (Ann. Math. Artif. Intell., 2008)

Incremental Filtering Algorithms for Precedence and Dependency Constraints. - Roman Barták; Ondrej Cepek (Int. J. Artif. Intell. Tools, 2008)

A subclass of Horn CNFs optimally compressible in polynomial time. - Endre Boros; Ondrej Cepek; Alexander Kogan; Petr Kucera (Ann. Math. Artif. Intell., 2009)

Discovering implied constraints in precedence graphs with alternatives. - Roman Barták; Ondrej Cepek; Pavel Surynek (Ann. Oper. Res., 2010)

Book review. - Ondrej Cepek (Comput. Sci. Rev., 2010)

Exclusive and essential sets of implicates of Boolean functions. - Endre Boros; Ondrej Cepek; Alexander Kogan; Petr Kucera (Discret. Appl. Math., 2010)

Disjoint essential sets of implicates of a CQ Horn function. - Ondrej Cepek; Petr Kucera (Ann. Math. Artif. Intell., 2011)

Analysing DNA microarray data using Boolean techniques. - Ondrej Cepek; David Kronus; Petr Kucera (Ann. Oper. Res., 2011)

Properties of SLUR Formulae. - Ondrej Cepek; Petr Kucera; Václav Vlcek (SOFSEM, 2012)

Boolean functions with a simple certificate for CNF complexity. - Ondrej Cepek; Petr Kucera; Petr Savický (Discret. Appl. Math., 2012)

Total tightness implies Nash-solvability for three-person game forms. - Endre Boros; Ondrej Cepek; Vladimir Gurvich (Discret. Math., 2012)

Complexity issues related to propagation completeness. - Martin Babka; Tomás Balyo; Ondrej Cepek; Stefan Gurský; Petr Kucera; Václav Vlcek (Artif. Intell., 2013)

Boolean functions with long prime implicants. - Ondrej Cepek; Petr Kucera; Stanislav Kurik (Inf. Process. Lett., 2013)

A decomposition method for CNF minimality proofs. - Endre Boros; Ondrej Cepek; Petr Kucera (Theor. Comput. Sci., 2013)

On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas. - Ondrej Cepek; Stefan Gurský (ISAIM, 2014)

On Minimum Representations of Matched Formulas. - Ondrej Cepek; Stefan Gurský; Petr Kucera (J. Artif. Intell. Res., 2014)

A combinatorial min-max theorem and minimization of pure-Horn functions. - Endre Boros; Ondrej Cepek; Kazuhisa Makino (ISAIM, 2016)

Knowledge compilation from DNF to switch-list representations. - Ondrej Cepek; Radek Husek (ISAIM, 2016)

Strong Duality in Horn Minimization. - Endre Boros; Ondrej Cepek; Kazuhisa Makino (FCT, 2017)

On Minimum Representations of Matched Formulas (Extended Abstract). - Ondrej Cepek; Stefan Gurský; Petr Kucera (IJCAI, 2017)

Recognition of tractable DNFs representable by a constant number of intervals. - Ondrej Cepek; Radek Husek (Discret. Optim., 2017)

Separable discrete functions: Recognition and sufficient conditions. - Endre Boros; Ondrej Cepek; Vladimir Gurvich (Discret. Math., 2019)

Switch-List Representations in a Knowledge Compilation Map. - Ondrej Cepek; Milos Chromý (IJCAI, 2020)

Compiling SL representations of Boolean functions into OBDDs. - Milos Chromý; Ondrej Cepek (ISAIM, 2020)

Properties of Switch-List Representations of Boolean Functions. - Milos Chromý; Ondrej Cepek (J. Artif. Intell. Res., 2020)

Generating clause sequences of a CNF formula. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Khaled M. Elbassioni; Petr Kucera; Kazuhisa Makino (Theor. Comput. Sci., 2021)

Switch lists in the landscape of knowledge representation languages. - Ondrej Cepek (FLAIRS, 2022)

A Direct Equivalence-Testing Algorithm for SLRs. - Ondrej Cepek; James Weigle (ISAIM, 2022)

Approximating Minimum Representations of Key Horn Functions. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Petr Kucera; Kazuhisa Makino (SIAM J. Comput., 2022)

Unique key Horn functions. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Petr Kucera; Kazuhisa Makino (Theor. Comput. Sci., 2022)

Boolean Nearest Neighbor Language in the Knowledge Compilation Map. - Ondrej Cepek; Jelena Glisic (CoRR, 2024)

Recognizing distributed approval voting forms and correspondences. - Endre Boros; Ondrej Cepek; Vladimir Gurvich; Kazuhisa Makino (Ann. Oper. Res., 2024)

A faster implementation of EQ and SE queries for switch-list representations. - Ondrej Cepek; James Weigle (Ann. Math. Artif. Intell., 2024)