| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
|
Ghaddar, Bissan
|
|
2008
|
188 |
1 |
p. 155-174
|
article
|
| 2 |
A characterization of chain probe graphs
|
Golumbic, Martin C.
|
|
2009
|
188 |
1 |
p. 175-183
|
article
|
| 3 |
A filter-and-fan approach to the 2D HP model of the protein folding problem
|
Rego, César
|
|
2009
|
188 |
1 |
p. 389-414
|
article
|
| 4 |
A geometric connection to threshold logic via cubical lattices
|
Emamy-K, M. R.
|
|
2009
|
188 |
1 |
p. 141-153
|
article
|
| 5 |
A hybrid ACO-GRASP algorithm for clustering analysis
|
Marinakis, Yannis
|
|
2009
|
188 |
1 |
p. 343-358
|
article
|
| 6 |
Analysing DNA microarray data using Boolean techniques
|
Čepek, Ondřej
|
|
2010
|
188 |
1 |
p. 77-110
|
article
|
| 7 |
A new column generation algorithm for Logical Analysis of Data
|
Hansen, Pierre
|
|
2011
|
188 |
1 |
p. 215-249
|
article
|
| 8 |
Competitive evaluation of threshold functions in the priced information model
|
Cicalese, Ferdinando
|
|
2009
|
188 |
1 |
p. 111-132
|
article
|
| 9 |
Complexity results for equistable graphs and related classes
|
Milanič, Martin
|
|
2010
|
188 |
1 |
p. 359-370
|
article
|
| 10 |
Edge cover by connected bipartite subgraphs
|
Liberti, Leo
|
|
2009
|
188 |
1 |
p. 307-329
|
article
|
| 11 |
Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions
|
Karaşan, O. Ekin
|
|
2009
|
188 |
1 |
p. 251-261
|
article
|
| 12 |
Logical analysis of data: classification with justification
|
Boros, Endre
|
|
2011
|
188 |
1 |
p. 33-61
|
article
|
| 13 |
Optimization and probabilistic satisfiability on nested and co-nested formulas
|
Pretolani, Daniele
|
|
2008
|
188 |
1 |
p. 371-387
|
article
|
| 14 |
Optimization for simulation: LAD accelerator
|
Lejeune, Miguel A.
|
|
2009
|
188 |
1 |
p. 285-305
|
article
|
| 15 |
Projecting systems of linear inequalities with binary variables
|
Balas, Egon
|
|
2009
|
188 |
1 |
p. 19-31
|
article
|
| 16 |
Relations between threshold and k-interval Boolean functions
|
Kronus, David
|
|
2010
|
188 |
1 |
p. 263-278
|
article
|
| 17 |
Reverse-engineering country risk ratings: a combinatorial non-recursive model
|
Hammer, P. L.
|
|
2009
|
188 |
1 |
p. 185-213
|
article
|
| 18 |
Stability preserving transformations of graphs
|
Lozin, Vadim V.
|
|
2008
|
188 |
1 |
p. 331-341
|
article
|
| 19 |
The chain graph sandwich problem
|
Dantas, Simone
|
|
2010
|
188 |
1 |
p. 133-139
|
article
|
| 20 |
The mathematics of Peter L. Hammer (1936–2006): graphs, optimization, and Boolean models
|
Boros, Endre
|
|
2011
|
188 |
1 |
p. 1-18
|
article
|
| 21 |
The negative cycles polyhedron and hardness of checking some polyhedral properties
|
Boros, Endre
|
|
2010
|
188 |
1 |
p. 63-76
|
article
|
| 22 |
Two characterizations of chain partitioned probe graphs
|
Le, Van Bang
|
|
2010
|
188 |
1 |
p. 279-283
|
article
|
| 23 |
Using size for bounding expressions of graph invariants
|
Sedlar, Jelena
|
|
2010
|
188 |
1 |
p. 415-427
|
article
|
Journal description