Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Lanzinger
Person information
- affiliation: TU Wien, Vienna, Austria
- affiliation (former): University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Georg Gottlob
, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler:
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. ACM Trans. Database Syst. 49(1): 1:1-1:43 (2024)- [c18]Matthias Lanzinger, Stefano Sferrazza, Przemyslaw Andrzej Walega, Georg Gottlob:
Fuzzy Datalog∃ over Arbitrary t-Norms. LPAR 2024: 426-444 - [c17]Matthias Lanzinger, Igor Razgon:
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. STACS 2024: 48:1-48:17 - [i18]Emily Jin, Michael M. Bronstein, Ismail Ilkan Ceylan, Matthias Lanzinger:
Homomorphism Counts for Graph Neural Networks: All About That Basis. CoRR abs/2402.08595 (2024) - [i17]Matthias Lanzinger, Stefano Sferrazza, Przemyslaw Andrzej Walega, Georg Gottlob:
Fuzzy Datalog∃ over Arbitrary t-Norms. CoRR abs/2403.02933 (2024) - 2023
- [j5]Matthias Lanzinger:
Tractability beyond β-acyclicity for conjunctive queries with negation and SAT. Theor. Comput. Sci. 942: 276-296 (2023) - [j4]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
Fractional covers of hypergraphs with bounded multi-intersection. Theor. Comput. Sci. 979: 114204 (2023) - [c16]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer:
Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper). AMW 2023 - [c15]Matthias Lanzinger, Markus Nissl, Emanuel Sallinger, Przemyslaw Andrzej Walega:
Temporal Datalog with Existential Quantification. IJCAI 2023: 3277-3285 - [c14]Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob:
MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (Extended Abstract). IJCAI 2023: 6447-6451 - [c13]Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris:
Generative Datalog with Stable Negation. PODS 2023: 21-32 - [c12]Marco Bressan, Matthias Lanzinger, Marc Roth:
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. STOC 2023: 542-552 - [i16]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer:
Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice. CoRR abs/2303.02723 (2023) - [i15]Matthias Lanzinger, Igor Razgon:
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. CoRR abs/2309.17049 (2023) - [i14]Matthias Lanzinger, Pablo Barceló:
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. CoRR abs/2309.17053 (2023) - 2022
- [j3]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus:
Incremental Updates of Generalized Hypertree Decompositions. ACM J. Exp. Algorithmics 27: 1.16:1-1.16:28 (2022) - [j2]Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob:
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. Theory Pract. Log. Program. 22(5): 678-692 (2022) - [c11]Andrei Draghici, Georg Gottlob, Matthias Lanzinger:
On the Complexity of Inductively Learning Guarded Clauses. AAAI 2022: 5600-5607 - [c10]Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob:
New Perspectives for Fuzzy Datalog (Extended Abstract). Datalog 2022: 42-47 - [c9]Matthias Lanzinger, Przemyslaw Andrzej Walega:
Datalog with Existential Quantifiers and Temporal Operators (Extended Abstract). Datalog 2022: 139-144 - [c8]Marta Bernardini, Matthias Lanzinger, Rosario Laurendi, Stefano Sferrazza:
Family Link Detection in Uncertain Settings with MV-Datalog±. EDBT/ICDT Workshops 2022 - [c7]Matthias Lanzinger:
The Complexity of Conjunctive Queries with Degree 2. PODS 2022: 91-102 - [c6]Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler:
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. PODS 2022: 325-336 - [i13]Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob:
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. CoRR abs/2202.01718 (2022) - [i12]Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris:
Generative Datalog with Stable Negation. CoRR abs/2206.12247 (2022) - [i11]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus:
Incremental Updates of Generalized Hypertree Decompositions. CoRR abs/2209.10375 (2022) - [i10]Marco Bressan, Matthias Lanzinger, Marc Roth:
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. CoRR abs/2211.01905 (2022) - 2021
- [j1]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
Complexity Analysis of Generalized and Fractional Hypertree Decompositions. J. ACM 68(5): 38:1-38:50 (2021) - [c5]Matthias Lanzinger:
Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation. PODS 2021: 355-369 - [i9]Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler:
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. CoRR abs/2104.13793 (2021) - [i8]Andrei Draghici, Georg Gottlob, Matthias Lanzinger:
On the Complexity of Inductively Learning Guarded Rules. CoRR abs/2110.03624 (2021) - [i7]Matthias Lanzinger:
Forbidden Substructures for Tractable Conjunctive Query Answering with Degree 2. CoRR abs/2111.11532 (2021) - 2020
- [c4]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler:
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CPAIOR 2020: 3-21 - [c3]Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. IJCAI 2020: 1726-1733 - [c2]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
Fractional Covers of Hypergraphs with Bounded Multi-Intersection. MFCS 2020: 41:1-41:14 - [i6]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
Complexity Analysis of General and Fractional Hypertree Decompositions. CoRR abs/2002.05239 (2020) - [i5]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
Fractional Covers of Hypergraphs with Bounded Multi-Intersection. CoRR abs/2007.01830 (2020) - [i4]Matthias Lanzinger:
Tractability Beyond β-Acyclicity for Conjunctive Queries with Negation. CoRR abs/2007.08876 (2020) - [i3]Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. CoRR abs/2007.14169 (2020) - [i2]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler:
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CoRR abs/2012.14762 (2020)
2010 – 2019
- 2019
- [c1]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width Revisited (Extended Abstract). AMW 2019 - 2018
- [i1]Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems. CoRR abs/1812.04329 (2018)
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 2024-06-26 23:02 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
