Výpis publikací

BOROS, E., Ondřej ČEPEK a Petr KUČERA. A decomposition method for CNF minimality proofs. Theoretical Computer Science. Elsevier Science, Vol. 510, s. pp. 111-126. ISSN 0304-3975. 2013.

ČEPEK, Ondřej, Petr KUČERA a S. KUŘÍK. Boolean functions with long prime implicants. Information Processing Letters. Elsevier Science, Vol. 113, Issues 19-21, s. pp. 698-703. ISSN 0020-0190. 2013.

BABKA, M., T. BALYO, Ondřej ČEPEK, Š. GURSKÝ, Petr KUČERA a V. VLČEK. Complexity issues related to propagation completeness. Artificial Intelligence. Elsevier Science, Vol. 203, s. pp. 19-34. ISSN 0004-3702. 2013.

BOROS, E., Ondřej ČEPEK a V. GURVICH. . Total tightness implies Nash-solvability for three-person gane forms. Discrete Mathematics. Elsevier Science, Vol. 312, Issue 1, s. pp. 1436-1443, 7 s. ISSN 0012-365X. 2012.

ČEPEK, Ondřej, Petr KUČERA a P. SAVICKÝ. Boolean functions with a simple certificate for CNF complexity. Discrete Applied Mathematics. Netherlands, Vol. 160, Issues 4-5, s. pp. 365-382. ISSN 0166-218X. 2012.

ČEPEK, Ondřej, Petr KUČERA a S. KUŘÍK. Boolean functions with long prime implicants. In Proceedings of International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, USA. 2012.

ČEPEK, Ondřej, Petr KUČERA a V. VLČEK. Properties of SLUR Formulae. Proceedings of SOFSEM 2012. In 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn. Springer Verlag. s. pp. 177-189. ISBN 978-3-642-27659-0. 2012.

ČEPEK, Ondřej, D. KRONUS a Petr KUČERA. Analysing DNA Microarray Data Using Boolean Techniques. Annals of Operations Research. Springer Verlag, Vol 188, No 1, s. pp. 77-110. ISSN 0254-5330. 2011.

ČEPEK, Ondřej a Petr KUČERA. Disjoint essential sets of implicates of a CQ Horn function. Annals of Mathematics and Artificial Intelligence. Springer Verlag, Vol. 61, No 3, s. 231-244, 13 s. ISSN 1012-2443. 2011.

BOROS, E., Ondřej ČEPEK, A. KOGAN a P. KUČERA. A subclass of Horn CNFs optimally compressible in polynomial time. Annals of Mathematics and Artificial Intelligence. roč. 57, 3-4, s. 249 – 291. ISSN 1012-2443. 2010.

ČEPEK, Ondřej, Petr KUČERA a Petr SAVICKÝ. Boolean functions with a simple certificate for CNF complexity. RUTCOR Research Report 2. New Brunswick, New Jersey, USA, 2010.

BARTÁK, R., Ondřej ČEPEK a P. SURYNEK. Discovering implied constraints in precedence graphs with alternatives. Annals of Operations Research. roč. 180, č. 1, s. 233-263, 30 s. ISSN 0254-5330. 2010.

ČEPEK, Ondřej, Endre BOROS, Petr KUČERA a Alexander KOGAN. Exclusive and essential sets of implicates of Boolean functions. Discrete Applied Mathematics. The Netherlands, roč. 158, č. 2, s. 81 – 96. ISSN 0166-218X. 2010.

BARTÁK, R. a Ondřej ČEPEK. Incremental propagation rules for a precedence graph with optional activities and time windows. Transactions of the Institute of Measurement and Control. roč. 32, č. 1, s. 73-96, 23 s. ISSN 0142-3312. 2010.

ČEPEK, Ondřej. Recenze Arora, S., Barak, B. Computational Complexity – A Modern Approach. Computer Science Review. roč. 4, č. 3, s. 185-187, 2 s. ISSN 1574-0137. 2010.

ČEPEK, Ondřej a P. KUČERA. Various notes on SLUR formulate. In Data Analysis and Decision Making under Uncertainty. s. 85-95, 10 s. 2010.

ČEPEK, Ondřej. A subclass of Horn CNFs optimally compressible in polynomial time. In ECCO XXII. 2009.

BOROS, E., Ondřej ČEPEK, A. KOGAN a Miroslav KUČERA. A subclass of Horn CNFs optimally compressible in polynomial time. New Brunswick: RUTCOR, 2009.

ČEPEK, Ondřej. Applications of mathematical logic. In EURO XXIII (23rd European Conference of Operational Research). 2009.

ČEPEK, Ondřej a Petr KUČERA. Disjoint essential sets of implicates of a CQ Horn function. In Proceedings of 12th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty. Litomyšl. s. 79 – 92. 2009.

ČEPEK, Ondřej a R. BARTÁK. Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. In Artificial Intelligence: Methodology, Systems, and Applications. Springer-Verlag. s. 235–246, 11 s. ISBN 978-3-540-85775-4. 2008.

ČEPEK, Ondřej, D. KRONUS a P. KUČERA. Recognition of interval Boolean functions. Annals of Mathematics and Artificial Intelligence. roč. 52, č. 1, s. 1-24. ISSN 1012-2443. 2008.

ČEPEK, Ondřej a D. KRONUS. Recognition of Positive 2-Interval Boolean Functions. In Proceedings of 11th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty. s. 115-122, 7 s. 2008.

ČEPEK, Ondřej, D. KRONUS a P. KUČERA. Renamable interval Boolean functions. International Journal of Innovative Computing, Information, and Control. roč. 4, č. 5, s. 1111-1120, 9 s. ISSN 1349-4198. 2008.

ČEPEK, Ondřej a S. C. SUNG. A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers & Operations Research. č. 32, s. 3265-3271, 6 s. ISSN 0305-0548. 2005.

ČEPEK, Ondřej, P. VILÍM a R. BARTÁK. Extension of O(.log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints. roč. 10, č. 4, s. 403-425, 22 s. ISSN 1383-7133. 2005.

ČEPEK, Ondřej a Petr KUČERA. Known and new classes od generalized Horn formulae with polynominal recognition and SAT testing. Discrete Applied Mathematics. č. 149, s. 14-52, 38 s. ISSN 0166-218X. 2005.

ČEPEK, Ondřej, P. ČÁP a Milan VLACH. Weak and strong machine dominance in a nonpreemptive flowshop. Scientiae Mathematicae Japonicae. roč. 61, č. 2, s. 319-333, 14 s. ISSN 1346-0862. 2005.

ČEPEK, Ondřej. A simple heuristic for knowledge base compression. Central European Journal of Operations Research. roč. 12, č. 1, s. 3-12, 9 s. ISSN 1435-246X. 2004.

ČEPEK, Ondřej a S. C. SUNG. Just-in-time scheduling with periodic time slots. Scientiae Mathematicae Japonicae. roč. 60, č. 2, s. 295-301, 6 s. ISSN 1346-0862. 2004.

ČEPEK, Ondřej. Vlastnosti Hornovských Booleovských formulí: habilitační práce. Praha: Univerzita Karlova, Matematicko-fyzikální fakulta, 2004.

ČEPEK, Ondřej, Masanori OKADA a Milan VLACH. Nonpreemtive flowshop scheduling with machine dominance. Central European Journal of Operations Research. č. 139, s. 245-261, 16 s. ISSN 1435-246X. 2002.

ČEPEK, Ondřej, Masanori OKADA a Milan VLACH. A note on the two-machine no-idle flowshop problem. Naval Research Logistics. č. 47, s. 353-358, 5 s. ISSN 0894-069X. 2000.