The SCEAS System
| |||||||

## Search the dblp DataBase
Ondrej Cepek:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Roman Barták, Ondrej Cepek
**Incremental Filtering Algorithms for Precedence and Dependency Constraints.**[Citation Graph (0, 0)][DBLP] ICTAI, 2006, pp:416-426 [Conf] - 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] - Petr Vilím, Roman Barták, Ondrej Cepek
**Extension of**[Citation Graph (0, 0)][DBLP]*O*(*n*log*n*) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints, 2005, v:10, n:4, pp:403-425 [Journal] - 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] - 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] - 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] - 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] - Roman Barták, Ondrej Cepek
**Temporal Networks with Alternatives: Complexity and Model.**[Citation Graph (0, 0)][DBLP] FLAIRS Conference, 2007, pp:641-646 [Conf] - Endre Boros, Ondrej Cepek
**On perfect 0, +/- 1 matrices**[Citation Graph (0, 0)][DBLP]^{, }. Discrete Mathematics, 1997, v:165, n:, pp:81-100 [Journal] **Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models.**[Citation Graph (, )][DBLP]**Temporal Reasoning in Nested Temporal Networks with Alternatives.**[Citation Graph (, )][DBLP]**Nested temporal networks with alternatives: recognition and tractability.**[Citation Graph (, )][DBLP]**Recognition of interval Boolean functions.**[Citation Graph (, )][DBLP]**A subclass of Horn CNFs optimally compressible in polynomial time.**[Citation Graph (, )][DBLP]**Exclusive and essential sets of implicates of Boolean functions.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |