default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Mengel
Stefan Senitsch
Person information
- affiliation: CNRS, CRIL, Lens, France
- affiliation: École Polytechnique, LIX, Palaiseau, France
- affiliation: TU Berlin, Department of Mathematics, Germany
- affiliation: University of Paderborn, Institute of Mathematics, Germany
Other persons with a similar name
SPARQL queries 
🛈 Please note that only 66% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2020 – today
- 2026
[j18]Hubie Chen, Stefan Mengel:
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. Log. Methods Comput. Sci. 22(2) (2026)- [i46]Florent Capelli, YooJung Choi, Stefan Mengel, Martín Muñoz
, Guy Van den Broeck:
A canonical generalization of OBDD. CoRR abs/2604.05537 (2026) - 2025
- [j17]Stefan Mengel, Harry Vinall-Smeeth:
A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity. Proc. ACM Manag. Data 3(2): 88:1-88:19 (2025) - [j16]Karl Bringmann, Nofar Carmeli, Stefan Mengel:
Tight Fine-Grained Bounds for Direct Access on Join Queries. ACM Trans. Database Syst. 50(1): 1:1-1:44 (2025) - [c42]Lorenzo Loconte, Stefan Mengel, Antonio Vergari:
Sum of Squares Circuits. AAAI 2025: 19077-19085 - [c41]Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros:
Dynamic Direct Access of MSO Query Evaluation over Strings. ICDT 2025: 26:1-26:18 - [c40]Stefan Mengel:
Lower Bounds for Conjunctive Query Evaluation. PODS Companion 2025: 5 - [i45]Stefan Mengel:
Lower Bounds for Conjunctive Query Evaluation. CoRR abs/2506.17702 (2025) - 2024
- [j15]Hélène Fargier, Stefan Mengel, Jérôme Mengin:
An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages. Ann. Math. Artif. Intell. 92(5): 1161-1196 (2024) - [c39]Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel:
Skyline Operators for Document Spanners. ICDT 2024: 7:1-7:18 - [c38]Hubie Chen, Stefan Mengel:
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. ICDT 2024: 16:1-16:17 - [c37]Lorenzo Loconte, Aleksanteri M. Sladek, Stefan Mengel, Martin Trapp, Arno Solin, Nicolas Gillis, Antonio Vergari:
Subtractive Mixture Models via Squaring: Representation and Learning. ICLR 2024 - [c36]Frédéric Koriche, Jean-Marie Lagniez, Stefan Mengel, Chi Tran:
Learning Model Agnostic Explanations via Constraint Programming. ECML/PKDD (4) 2024: 437-453 - [c35]Christoph Berkholz, Stefan Mengel, Hermann Wilhelm:
A Characterization of Efficiently Compilable Constraint Languages. STACS 2024: 11:1-11:19 - [i44]Lorenzo Loconte, Stefan Mengel, Antonio Vergari:
Sum of Squares Circuits. CoRR abs/2408.11778 (2024) - [i43]Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros:
Dynamic direct access of MSO query evaluation over strings. CoRR abs/2409.17329 (2024) - [i42]Frédéric Koriche, Jean-Marie Lagniez, Stefan Mengel, Chi Tran:
Learning Model Agnostic Explanations via Constraint Programming. CoRR abs/2411.08478 (2024) - [i41]Hubie Chen, Stefan Mengel:
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. CoRR abs/2411.10229 (2024) - [i40]Stefan Mengel, Harry Vinall-Smeeth:
A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity. CoRR abs/2412.03199 (2024) - [i39]Pablo Barceló, Pierre Bourhis, Stefan Mengel, Sudeepa Roy:
Representation, Provenance, and Explanations in Database Theory and Logic (Dagstuhl Seminar 24032). Dagstuhl Reports 14(1): 49-71 (2024) - 2023
- [j14]Alexis de Colnet, Stefan Mengel:
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. J. Artif. Intell. Res. 76: 265-286 (2023) - [c34]Stefan Mengel:
Bounds on BDD-Based Bucket Elimination. SAT 2023: 16:1-16:11 - [i38]Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel:
Skyline Operators for Document Spanners. CoRR abs/2304.06155 (2023) - [i37]Stefan Mengel:
Bounds on BDD-Based Bucket Elimination. CoRR abs/2306.00886 (2023) - [i36]Lorenzo Loconte, Aleksanteri M. Sladek, Stefan Mengel, Martin Trapp, Arno Solin, Nicolas Gillis, Antonio Vergari:
Subtractive Mixture Models via Squaring: Representation and Learning. CoRR abs/2310.00724 (2023) - [i35]Christoph Berkholz, Stefan Mengel, Hermann Wilhelm:
A characterization of efficiently compilable constraint languages. CoRR abs/2311.10040 (2023) - [i34]Hubie Chen, Gianluigi Greco, Stefan Mengel, Francesco Scarcello:
Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. CoRR abs/2311.14579 (2023) - 2022
- [j13]Stefan Mengel:
No Efficient Disjunction or Conjunction of Switch-Lists. J. Satisf. Boolean Model. Comput. 13(1): 1-4 (2022) - [c33]Alexis de Colnet, Stefan Mengel:
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation. AAAI 2022: 5564-5572 - [c32]Karl Bringmann, Nofar Carmeli, Stefan Mengel:
Tight Fine-Grained Bounds for Direct Access on Join Queries. PODS 2022: 427-436 - [c31]Stefan Mengel:
Changing Partitions in Rectangle Decision Lists. SAT 2022: 17:1-17:20 - [i33]Karl Bringmann, Nofar Carmeli, Stefan Mengel:
Tight Fine-Grained Bounds for Direct Access on Join Queries. CoRR abs/2201.02401 (2022) - [i32]Stefan Mengel:
No Efficient Disjunction or Conjunction of Switch-Lists. CoRR abs/2203.04788 (2022) - 2021
- [b2]Stefan Mengel:
Counting, Knowledge Compilation and Applications. Artois University, Arras, France, 2021 - [j12]Stefan Mengel, Sebastian Skritek:
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. Theory Comput. Syst. 65(1): 3-41 (2021) - [j11]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. ACM Trans. Database Syst. 46(1): 2:1-2:30 (2021) - [c30]Alexis de Colnet, Stefan Mengel:
A Compilation of Succinctness Results for Arithmetic Circuits. KR 2021: 205-215 - [c29]Alexis de Colnet, Stefan Mengel:
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. SAT 2021: 116-133 - [c28]Stefan Mengel, Friedrich Slivovsky:
Proof Complexity of Symbolic QBF Reasoning. SAT 2021: 399-416 - [i31]Alexis de Colnet, Stefan Mengel:
Characterizing Tseitin-formulas with short regular resolution refutations. CoRR abs/2103.09609 (2021) - [i30]Stefan Mengel, Friedrich Slivovsky:
Proof Complexity of Symbolic QBF Reasoning. CoRR abs/2104.02563 (2021) - [i29]Alexis de Colnet, Stefan Mengel:
A Compilation of Succinctness Results for Arithmetic Circuits. CoRR abs/2110.13014 (2021) - [i28]Stefan Mengel:
A short note on the counting complexity of conjunctive queries. CoRR abs/2112.01108 (2021) - [i27]Alexis de Colnet, Stefan Mengel:
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation. CoRR abs/2112.12430 (2021) - 2020
- [j10]Romain Wallon, Stefan Mengel:
Revisiting Graph Width Measures for CNF-Encodings. J. Artif. Intell. Res. 67: 409-436 (2020) - [j9]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. SIGMOD Rec. 49(1): 25-32 (2020) - [c27]Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon:
On Irrelevant Literals in Pseudo-Boolean Constraint Learning. IJCAI 2020: 1148-1154 - [c26]Alexis de Colnet, Stefan Mengel:
Lower Bounds for Approximate Knowledge Compilation. IJCAI 2020: 1834-1840 - [i26]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR abs/2003.02576 (2020) - [i25]Alexis de Colnet, Stefan Mengel:
Lower Bounds for Approximate Knowledge Compilation. CoRR abs/2011.13721 (2020) - [i24]Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon:
On Irrelevant Literals in Pseudo-Boolean Constraint Learning. CoRR abs/2012.04424 (2020)
2010 – 2019
- 2019
- [j8]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Minimal Distance of Propositional Models. Theory Comput. Syst. 63(6): 1131-1184 (2019) - [c25]Stefan Mengel, Sebastian Skritek:
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. ICDT 2019: 20:1-20:18 - [c24]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT 2019: 22:1-22:19 - [c23]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. PODS 2019: 89-103 - [c22]Stefan Mengel, Romain Wallon:
Revisiting Graph Width Measures for CNF-Encodings. SAT 2019: 222-238 - [c21]Florent Capelli, Stefan Mengel:
Tractable QBF by Knowledge Compilation. STACS 2019: 18:1-18:16 - [i23]Stefan Mengel, Romain Wallon:
Revisiting Graph Width Measures for CNF-Encodings. CoRR abs/1905.05290 (2019) - 2018
- [j7]Stefan Mengel:
Lower bounds on the mim-width of some graph classes. Discret. Appl. Math. 248: 28-32 (2018) - [j6]Christian Ikenmeyer, Stefan Mengel:
On the relative power of reduction notions in arithmetic circuit complexity. Inf. Process. Lett. 130: 7-10 (2018) - [c20]Antoine Amarilli, Pierre Bourhis, Stefan Mengel:
Enumeration on Trees under Relabelings. ICDT 2018: 5:1-5:18 - [c19]Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon:
Pseudo-Boolean Constraints from a Knowledge Representation Perspective. IJCAI 2018: 1891-1897 - [c18]Michael Lampis, Stefan Mengel, Valia Mitsou:
QBF as an Alternative to Courcelle's Theorem. SAT 2018: 235-252 - [i22]Michael Lampis, Stefan Mengel, Valia Mitsou:
QBF as an Alternative to Courcelle's Theorem. CoRR abs/1805.08456 (2018) - [i21]Florent Capelli, Stefan Mengel:
Knowledge Compilation, Width and Quantification. CoRR abs/1807.04263 (2018) - [i20]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR abs/1807.09320 (2018) - [i19]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. CoRR abs/1812.09519 (2018) - 2017
- [c17]Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel:
A Circuit-Based Approach to Efficient Enumeration. ICALP 2017: 111:1-111:15 - [c16]Hubie Chen, Stefan Mengel:
The logic of counting query answers. LICS 2017: 1-12 - [i18]Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel:
A Circuit-Based Approach to Efficient Enumeration. CoRR abs/1702.05589 (2017) - [i17]Antoine Amarilli, Pierre Bourhis, Stefan Mengel:
Enumeration on Trees under Relabelings. CoRR abs/1709.06185 (2017) - [i16]Stefan Mengel, Sebastian Skritek:
On tractable query evaluation for SPARQL. CoRR abs/1712.08939 (2017) - 2016
- [j5]Florent Capelli, Arnaud Durand, Stefan Mengel:
The Arithmetic Complexity of Tensor Contraction. Theory Comput. Syst. 58(4): 506-527 (2016) - [c15]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
The Next Whisky Bar. CSR 2016: 41-56 - [c14]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
Knowledge Compilation Meets Communication Complexity. IJCAI 2016: 1008-1014 - [c13]Hubie Chen, Stefan Mengel:
Counting Answers to Existential Positive Queries: A Complexity Classification. PODS 2016: 315-326 - [c12]Stefan Mengel:
Parameterized Compilation Lower Bounds for Restricted CNF-Formulas. SAT 2016: 3-12 - [c11]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
As Close as It Gets. WALCOM 2016: 222-235 - [i15]Hubie Chen, Stefan Mengel:
Counting Answers to Existential Positive Queries: A Complexity Classification. CoRR abs/1601.03240 (2016) - [i14]Stefan Mengel:
Parameterized Compilation Lower Bounds for Restricted CNF-formulas. CoRR abs/1604.06715 (2016) - [i13]Stefan Mengel:
Lower Bounds on the mim-width of Some Perfect Graph Classes. CoRR abs/1608.01542 (2016) - [i12]Christian Ikenmeyer, Stefan Mengel:
On the relative power of reduction notions in arithmetic circuit complexity. CoRR abs/1609.05942 (2016) - 2015
- [j4]Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. Comput. Complex. 24(1): 1-30 (2015) - [j3]Arnaud Durand, Stefan Mengel:
Structural Tractability of Counting of Solutions to Conjunctive Queries. Theory Comput. Syst. 57(4): 1202-1249 (2015) - [c10]Hubie Chen, Stefan Mengel:
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. ICDT 2015: 110-126 - [c9]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Give Me Another One! ISAAC 2015: 664-676 - [c8]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
On Compiling CNFs into Structured Deterministic DNNFs. SAT 2015: 199-214 - [c7]Johann Brault-Baron, Florent Capelli, Stefan Mengel:
Understanding Model Counting for beta-acyclic CNF-formulas. STACS 2015: 143-156 - [i11]Hubie Chen, Stefan Mengel:
The Logic of Counting Query Answers: A Study via Existential Positive Queries. CoRR abs/1501.07195 (2015) - [i10]Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
Minimal Distance of Propositional Models. CoRR abs/1502.06761 (2015) - 2014
- [j2]Arnaud Durand, Stefan Mengel:
The complexity of weighted counting for acyclic conjunctive queries. J. Comput. Syst. Sci. 80(1): 277-296 (2014) - [c6]Florent Capelli, Arnaud Durand, Stefan Mengel:
Hypergraph Acyclicity and Propositional Model Counting. SAT 2014: 399-414 - [i9]Florent Capelli, Arnaud Durand, Stefan Mengel:
Hypergraph Acyclicity and Propositional Model Counting. CoRR abs/1401.6307 (2014) - [i8]Johann Brault-Baron, Florent Capelli, Stefan Mengel:
Understanding model counting for $β$-acyclic CNF-formulas. CoRR abs/1405.6043 (2014) - [i7]Hubie Chen, Stefan Mengel:
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. CoRR abs/1408.0890 (2014) - [i6]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
Expander CNFs have Exponential DNNF Size. CoRR abs/1411.1995 (2014) - 2013
- [b1]Stefan Mengel:
Conjunctive queries, arithmetic circuits and counting complexity. University of Paderborn, 2013, pp. 1-221 - [c5]Arnaud Durand, Stefan Mengel:
Structural tractability of counting of solutions to conjunctive queries. ICDT 2013: 81-92 - [c4]Stefan Mengel:
Arithmetic Branching Programs with Memory. MFCS 2013: 667-678 - [c3]Florent Capelli, Arnaud Durand, Stefan Mengel:
The arithmetic complexity of tensor contractions. STACS 2013: 365-376 - [i5]Stefan Mengel:
Arithmetic Branching Programs with Memory. CoRR abs/1303.1969 (2013) - [i4]Arnaud Durand, Stefan Mengel:
Structural Tractability of Counting of Solutions to Conjunctive Queries. CoRR abs/1303.2059 (2013) - 2012
- [c2]Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in arithmetic circuits: Complete problems in the counting hierarchy. STACS 2012: 362-373 - [i3]Florent Capelli, Arnaud Durand, Stefan Mengel:
The arithmetic complexity of tensor contractions. CoRR abs/1209.4865 (2012) - 2011
- [c1]Stefan Mengel:
Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems - (Extended Abstract). ICALP (1) 2011: 700-711 - [i2]Arnaud Durand, Stefan Mengel:
On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems. CoRR abs/1110.4201 (2011) - [i1]Hervé Fournier, Guillaume Malod, Stefan Mengel:
Monomials in arithmetic circuits: Complete problems in the counting hierarchy. CoRR abs/1110.6271 (2011)
2000 – 2009
- 2009
- [j1]Jochen Harant, Stefan Senitsch:
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. Discret. Math. 309(15): 4949-4951 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-08 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
