default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOndrej Cepek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Endre Boros, Ondrej Cepek, Vladimir Gurvich
, Kazuhisa Makino:
Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. 336(3): 2091-2110 (2024)- 2022
- [j28]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. 51(1): 116-138 (2022) - [j27]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. Theor. Comput. Sci. 922: 170-178 (2022) - [c21]Ondrej Cepek:
Switch lists in the landscape of knowledge representation languages. FLAIRS 2022 - [c20]Ondrej Cepek, James Weigle:
A Direct Equivalence-Testing Algorithm for SLRs. ISAIM 2022 - 2021
- [j26]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. Theor. Comput. Sci. 856: 68-74 (2021) - 2020
- [j25]Milos Chromý, Ondrej Cepek:
Properties of Switch-List Representations of Boolean Functions. J. Artif. Intell. Res. 69: 501-529 (2020) - [c19]Ondrej Cepek, Milos Chromý:
Switch-List Representations in a Knowledge Compilation Map. IJCAI 2020: 1651-1657 - [c18]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. ISAIM 2020 - [c17]Milos Chromý, Ondrej Cepek:
Compiling SL representations of Boolean functions into OBDDs. ISAIM 2020 - [i3]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. CoRR abs/2002.06727 (2020) - [i2]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. CoRR abs/2002.06964 (2020)
2010 – 2019
- 2019
- [j24]Endre Boros, Ondrej Cepek, Vladimir Gurvich:
Separable discrete functions: Recognition and sufficient conditions. Discret. Math. 342(5): 1275-1292 (2019) - 2018
- [i1]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. CoRR abs/1811.05160 (2018) - 2017
- [j23]Ondrej Cepek, Radek Husek:
Recognition of tractable DNFs representable by a constant number of intervals. Discret. Optim. 23: 1-19 (2017) - [c16]Endre Boros, Ondrej Cepek, Kazuhisa Makino:
Strong Duality in Horn Minimization. FCT 2017: 123-135 - [c15]Ondrej Cepek, Stefan Gurský, Petr Kucera:
On Minimum Representations of Matched Formulas (Extended Abstract). IJCAI 2017: 4980-4984 - 2016
- [c14]Endre Boros, Ondrej Cepek, Kazuhisa Makino:
A combinatorial min-max theorem and minimization of pure-Horn functions. ISAIM 2016 - [c13]Ondrej Cepek, Radek Husek:
Knowledge compilation from DNF to switch-list representations. ISAIM 2016 - 2014
- [j22]Ondrej Cepek, Stefan Gurský, Petr Kucera:
On Minimum Representations of Matched Formulas. J. Artif. Intell. Res. 51: 707-723 (2014) - [c12]Ondrej Cepek, Stefan Gurský:
On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas. ISAIM 2014 - 2013
- [j21]Martin Babka, Tomás Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek:
Complexity issues related to propagation completeness. Artif. Intell. 203: 19-34 (2013) - [j20]Ondrej Cepek, Petr Kucera, Stanislav Kurik:
Boolean functions with long prime implicants. Inf. Process. Lett. 113(19-21): 698-703 (2013) - [j19]Endre Boros, Ondrej Cepek, Petr Kucera:
A decomposition method for CNF minimality proofs. Theor. Comput. Sci. 510: 111-126 (2013) - 2012
- [j18]Ondrej Cepek, Petr Kucera, Petr Savický:
Boolean functions with a simple certificate for CNF complexity. Discret. Appl. Math. 160(4-5): 365-382 (2012) - [j17]Endre Boros, Ondrej Cepek, Vladimir Gurvich:
Total tightness implies Nash-solvability for three-person game forms. Discret. Math. 312(8): 1436-1443 (2012) - [c11]Ondrej Cepek, Petr Kucera, Stanislav Kurik:
Boolean functions with long prime implicants. ISAIM 2012 - [c10]Ondrej Cepek, Petr Kucera, Václav Vlcek:
Properties of SLUR Formulae. SOFSEM 2012: 177-189 - 2011
- [j16]Ondrej Cepek, Petr Kucera:
Disjoint essential sets of implicates of a CQ Horn function. Ann. Math. Artif. Intell. 61(3): 231-244 (2011) - [j15]Ondrej Cepek, David Kronus, Petr Kucera:
Analysing DNA microarray data using Boolean techniques. Ann. Oper. Res. 188(1): 77-110 (2011) - 2010
- [j14]Roman Barták, Ondrej Cepek, Pavel Surynek:
Discovering implied constraints in precedence graphs with alternatives. Ann. Oper. Res. 180(1): 233-263 (2010) - [j13]Ondrej Cepek:
Book review. Comput. Sci. Rev. 4(3): 185-187 (2010) - [j12]Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera:
Exclusive and essential sets of implicates of Boolean functions. Discret. Appl. Math. 158(2): 81-96 (2010)
2000 – 2009
- 2009
- [j11]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) - 2008
- [j10]Ondrej Cepek, David Kronus, Petr Kucera:
Recognition of interval Boolean functions. Ann. Math. Artif. Intell. 52(1): 1-24 (2008) - [j9]Roman Barták, Ondrej Cepek:
Incremental Filtering Algorithms for Precedence and Dependency Constraints. Int. J. Artif. Intell. Tools 17(1): 205-221 (2008) - [c9]Roman Barták, Ondrej Cepek:
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. AIMSA 2008: 235-246 - [c8]Roman Barták, Ondrej Cepek:
Nested temporal networks with alternatives: recognition and tractability. SAC 2008: 156-157 - 2007
- [c7]Roman Barták, Ondrej Cepek, Pavel Surynek:
Modelling Alternatives in Temporal Networks. CISched 2007: 129-136 - [c6]Roman Barták, Ondrej Cepek, Martin Hejna:
Temporal Reasoning in Nested Temporal Networks with Alternatives. CSCLP 2007: 17-31 - [c5]Roman Barták, Ondrej Cepek:
Temporal Networks with Alternatives: Complexity and Model. FLAIRS 2007: 641-646 - 2006
- [c4]Roman Barták, Ondrej Cepek:
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. ICAPS 2006: 350-353 - [c3]Roman Barták, Ondrej Cepek:
A Constraint Model for State Transitions in Disjunctive Resources. CSCLP 2006: 48-62 - [c2]Roman Barták, Ondrej Cepek:
Incremental Filtering Algorithms for Precedence and Dependency Constraints. ICTAI 2006: 416-426 - 2005
- [j8]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 An Int. J. 10(4): 403-425 (2005) - [j7]Ondrej Cepek, Shao Chin Sung:
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Comput. Oper. Res. 32: 3265-3271 (2005) - [j6]Ondrej Cepek, Petr Kucera:
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. Discret. Appl. Math. 149(1-3): 14-52 (2005) - 2004
- [c1]Petr Vilím, Roman Barták, Ondrej Cepek:
Unary Resource Constraint with Optional Activities. CP 2004: 62-76 - 2002
- [j5]Ondrej Cepek, Masanori Okada, Milan Vlach:
Nonpreemptive flowshop scheduling with machine dominance. Eur. J. Oper. Res. 139(2): 245-261 (2002) - 2001
- [j4]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. Electron. Notes Discret. Math. 9: 269-277 (2001)
1990 – 1999
- 1998
- [j3]Endre Boros, Ondrej Cepek, Alexander Kogan:
Horn Minimization by Iterative Decomposition. Ann. Math. Artif. Intell. 23(3-4): 321-343 (1998) - 1997
- [j2]Endre Boros, Ondrej Cepek:
On perfect 0, +/- 1 matrices, . Discret. Math. 165-166: 81-100 (1997) - 1994
- [j1]Ondrej Cepek, Milan Vlach, Dominique de Werra:
Nonpreemptive open shop with restricted processing times. Math. Methods Oper. Res. 39(2): 227-241 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-03 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
