Ondrej Cepek - RankMe

56 papers A* 4A 1B 3Misc 11Journal 34Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Boolean Nearest Neighbor Language in the Knowledge Compilation Map. KR Ondrej Cepek, Jelena Glisic
2024	J	`jnl`	A faster implementation of EQ and SE queries for switch-list representations. Ann. Math. Artif. Intell. Ondrej Cepek, James Weigle
2024	J	`jnl`	Boolean Nearest Neighbor Language in the Knowledge Compilation Map. CoRR Ondrej Cepek, Jelena Glisic
2024	J	`jnl`	Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. Endre Boros, Ondrej Cepek, Vladimir Gurvich, Kazuhisa Makino
2022	Misc	`conf`	A Direct Equivalence-Testing Algorithm for SLRs. ISAIM Ondrej Cepek, James Weigle
2022	J	`jnl`	Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2022	Misc	`conf`	Switch lists in the landscape of knowledge representation languages. FLAIRS Ondrej Cepek
2022	J	`jnl`	Unique key Horn functions. Theor. Comput. Sci. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2021	J	`jnl`	Generating clause sequences of a CNF formula. Theor. Comput. Sci. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
2020	Misc	`conf`	Approximating minimum representations of key Horn functions. ISAIM Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2020	Misc	`conf`	Compiling SL representations of Boolean functions into OBDDs. ISAIM Milos Chromý, Ondrej Cepek
2020	J	`jnl`	Generating clause sequences of a CNF formula. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
2020	J	`jnl`	Properties of Switch-List Representations of Boolean Functions. J. Artif. Intell. Res. Milos Chromý, Ondrej Cepek
2020	A*	`conf`	Switch-List Representations in a Knowledge Compilation Map. IJCAI Ondrej Cepek, Milos Chromý
2020	J	`jnl`	Unique key Horn functions. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2019	J	`jnl`	Separable discrete functions: Recognition and sufficient conditions. Discret. Math. Endre Boros, Ondrej Cepek, Vladimir Gurvich
2018	J	`jnl`	Approximating minimum representations of key Horn functions. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2017	A*	`conf`	On Minimum Representations of Matched Formulas (Extended Abstract). IJCAI Ondrej Cepek, Stefan Gurský, Petr Kucera
2017	J	`jnl`	Recognition of tractable DNFs representable by a constant number of intervals. Discret. Optim. Ondrej Cepek, Radek Husek
2017	B	`conf`	Strong Duality in Horn Minimization. FCT Endre Boros, Ondrej Cepek, Kazuhisa Makino
2016	Misc	`conf`	A combinatorial min-max theorem and minimization of pure-Horn functions. ISAIM Endre Boros, Ondrej Cepek, Kazuhisa Makino
2016	Misc	`conf`	Knowledge compilation from DNF to switch-list representations. ISAIM Ondrej Cepek, Radek Husek
2014	J	`jnl`	On Minimum Representations of Matched Formulas. J. Artif. Intell. Res. Ondrej Cepek, Stefan Gurský, Petr Kucera
2014	Misc	`conf`	On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas. ISAIM Ondrej Cepek, Stefan Gurský
2013	J	`jnl`	A decomposition method for CNF minimality proofs. Theor. Comput. Sci. Endre Boros, Ondrej Cepek, Petr Kucera
2013	J	`jnl`	Boolean functions with long prime implicants. Inf. Process. Lett. Ondrej Cepek, Petr Kucera, Stanislav Kurik
2013	J	`jnl`	Complexity issues related to propagation completeness. Artif. Intell. Martin Babka, Tomás Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek
2012	J	`jnl`	Boolean functions with a simple certificate for CNF complexity. Discret. Appl. Math. Ondrej Cepek, Petr Kucera, Petr Savický
2012	Misc	`conf`	Boolean functions with long prime implicants. ISAIM Ondrej Cepek, Petr Kucera, Stanislav Kurik
2012	B	`conf`	Properties of SLUR Formulae. SOFSEM Ondrej Cepek, Petr Kucera, Václav Vlcek
2012	J	`jnl`	Total tightness implies Nash-solvability for three-person game forms. Discret. Math. Endre Boros, Ondrej Cepek, Vladimir Gurvich
2011	J	`jnl`	Analysing DNA microarray data using Boolean techniques. Ann. Oper. Res. Ondrej Cepek, David Kronus, Petr Kucera
2011	J	`jnl`	Disjoint essential sets of implicates of a CQ Horn function. Ann. Math. Artif. Intell. Ondrej Cepek, Petr Kucera
2010	J	`jnl`	Book review. Comput. Sci. Rev. Ondrej Cepek
2010	J	`jnl`	Discovering implied constraints in precedence graphs with alternatives. Ann. Oper. Res. Roman Barták, Ondrej Cepek, Pavel Surynek
2010	J	`jnl`	Exclusive and essential sets of implicates of Boolean functions. Discret. Appl. Math. Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera
2009	J	`jnl`	A subclass of Horn CNFs optimally compressible in polynomial time. Ann. Math. Artif. Intell. Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera
2008	J	`jnl`	Incremental Filtering Algorithms for Precedence and Dependency Constraints. Int. J. Artif. Intell. Tools Roman Barták, Ondrej Cepek
2008	Misc	`conf`	Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. AIMSA Roman Barták, Ondrej Cepek
2008	Misc	`conf`	Nested temporal networks with alternatives: recognition and tractability. SAC Roman Barták, Ondrej Cepek
2008	J	`jnl`	Recognition of interval Boolean functions. Ann. Math. Artif. Intell. Ondrej Cepek, David Kronus, Petr Kucera
2007	—	`conf`	Modelling Alternatives in Temporal Networks. CISched Roman Barták, Ondrej Cepek, Pavel Surynek
2007	Misc	`conf`	Temporal Networks with Alternatives: Complexity and Model. FLAIRS Roman Barták, Ondrej Cepek
2007	—	`conf`	Temporal Reasoning in Nested Temporal Networks with Alternatives. CSCLP Roman Barták, Ondrej Cepek, Martin Hejna
2006	—	`conf`	A Constraint Model for State Transitions in Disjunctive Resources. CSCLP Roman Barták, Ondrej Cepek
2006	B	`conf`	Incremental Filtering Algorithms for Precedence and Dependency Constraints. ICTAI Roman Barták, Ondrej Cepek
2006	A*	`conf`	Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. ICAPS Roman Barták, Ondrej Cepek
2005	J	`jnl`	A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Comput. Oper. Res. Ondrej Cepek, Shao Chin Sung
2005	J	`jnl`	Extension of Constraints An Int. J. Petr Vilím, Roman Barták, Ondrej Cepek
2005	J	`jnl`	Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. Discret. Appl. Math. Ondrej Cepek, Petr Kucera
2004	A	`conf`	Unary Resource Constraint with Optional Activities. CP Petr Vilím, Roman Barták, Ondrej Cepek
2002	J	`jnl`	Nonpreemptive flowshop scheduling with machine dominance. Eur. J. Oper. Res. Ondrej Cepek, Masanori Okada, Milan Vlach
2001	J	`jnl`	A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek
1998	J	`jnl`	Horn Minimization by Iterative Decomposition. Ann. Math. Artif. Intell. Endre Boros, Ondrej Cepek, Alexander Kogan
1997	J	`jnl`	On perfect 0, +/- 1 matrices Discret. Math. Endre Boros, Ondrej Cepek
1994	J	`jnl`	Nonpreemptive open shop with restricted processing times. Math. Methods Oper. Res. Ondrej Cepek, Milan Vlach, Dominique de Werra