Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
112 | M. Borschbach, A. Exeler |
A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 605-606, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Max-2SAT, tabu search, memetic algorithms |
108 | K. Subramani 0001 |
On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computing Science - ASIAN 2002, Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster Computing, 7th Asian Computing Science Conference, Hanoi, Vietnam, December 4-6, 2002, Proceedings, pp. 57-65, 2002, Springer, 3-540-00195-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
100 | Peter J. Stuckey, Lei Zheng |
Improving GSAT Using 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings, pp. 691-695, 2002, Springer, 3-540-44120-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
100 | K. Subramani 0001 |
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC ![In: Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, Proceedings, pp. 217-230, 2002, Springer, 3-540-43865-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
94 | K. Subramani 0001 |
Optimal length tree-like resolution refutations for 2SAT formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 5(2), pp. 316-320, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
2SAT formulas, tree-like proofs, Resolution |
63 | Osamu Watanabe 0001, Masaki Yamamoto 0001 |
Average-Case Analysis for the MAX-2SAT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 277-282, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
63 | Miroslav Chlebík, Janka Chlebíková |
On Approximation Hardness of the Minimum 2SAT-DELETION Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 263-273, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
63 | Peter J. Stuckey, Lei Zheng |
Improving Nogood Recording Using 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 3-5 November 2003, Sacramento, California, USA, pp. 94-99, 2003, IEEE Computer Society, 0-7695-2038-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
63 | Markus Bläser, Bodo Manthey |
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 187-198, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
56 | Venkatesan Guruswami |
On 2-Query Codeword Testing with Near-Perfect Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 267-276, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Dorit S. Hochbaum, Anu Pathria |
Approximating a generalization of MAX 2SAT and MIN 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 107(1-3), pp. 41-59, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
44 | Magnus Wahlström |
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 202-213, 2008, Springer, 978-3-540-79722-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Mistuo Motoki |
Test Instance Generation for MAX 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 787-791, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Cristina Bazgan, Wenceslas Fernandez de la Vega |
A Polynomial Time Approximation Scheme for Dense MIN 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings, pp. 91-99, 1999, Springer, 3-540-66412-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
37 | Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee |
Maximizing the Number of Independent Labels in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings, pp. 136-147, 2007, Springer, 978-3-540-73813-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell |
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 146-154, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà |
The Interface between P and NP in Signed CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 19-22 May 2004, Toronto, Canada, pp. 251-256, 2004, IEEE Computer Society, 0-7695-2130-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Christos H. Papadimitriou |
On Selecting a Satisfying Truth Assignment (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 163-169, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
2SAT, satisfying truth assignment selection, natural generalizations, default preference, polynomial-time randomized algorithm, complexity, satisfiability, minimality, circumscription, selection criteria |
26 | Guillermo De Ita, José Raymundo Marcial-Romero, José Antonio Hernández Servín |
A bottom-up algorithm for solving ♯2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 28(6), pp. 1130-1140, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Marco A. López Medina, José Raymundo Marcial-Romero, Guillermo De Ita Luna, José Antonio Hernández Servín |
A Linear Time Algorithm for Counting #2SAT on Series-Parallel Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI (1) ![In: Advances in Soft Computing - 19th Mexican International Conference on Artificial Intelligence, MICAI 2020, Mexico City, Mexico, October 12-17, 2020, Proceedings, Part I, pp. 437-447, 2020, Springer, 978-3-030-60883-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | David Avis, Hans Raj Tiwary |
Compact linear programs for 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 80, pp. 17-22, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang 0002 |
Linear-Time Algorithm for Quantum 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. ![In: Theory Comput. 14(1), pp. 1-27, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Alice Paul, Matthias Poloczek, David P. Williamson |
Simple Approximation Algorithms for Balanced MAX 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(3), pp. 995-1012, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Marco A. López Medina, José Raymundo Marcial-Romero, Guillermo De Ita Luna, Yolanda Moyao |
A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCPR ![In: Pattern Recognition - 10th Mexican Conference, MCPR 2018, Puebla, Mexico, June 27-30, 2018, Proceedings, pp. 72-81, 2018, Springer, 978-3-319-92197-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Guillermo De Ita, Pedro Bello 0001, Miguel Rodríguez 0001 |
The computation of #2SAT by a fixed-parameter tractable algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LANMR ![In: Proceedings of the Eleventh Latin American Workshop on Logic/Languages, Algorithms and New Methods of Reasoning, Puebla, Mexico, November 15, 2018., pp. 101-113, 2018, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
26 | Marco A. López Medina, José Raymundo Marcial-Romero, José Antonio Hernández Servín, Guillermo De Ita |
Model counting for #2SAT problem in outerplanar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LANMR ![In: Proceedings of the Eleventh Latin American Workshop on Logic/Languages, Algorithms and New Methods of Reasoning, Puebla, Mexico, November 15, 2018., pp. 76-87, 2018, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
26 | M. A. López, José Raymundo Marcial-Romero, Guillermo De Ita Luna, Héctor A. Montes Venegas, Roberto Alejo |
A Linear Time Algorithm for Solving #2SAT on Cactus Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.08581, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
26 | David Avis, Hans Raj Tiwary |
Compact linear programs for 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.06723, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
26 | Marco A. López Medina, José Raymundo Marcial-Romero, Guillermo De Ita, Rosa Maria Valdovinos |
A Fast and Efficient Method for #2SAT via Graph Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI (1) ![In: Advances in Soft Computing - 16th Mexican International Conference on Artificial Intelligence, MICAI 2017, Enseneda, Mexico, October 23-28, 2017, Proceedings, Part I, pp. 95-106, 2017, Springer, 978-3-030-02836-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
26 | Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes |
On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 77(1-2), pp. 43-66, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
26 | Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang 0002 |
Linear Time Algorithm for Quantum 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pp. 15:1-15:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-013-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
26 | Alice Paul, Matthias Poloczek, David P. Williamson |
Simple Approximation Algorithms for Balanced MAX 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, pp. 659-671, 2016, Springer, 978-3-662-49528-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
26 | Marco A. López Medina, José Raymundo Marcial-Romero, Guillermo De Ita Luna, José Antonio Hernández Servín |
Un algoritmo para calcular #2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Res. Comput. Sci. ![In: Res. Comput. Sci. 94, pp. 23-32, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
26 | Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang 0002 |
Linear time algorithm for quantum 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.06340, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
26 | José Raymundo Marcial-Romero, Guillermo De Ita Luna, José Antonio Hernández Servín, Rosa Maria Valdovinos |
A Parametric Polynomial Deterministic Algorithm for #2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI (1) ![In: Advances in Artificial Intelligence and Soft Computing - 14th Mexican International Conference on Artificial Intelligence, MICAI 2015, Cuernavaca, Morelos, Mexico, October 25-31, 2015, Proceedings, Part I, pp. 202-213, 2015, Springer, 978-3-319-27059-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Nitin Salodkar, Subramanian Rajagopalan, Sambuddha Bhattacharya, Shabbir H. Batterywala |
2SAT Based Infeasibility Resolution during Design Rule Correction on Layouts with Multiple Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSID ![In: 28th International Conference on VLSI Design, VLSID 2015, Bangalore, India, January 3-7, 2015, pp. 186-191, 2015, IEEE Computer Society, 978-1-4799-6658-5. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Guillermo De Ita Luna, José Raymundo Marcial-Romero, Yolanda Moyao |
An Enumerative Algorithm for #2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 46, pp. 81-88, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
26 | Alistair Sinclair, Dan Vilenchik |
Delaying satisfiability for random 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 43(2), pp. 251-263, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Guillermo De Ita Luna, Pedro Bello 0001, Meliza Contreras |
Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCPR ![In: Pattern Recognition - 5th Mexican Conference, MCPR 2013, Querétaro, Mexico, June 26-29, 2013. Proceedings, pp. 274-283, 2013, Springer, 978-3-642-38988-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Guillermo De Ita Luna, José Raymundo Marcial-Romero |
Computing #2SAT and #2UNSAT by Binary Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCPR ![In: Pattern Recognition - 4th Mexican Conference, MCPR 2012, Huatulco, Mexico, June 27-30, 2012. Proceedings, pp. 273-282, 2012, Springer, 978-3-642-31148-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | Guillermo De Ita Luna, José Raymundo Marcial-Romero, José Antonio Hernández Servín |
A Threshold for a Polynomial Solution of #2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 113(1), pp. 63-77, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu |
On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCIA ![In: Artificial Intelligence Research and Development - Proceedings of the 14th International Conference of the Catalan Association for Artificial Intelligence, Lleida, Catalonia, Spain, October 26-28, 2011, pp. 21-30, 2011, IOS Press, 978-1-60750-841-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Guillermo De Ita Luna, César Bautista, Luis Carlos Altamirano |
Solving 3-Colouring via 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCPR ![In: Pattern Recognition - Third Mexican Conference, MCPR 2011, Cancun, Mexico, June 29 - July 2, 2011. Proceedings, pp. 50-59, 2011, Springer, 978-3-642-21586-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Guillermo De Ita Luna, Fernando Zacarías Flores, Alejandro Rangel-Huerta |
A Note for Parametric Complexity of #2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LA-NMR ![In: Proceedings of the Seventh Latin American Workshop on Non-Monotonic Reasoning, LANMR 2011, Toluca, Estado de México, México, November 7-8, 2011, pp. 95-104, 2011, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
26 | Osamu Watanabe 0001, Masaki Yamamoto 0001 |
Average-case analysis for the MAX-2SAT problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 411(16-18), pp. 1685-1697, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Hans-Joachim Böckenhauer, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová |
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 44(3), pp. 363-377, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Alistair Sinclair, Dan Vilenchik |
Delaying Satisfiability for Random 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: 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, pp. 710-723, 2010, Springer, 978-3-642-15368-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Guillermo De Ita Luna, Pedro Bello López, Meliza Contreras González |
New Polynomial Classes for #2SAT Established Via Graph-Topological Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Lett. ![In: Eng. Lett. 15(2), pp. 250-258, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
26 | Carlos Guillén, Aurelio López-López, Guillermo De Ita Luna |
Model Counting for 2SAT Based on Graphs by Matrix Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Lett. ![In: Eng. Lett. 15(2), pp. 259-265, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
26 | Miroslav Chlebík, Janka Chlebíková |
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 155(2), pp. 172-179, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Pierre Bonami, Michel Minoux |
Exact MAX-2SAT solution via lift-and-project closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 34(4), pp. 387-393, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Note on MAX 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR06, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
26 | Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström |
Counting models for 2SAT and 3SAT formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 332(1-3), pp. 265-291, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | K. Subramani 0001 |
On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 50(3), pp. 281-292, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Lei Zheng, Peter J. Stuckey |
Improving SAT Using 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSC ![In: Computer Science 2002, Twenty-Fifth Australasian Computer Science Conference (ACSC2002), Monash University, Melbourne, Victoria, Australia, January/February 2002, pp. 331-340, 2002, Australian Computer Society, 0-909-92582-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
26 | Hans van Maaren, Joost P. Warners |
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 107(1-3), pp. 225-239, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
26 | Maria Alberta Alberti, Alberto Bertoni, Paola Campadelli, Giuliano Grossi, Roberto Posenato |
A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Networks ![In: Neural Networks 10(3), pp. 555-560, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Uriel Feige, Michel X. Goemans |
Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Third Israel Symposium on Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings, pp. 182-189, 1995, IEEE Computer Society, 0-8186-6915-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Michel X. Goemans, David P. Williamson |
.879-approximation algorithms for MAX CUT and MAX 2SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pp. 422-431, 1994, ACM, 0-89791-663-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | K. Subramani 0001 |
Absorbing Random Walks and the NAE2SAT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, pp. 89-100, 2008, Springer, 978-3-540-69310-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Vineet Bafna, Vikas Bansal 0001 |
Improved Recombination Lower Bounds for Haplotype Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings, pp. 569-584, 2005, Springer, 3-540-25866-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Subhash Khot |
On the Unique Games Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 3, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Ryan Williams 0001 |
On Computing k-CNF Formula Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 330-340, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Alon Efrat, Cesim Erten, Stephen G. Kobourov |
Fixed-Location Circular-Arc Drawing of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, pp. 147-158, 2003, Springer, 3-540-20831-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Zhongping Qin, Binhai Zhu |
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 100-109, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Alvaro del Val |
Simplifying Binary Propositional Theories into Connected Components Twice as Fast. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings, pp. 392-406, 2001, Springer, 3-540-42957-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda |
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 204-215, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Piotr Berman, Marek Karpinski |
On Some Tighter Inapproximability Results (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 200-209, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals |
19 | Howard J. Karloff, Uri Zwick |
A 7/8-Approximation Algorithm for MAX 3SAT? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 406-415, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | David P. Williamson |
Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 1, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|