DBScholar

Back to institutions

Vienna University of Technology

Overall Rank
99 | 96.61%
Pagerank
0.52037389
Paper Count
70

Authors at This Institution

Listed authors are those whose most frequent affiliation is this institution.

Showing 30 of 30 authors.

Rank Author Pagerank Papers
336 Reinhard Pichler 0.18060753 24
758 Katja Hose 0.0929884 14
1,317 Matthias Lanzinger 0.057461017 8
2,615 Sebastian Skritek 0.031717928 4
2,687 Thomas Eiter 0.031160132 4
3,546 Markus Kröll 0.024082413 3
3,674 Vadim Savenkov 0.023320769 3
4,115 Timo Camillo Merkl 0.021810525 3
5,688 Wolfgang Fischl 0.015427482 2
5,859 Mantas Šimkus 0.015196977 2
6,705 Alexander Selzer 0.014423675 2
7,036 Matteo Brandetti 0.014224319 2
11,362 Davide Mario Longo 0.0077914682 1
11,706 Bianca Löhnert 0.0076828397 1
11,707 Magdalena Ortiz 0.0076828397 1
12,065 Wolfgang Faber 0.0075966677 1
12,066 Michael Fink 0.0075966677 1
12,454 Simone Bova 0.007527386 1
12,455 Stefan Szeider 0.007527386 1
16,462 Alexis de Colnet 0.0070564499 1
16,473 Daniel Unterberger 0.0070564499 1
17,067 Markus Nissl 0.0070564499 1
17,079 Eda Cicek 0.0070564499 1
18,492 Michael Borkowski 0.0070564499 1
18,493 Christoph Hochreiner 0.0070564499 1
18,494 Stefan Schulte 0.0070564499 1
18,780 Aleksandar Pavlović 0.0070564499 1
19,699 Koumudi Ganepola 0.0070564499 1
20,437 Thomas Tschernko 0 1
20,438 Konrad Schwarz 0 1
Previous Page 1 / 1 Next

Papers with at Least One Affiliated Author

Showing 50 of 70 papers, sorted by pagerank.

Rank Paper Year Venue Pagerank
679 Efficient Algorithms for Processing XPath Queries 2002 VLDB 0.00014837097
684 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants 2007 PODS 0.00014798237
1,154 The Lixto Data Extraction Project - Back and Forth between Theory and Practice 2004 PODS 0.00011793227
1,599 Conjunctive Queries over Trees 2004 PODS 0.00010117703
1,690 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 9.8609347e-05
2,177 The Complexity of XPath Query Evaluation 2003 PODS 8.9153711e-05
2,223 Monadic Datalog and the Expressive Power of Languages for Web Information Extraction 2002 PODS 8.8092332e-05
2,517 On the Enumeration Complexity of Unions of Conjunctive Queries 2019 PODS 8.3589894e-05
2,557 On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals 1992 PODS 8.3008262e-05
2,594 Computing Cores for Data Exchange: New Algorithms and Practical Solutions 2005 PODS 8.2426092e-05
2,615 Visual Web Information Extraction with Lixto 2001 VLDB 8.2253533e-05
2,630 Convergence of Datalog over (Pre-) Semirings 2022 PODS 8.2027684e-05
3,531 Efficient Evaluation and Approximation of Well-designed Pattern Trees 2015 PODS 7.2274159e-05
3,585 Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams 2004 VLDB 7.189318e-05
3,633 Static Analysis and Optimization of Semantic Web Queries 2012 PODS 7.1484281e-05
3,813 Closed World Databases Opened Through Null Values 1988 VLDB 7.0084288e-05
4,345 FluXQuery: An Optimizing XQuery Processor for Streaming XML Data 2004 VLDB 6.6494821e-05
4,406 Normalization and Optimization of Schema Mappings 2009 VLDB 6.6125665e-05
4,445 Chase Termination for Guarded Existential Rules 2015 PODS 6.5976367e-05
4,749 DEMo: Data Exchange Modeling Tool 2009 VLDB 6.4370799e-05
4,807 On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values 2005 PODS 6.4079967e-05
5,035 The Vadalog System: Datalog-based Reasoning for Knowledge Graphs 2018 VLDB 6.3038469e-05
5,242 Complexity Bounds for Relational Algebra over Document Spanners 2019 PODS 6.2145035e-05
5,601 HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings 2019 PODS 6.0706976e-05
5,948 Containment and Equivalence of Well-Designed SPARQL 2014 PODS 5.9370407e-05
5,989 Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue 2024 PODS 5.9253439e-05
6,053 Magic Shapes for SHACL Validation 2022 VLDB 5.9026026e-05
6,264 General and Fractional Hypertree Decompositions: Hard and Easy Cases 2018 PODS 5.8308708e-05
6,481 The INFOMIX System for Advanced Integration of Incomplete and Inconsistent Data 2005 SIGMOD 5.770936e-05
6,688 Tractability Beyond beta-Acyclicity for Conjunctive Queries with Negation 2021 PODS 5.7075454e-05
6,847 Circuit Treewidth, Sentential Decision, and Query Compilation 2017 PODS 5.666154e-05
6,917 Expressiveness of Guarded Existential Rule Languages 2014 PODS 5.6462255e-05
7,139 Optimizing Recursive Queries with Program Synthesis 2022 SIGMOD 5.6006128e-05
7,712 Complexity Aspects of Various Semantics for Disjunctive Databases 1993 PODS 5.4702701e-05
7,917 Avoiding Materialisation for Guarded Aggregate Queries 2025 VLDB 5.4276002e-05
8,841 Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth 2022 PODS 5.2659886e-05
8,982 Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability 2015 PODS 5.2433996e-05
9,362 Exploring Exploratory Querying 2025 VLDB 5.1868213e-05
9,364 Transforming RDF Graphs to Property Graphs using Standardized Schemas 2024 SIGMOD 5.1868213e-05
9,704 Exploiting the Power of Equality-generating Dependencies in Ontological Reasoning 2022 VLDB 5.1378347e-05
9,753 Nested Dependencies: Structure and Reasoning 2014 PODS 5.1349531e-05
10,039 Supervised Wrapper Generation with Lixto 2001 VLDB 5.0925155e-05
10,054 Tractable Database Design through Bounded Treewidth 2006 PODS 5.087795e-05
10,115 Semantic Acyclicity Under Constraints 2016 PODS 5.0789354e-05
10,365 Size Bound-Adorned Datalog 2026 PODS 4.9793485e-05
10,372 FPT Parameterisations of Fractional and Generalised Hypertree Width 2026 PODS 4.9793485e-05
10,384 A Logical View of GNN-Style Computation and the Role of Activation Functions 2026 PODS 4.9793485e-05
10,396 Query Answering Under Volume-Based Diversity Functions 2026 PODS 4.9793485e-05
10,398 The Space-Time Complexity of Sum-Product Queries 2026 PODS 4.9793485e-05
10,879 Computing Why-Provenance for Property Graph Queries 2026 VLDB 4.9793485e-05
Previous Page 1 / 2 Next