Ondrej Cepek

Ondrej Cepek, Petr Kucera, Petr Savický: Boolean functions with a simple certificate for CNF complexity. Discrete Applied Mathematics 160(4-5): 365-382 (2012)

Endre Boros, Ondrej Cepek, Vladimir Gurvich: Total tightness implies Nash-solvability for three-person game forms. Discrete Mathematics 312(8): 1436-1443 (2012)

Ondrej Cepek, Petr Kucera, Stanislav Kurik: Boolean functions with long prime implicants. ISAIM 2012

Ondrej Cepek, Petr Kucera, Václav Vlcek: Properties of SLUR Formulae. SOFSEM 2012: 177-189

Ondrej Cepek, Petr Kucera: Disjoint essential sets of implicates of a CQ Horn function. Ann. Math. Artif. Intell. 61(3): 231-244 (2011)

Ondrej Cepek, David Kronus, Petr Kucera: Analysing DNA microarray data using Boolean techniques. Annals OR 188(1): 77-110 (2011)

Roman Barták, Ondrej Cepek, Pavel Surynek: Discovering implied constraints in precedence graphs with alternatives. Annals OR 180(1): 233-263 (2010)

Ondrej Cepek: Book review. Computer Science Review 4(3): 185-187 (2010)

Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera: Exclusive and essential sets of implicates of Boolean functions. Discrete Applied Mathematics 158(2): 81-96 (2010)

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

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

Roman Barták, Ondrej Cepek: Incremental Filtering Algorithms for Precedence and Dependency Constraints. International Journal on Artificial Intelligence Tools 17(1): 205-221 (2008)

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

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

Roman Barták, Ondrej Cepek, Martin Hejna: Temporal Reasoning in Nested Temporal Networks with Alternatives. CSCLP 2007: 17-31

Roman Barták, Ondrej Cepek: Temporal Networks with Alternatives: Complexity and Model. FLAIRS Conference 2007: 641-646

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

Roman Barták, Ondrej Cepek: A Constraint Model for State Transitions in Disjunctive Resources. CSCLP 2006: 48-62

Roman Barták, Ondrej Cepek: Incremental Filtering Algorithms for Precedence and Dependency Constraints. ICTAI 2006: 416-426

Petr Vilím, Roman Barták, Ondrej Cepek: Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints 10(4): 403-425 (2005)

Ondrej Cepek, Shao Chin Sung: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers & OR 32: 3265-3271 (2005)

Ondrej Cepek, Petr Kucera: Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. Discrete Applied Mathematics 149(1-3): 14-52 (2005)

Petr Vilím, Roman Barták, Ondrej Cepek: Unary Resource Constraint with Optional Activities. CP 2004: 62-76

Ondrej Cepek, Masanori Okada, Milan Vlach: Nonpreemptive flowshop scheduling with machine dominance. European Journal of Operational Research 139(2): 245-261 (2002)

Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek: A Satisfiability Formulation of Problems on Level Graphs. Electronic Notes in Discrete Mathematics 9: 269-277 (2001)

Endre Boros, Ondrej Cepek, Alexander Kogan: Horn Minimization by Iterative Decomposition. Ann. Math. Artif. Intell. 23(3-4): 321-343 (1998)

Endre Boros, Ondrej Cepek: On perfect 0, +/- 1 matrices^, . Discrete Mathematics 165-166: 81-100 (1997)

Ondrej Cepek, Milan Vlach, Dominique de Werra: Nonpreemptive open shop with restricted processing times. Math. Meth. of OR 39(2): 227-241 (1994)