Improved exact algorithms for Max-SatJIANER CHEN; KANJ, Iyad A.Discrete applied mathematics. 2004, Vol 142, Num 1-3, pp 17-27, issn 0166-218X, 11 p.Article

An improved deterministic local search algorithm for 3-SATBRUEGGEMANN, Tobias; KERN, Walter.Theoretical computer science. 2004, Vol 329, Num 1-3, pp 303-313, issn 0304-3975, 11 p.Article

Counting models for 2_SAT and 3_SAT formulaeDAHLLÖF, Vilhelm; JONSSON, Peter; WAHLSTRÖM, Magnus et al.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 265-291, issn 0304-3975, 27 p.Article

Improved worst-case complexity for the MIN 3-SET COVERING problemCROCE, Federico Della; ESCOFFIER, Bruno; PASCHOS, Vangelis Th et al.Operations research letters. 2007, Vol 35, Num 2, pp 205-210, issn 0167-6377, 6 p.Article

Range- video fusion and comparison of inverse perspective algorithms in static imagesMORGENTHALER, D. G; HENNESSY, S. J; DEMENTHON, D et al.IEEE transactions on systems, man, and cybernetics. 1990, Vol 20, Num 6, pp 1301-1312, issn 0018-9472Article

An exact algorithm for minimum distortion embeddingFOMIN, Fedor V; LOKSHTANOV, Daniel; SAURABH, Saket et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3530-3536, issn 0304-3975, 7 p.Article

An exact algorithm for MAX-CUT in sparse graphsCROCE, F. Della; KAMINSKI, M. J; PASCHOS, V. Th et al.Operations research letters. 2007, Vol 35, Num 3, pp 403-408, issn 0167-6377, 6 p.Article

Exact formulations and algorithm for the train timetabling problem with dynamic demandBARRENA, Eva; CANCA, David; COELHO, Leandro C et al.Computers & operations research. 2014, Vol 44, pp 66-74, issn 0305-0548, 9 p.Article

On partitioning a graph into two connected subgraphsPAULUSMA, Daniel; VAN ROOIJ, Johan M. M.Theoretical computer science. 2011, Vol 412, Num 48, pp 6761-6769, issn 0304-3975, 9 p.Article

An efficient exact algorithm for constraint bipartite vertex coverFERNAU, Henning; NIEDERMEIER, Rolf.Journal of algorithms (Print). 2001, Vol 38, Num 2, pp 374-410, issn 0196-6774Article

A fixed-parameter tractability result for multicommodity demand flow in treesJIONG GUO; NIEDERMEIER, Rolf.Information processing letters. 2006, Vol 97, Num 3, pp 109-114, issn 0020-0190, 6 p.Article

Labeled search trees and amortized analysis : Improved upper bounds for NP-hard problemsCHEN, Jianer; KANJ, Iyad A; GE XIA et al.Algorithmica. 2005, Vol 43, Num 4, pp 245-273, issn 0178-4617, 29 p.Article

An improved exact algorithm for the domatic number problemRIEGE, Tobias; ROTHE, Jörg; SPAKOWSKI, Holger et al.Information processing letters. 2007, Vol 101, Num 3, pp 101-106, issn 0020-0190, 6 p.Article

Uniformity of quantum circuit families for error-free algorithmsNISHIMURA, Harumichi; OZAWA, Masanao.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 487-496, issn 0304-3975, 10 p.Article

Exact algorithm and heuristic for the Closest String ProblemXIAOLAN LIU; SHENGHAN LIU; ZHIFENG HAO et al.Computers & operations research. 2011, Vol 38, Num 11, pp 1513-1520, issn 0305-0548, 8 p.Article

On the complexity of exact algorithm for L(2, 1)-labeling of graphsJUNOSZA-SZANIAWSKI, Konstanty; RZAZEWSKI, Paweł.Information processing letters. 2011, Vol 111, Num 14, pp 697-701, issn 0020-0190, 5 p.Article

Separator-based data reduction for signed graph balancingHÜFFNER, Falk; BETZLER, Nadja; NIEDERMEIER, Rolf et al.Journal of combinatorial optimization. 2010, Vol 20, Num 4, pp 335-360, issn 1382-6905, 26 p.Article

Particle filters for partially observed diffusionsFEARNHEAD, Paul; PAPASPILIOPOULOS, Omiros; ROBERTS, Gareth O et al.Journal of the Royal Statistical Society. Series B, statistical methodology. 2008, Vol 70, pp 755-777, issn 1369-7412, 23 p., 4Article

Exact algorithms for the two-dimensional guillotine knapsackDOLATABADI, Mohammad; LODI, Andrea; MONACI, Michele et al.Computers & operations research. 2012, Vol 39, Num 1, pp 48-53, issn 0305-0548, 6 p.Article

The three column Bandpass problem is solvable in linear timeZHONG LI; GUOHUI LIN.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 281-299, issn 0304-3975, 19 p.Article

An exact algorithm for minimizing resource availability costs in project schedulingRODRIGUES, Sávio B; YAMASHITA, Denise S.European journal of operational research. 2010, Vol 206, Num 3, pp 562-568, issn 0377-2217, 7 p.Article

Exact algorithms for the Hamiltonian cycle problem in planar graphsDEINEKO, Vladimir G; KLINZ, Bettina; WOEGINGER, Gerhard J et al.Operations research letters. 2006, Vol 34, Num 3, pp 269-274, issn 0167-6377, 6 p.Article

Channel assignment via fast zeta transformCYGAN, Marek; KOWALIK, Łukasz.Information processing letters. 2011, Vol 111, Num 15, pp 727-730, issn 0020-0190, 4 p.Article

On the Bandpass problemGUOHUI LIN.Journal of combinatorial optimization. 2011, Vol 22, Num 1, pp 71-77, issn 1382-6905, 7 p.Article

Exact and approximate bandwidthCYGAN, Marek; PILIPCZUK, Marcin.Theoretical computer science. 2010, Vol 411, Num 40-42, pp 3701-3713, issn 0304-3975, 13 p.Article