Skip to content

Ondrej Cepek

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

18

Venues

10

Active years

2004–2025

Best venue rank

A*

Where they publish

Papers

18 indexed papers, newest first.

YearVenueTitleAuthors
2025KRBoolean Nearest Neighbor Language in the Knowledge Compilation Map.Ondrej Cepek, Jelena Glisic
2022FlAIRSSwitch lists in the landscape of knowledge representation languages.Ondrej Cepek
2022ISAIMA Direct Equivalence-Testing Algorithm for SLRs.Ondrej Cepek, James Weigle
2020IJCAISwitch-List Representations in a Knowledge Compilation Map.Ondrej Cepek, Milos Chrom
2020ISAIMApproximating minimum representations of key Horn functions.Kristf Brczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2020ISAIMCompiling SL representations of Boolean functions into OBDDs.Milos Chrom, Ondrej Cepek
2017FCTStrong Duality in Horn Minimization.Endre Boros, Ondrej Cepek, Kazuhisa Makino
2017IJCAIOn Minimum Representations of Matched Formulas (Extended Abstract).Ondrej Cepek, Stefan Gursk, Petr Kucera
2016ISAIMA combinatorial min-max theorem and minimization of pure-Horn functions.Endre Boros, Ondrej Cepek, Kazuhisa Makino
2016ISAIMKnowledge compilation from DNF to switch-list representations.Ondrej Cepek, Radek Husek
2014ISAIMOn the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas.Ondrej Cepek, Stefan Gursk
2012ISAIMBoolean functions with long prime implicants.Ondrej Cepek, Petr Kucera, Stanislav Kurik
2012SOFSEMProperties of SLUR Formulae.Ondrej Cepek, Petr Kucera, Vclav Vlcek
2008AIMSANested Precedence Networks with Alternatives: Recognition, Tractability, and Models.Roman Bartk, Ondrej Cepek
2008SACNested temporal networks with alternatives: recognition and tractability.Roman Bartk, Ondrej Cepek
2007FlAIRSTemporal Networks with Alternatives: Complexity and Model.Roman Bartk, Ondrej Cepek
2006ICTAIIncremental Filtering Algorithms for Precedence and Dependency Constraints.Roman Bartk, Ondrej Cepek
2004CPUnary Resource Constraint with Optional Activities.Petr Vilm, Roman Bartk, Ondrej Cepek