The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ondrej Cepek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Petr Vilím, Roman Barták, Ondrej Cepek
    Unary Resource Constraint with Optional Activities. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:62-76 [Conf]
  2. Roman Barták, Ondrej Cepek
    Incremental Filtering Algorithms for Precedence and Dependency Constraints. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2006, pp:416-426 [Conf]
  3. Endre Boros, Ondrej Cepek, Alexander Kogan
    Horn Minimization by Iterative Decomposition. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:23, n:3-4, pp:321-343 [Journal]
  4. Petr Vilím, Roman Barták, Ondrej Cepek
    Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. [Citation Graph (0, 0)][DBLP]
    Constraints, 2005, v:10, n:4, pp:403-425 [Journal]
  5. Ondrej Cepek, Shao Chin Sung
    A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:3265-3271 [Journal]
  6. Ondrej Cepek, Petr Kucera
    Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:14-52 [Journal]
  7. Roman Barták, Ondrej Cepek
    Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:350-353 [Conf]
  8. Roman Barták, Ondrej Cepek
    A Constraint Model for State Transitions in Disjunctive Resources. [Citation Graph (0, 0)][DBLP]
    CSCLP, 2006, pp:48-62 [Conf]
  9. Roman Barták, Ondrej Cepek
    Temporal Networks with Alternatives: Complexity and Model. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2007, pp:641-646 [Conf]
  10. Endre Boros, Ondrej Cepek
    On perfect 0, +/- 1 matrices, . [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:81-100 [Journal]

  11. Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. [Citation Graph (, )][DBLP]


  12. Temporal Reasoning in Nested Temporal Networks with Alternatives. [Citation Graph (, )][DBLP]


  13. Nested temporal networks with alternatives: recognition and tractability. [Citation Graph (, )][DBLP]


  14. Recognition of interval Boolean functions. [Citation Graph (, )][DBLP]


  15. A subclass of Horn CNFs optimally compressible in polynomial time. [Citation Graph (, )][DBLP]


  16. Exclusive and essential sets of implicates of Boolean functions. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002