Result 1 to 20 of 40 total
Approximation guarantees for the minimum linear arrangement problem by higher eigenvalues. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 313-324 (2012).
1
An exact algorithm for the Boolean connectivity problem for $k$-CNF. (English)
Theor. Comput. Sci. 412, No. 35, 4613-4618 (2011).
2
Derandomizing HSSW algorithm for 3-SAT. (English)
Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 1-12 (2011).
3
Derandomizing HSSW algorithm for 3-SAT. (English)
Comput. Res. Repos. 2011, Article No. 1102.3766 (2011).
4
Low frequency compensator of multi-variable tele-control system. (English)
Kim, Tai-hoon (ed.) et al., Grid and distributed computing, control and automation. International conferences, GDC and CA 2010, held as Part of the future generation information technology conference, FGIT 2010, Jeju Island, Korea, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17624-1/pbk; 978-3-642-17625-8/ebook). Communications in Computer and Information Science 121, 196-205 (2011).
5
Analysis of non-linear adaptive friction and pitch angle control of small-scaled wind turbine system (English)
FGIT-CA/CES3, 26-35 (2011).
6
Derandomizing HSSW algorithm for 3-SAT (English)
COCOON, 1-12 (2011).
7
Improved randomized algorithms for 3-SAT. (English)
Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15‒17, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-17516-9/pbk). Lecture Notes in Computer Science 6506, 73-84 (2010).
8
On the Boolean connectivity problem for Horn relations. (English)
Discrete Appl. Math. 158, No. 18, 2024-2030 (2010).
9
An exact algorithm for the Boolean connectivity problem for $k$-CNF. (English)
Strichman, Ofer (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2010. 13th international conference, SAT 2010, Edinburgh, UK, July 11‒14, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14185-0/pbk). Lecture Notes in Computer Science 6175, 172-180 (2010).
10
A query efficient non-adaptive long code test with perfect completeness. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 738-751 (2010).
11
The complexity of the Hajós calculus for planar graphs. (English)
Theor. Comput. Sci. 411, No. 7-9, 1182-1191 (2010).
12
The planar hajós calculus for bounded degree graphs (English)
IEICE Transactions 93-A, No. 6, 1000-1007 (2010).
13
An exact algorithm for the Boolean connectivity problem for $k$-CNF (English)
SAT, 172-180 (2010).
14
Low frequency compensator of multi-variable tele-control system (English)
FGIT-GDC/CA, 196-205 (2010).
15
A query efficient non-adaptive long code test with perfect completeness (English)
APPROX-RANDOM, 738-751 (2010).
16
Improved randomized algorithms for 3-SAT (English)
ISAAC (1), 73-84 (2010).
17
Genome projector: zoomable genome map with multiple views. (English)
BMC Bioinform. 10 (2009).
18
The complexity of the hajos calculus for planar graphs. (English)
Electron. Colloq. Comput. Complex. 15, No. 011 (2008).
19
New graph calculi for planar non-3-colorable graphs (English)
IEICE Transactions 91-A, No. 9, 2301-2307 (2008).
20
Result 1 to 20 of 40 total
Start
Contact
Print
General Help
