192
click to vote
ICALP
15 years 11 months ago
2007 Springer 
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
142
click to vote
ICALP
15 years 11 months ago
2007 Springer 
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
157
click to vote
ICALP
15 years 11 months ago
2007 Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
135
Voted
ICALP
15 years 11 months ago
2007 Springer 
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
159
click to vote
ICALP
15 years 11 months ago
2007 Springer 
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
|
Programming Languages