The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 2SAT with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1991-2002 (18) 2003-2006 (16) 2007-2012 (15) 2013-2018 (18) 2019-2020 (3)
Publication types (Num. hits)
article(25) inproceedings(45)
Venues (Conferences, Journals, ...)
FOCS(4) MCPR(4) CoRR(3) Discret. Appl. Math.(3) ISAAC(3) MICAI (1)(3) CP(2) Eng. Lett.(2) FAW(2) ICALP(2) LANMR(2) SAT(2) Theor. Comput. Sci.(2) ACM Trans. Comput. Log.(1) ACSC(1) AISC(1) More (+10 of total 49)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 12 keywords

Results
Found 70 publication records. Showing 70 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
112M. Borschbach, A. Exeler A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Max-2SAT, tabu search, memetic algorithms
108K. Subramani 0001 On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas. Search on Bibsonomy ASIAN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
100Peter J. Stuckey, Lei Zheng Improving GSAT Using 2SAT. Search on Bibsonomy CP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
100K. Subramani 0001 On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. Search on Bibsonomy AISC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
94K. Subramani 0001 Optimal length tree-like resolution refutations for 2SAT formulas. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF 2SAT formulas, tree-like proofs, Resolution
63Osamu Watanabe 0001, Masaki Yamamoto 0001 Average-Case Analysis for the MAX-2SAT Problem. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
63Miroslav Chlebík, Janka Chlebíková On Approximation Hardness of the Minimum 2SAT-DELETION Problem. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
63Peter J. Stuckey, Lei Zheng Improving Nogood Recording Using 2SAT. Search on Bibsonomy ICTAI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
63Markus Bläser, Bodo Manthey Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
56Venkatesan Guruswami On 2-Query Codeword Testing with Near-Perfect Completeness. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Dorit S. Hochbaum, Anu Pathria Approximating a generalization of MAX 2SAT and MIN 2SAT. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
44Magnus Wahlström A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. Search on Bibsonomy IWPEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
44Mistuo Motoki Test Instance Generation for MAX 2SAT. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
44Cristina Bazgan, Wenceslas Fernandez de la Vega A Polynomial Time Approximation Scheme for Dense MIN 2SAT. Search on Bibsonomy FCT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
37Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee Maximizing the Number of Independent Labels in the Plane. Search on Bibsonomy FAW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà The Interface between P and NP in Signed CNF Formulas. Search on Bibsonomy ISMVL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Christos H. Papadimitriou On Selecting a Satisfying Truth Assignment (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF 2SAT, satisfying truth assignment selection, natural generalizations, default preference, polynomial-time randomized algorithm, complexity, satisfiability, minimality, circumscription, selection criteria
26Guillermo De Ita, José Raymundo Marcial-Romero, José Antonio Hernández Servín A bottom-up algorithm for solving ♯2SAT. Search on Bibsonomy Log. J. IGPL The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
26Marco 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 MICAI (1) The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
26David Avis, Hans Raj Tiwary Compact linear programs for 2SAT. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
26Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang 0002 Linear-Time Algorithm for Quantum 2SAT. Search on Bibsonomy Theory Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
26Alice Paul, Matthias Poloczek, David P. Williamson Simple Approximation Algorithms for Balanced MAX 2SAT. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
26Marco 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 MCPR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
26Guillermo De Ita, Pedro Bello 0001, Miguel Rodríguez 0001 The computation of #2SAT by a fixed-parameter tractable algorithm. Search on Bibsonomy LANMR The full citation details ... 2018 DBLP  BibTeX  RDF
26Marco 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 LANMR The full citation details ... 2018 DBLP  BibTeX  RDF
26M. 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 CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
26David Avis, Hans Raj Tiwary Compact linear programs for 2SAT. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
26Marco 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 MICAI (1) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
26Josep 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 Ann. Math. Artif. Intell. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
26Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang 0002 Linear Time Algorithm for Quantum 2SAT. Search on Bibsonomy ICALP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
26Alice Paul, Matthias Poloczek, David P. Williamson Simple Approximation Algorithms for Balanced MAX 2SAT. Search on Bibsonomy LATIN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
26Marco 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 Res. Comput. Sci. The full citation details ... 2015 DBLP  BibTeX  RDF
26Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang 0002 Linear time algorithm for quantum 2SAT. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
26José 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 MICAI (1) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
26Nitin Salodkar, Subramanian Rajagopalan, Sambuddha Bhattacharya, Shabbir H. Batterywala 2SAT Based Infeasibility Resolution during Design Rule Correction on Layouts with Multiple Grids. Search on Bibsonomy VLSID The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
26Guillermo De Ita Luna, José Raymundo Marcial-Romero, Yolanda Moyao An Enumerative Algorithm for #2SAT. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
26Alistair Sinclair, Dan Vilenchik Delaying satisfiability for random 2SAT. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
26Guillermo De Ita Luna, Pedro Bello 0001, Meliza Contreras Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT. Search on Bibsonomy MCPR The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
26Guillermo De Ita Luna, José Raymundo Marcial-Romero Computing #2SAT and #2UNSAT by Binary Patterns. Search on Bibsonomy MCPR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
26Guillermo De Ita Luna, José Raymundo Marcial-Romero, José Antonio Hernández Servín A Threshold for a Polynomial Solution of #2SAT. Search on Bibsonomy Fundam. Informaticae The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
26Josep 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 CCIA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
26Guillermo De Ita Luna, César Bautista, Luis Carlos Altamirano Solving 3-Colouring via 2SAT. Search on Bibsonomy MCPR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
26Guillermo De Ita Luna, Fernando Zacarías Flores, Alejandro Rangel-Huerta A Note for Parametric Complexity of #2SAT. Search on Bibsonomy LA-NMR The full citation details ... 2011 DBLP  BibTeX  RDF
26Osamu Watanabe 0001, Masaki Yamamoto 0001 Average-case analysis for the MAX-2SAT problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
26Hans-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 RAIRO Theor. Informatics Appl. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
26Alistair Sinclair, Dan Vilenchik Delaying Satisfiability for Random 2SAT. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
26Guillermo De Ita Luna, Pedro Bello López, Meliza Contreras González New Polynomial Classes for #2SAT Established Via Graph-Topological Structure. Search on Bibsonomy Eng. Lett. The full citation details ... 2007 DBLP  BibTeX  RDF
26Carlos Guillén, Aurelio López-López, Guillermo De Ita Luna Model Counting for 2SAT Based on Graphs by Matrix Operators. Search on Bibsonomy Eng. Lett. The full citation details ... 2007 DBLP  BibTeX  RDF
26Miroslav Chlebík, Janka Chlebíková Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Pierre Bonami, Michel Minoux Exact MAX-2SAT solution via lift-and-project closure. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Moses Charikar, Konstantin Makarychev, Yury Makarychev Note on MAX 2SAT. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2006 DBLP  BibTeX  RDF
26Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström Counting models for 2SAT and 3SAT formulae. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26K. Subramani 0001 On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries. Search on Bibsonomy Math. Log. Q. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Lei Zheng, Peter J. Stuckey Improving SAT Using 2SAT. Search on Bibsonomy ACSC The full citation details ... 2002 DBLP  BibTeX  RDF
26Hans van Maaren, Joost P. Warners Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
26Maria Alberta Alberti, Alberto Bertoni, Paola Campadelli, Giuliano Grossi, Roberto Posenato A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation. Search on Bibsonomy Neural Networks The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
26Uriel Feige, Michel X. Goemans Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. Search on Bibsonomy ISTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
26Michel X. Goemans, David P. Williamson .879-approximation algorithms for MAX CUT and MAX 2SAT. Search on Bibsonomy STOC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
19K. Subramani 0001 Absorbing Random Walks and the NAE2SAT Problem. Search on Bibsonomy FAW The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Vineet Bafna, Vikas Bansal 0001 Improved Recombination Lower Bounds for Haplotype Data. Search on Bibsonomy RECOMB The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
19Subhash Khot On the Unique Games Conjecture. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
19Ryan Williams 0001 On Computing k-CNF Formula Properties. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
19Alon Efrat, Cesim Erten, Stephen G. Kobourov Fixed-Location Circular-Arc Drawing of Planar Graphs. Search on Bibsonomy GD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
19Zhongping Qin, Binhai Zhu A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels. Search on Bibsonomy SWAT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
19Alvaro del Val Simplifying Binary Propositional Theories into Connected Components Twice as Fast. Search on Bibsonomy LPAR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. Search on Bibsonomy ISAAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
19Piotr Berman, Marek Karpinski On Some Tighter Inapproximability Results (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals
19Howard J. Karloff, Uri Zwick A 7/8-Approximation Algorithm for MAX 3SAT? Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
19David P. Williamson Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). Search on Bibsonomy WG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #70 of 70 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license