dblp.uni-trier.dewww.uni-trier.de

Phokion G. Kolaitis Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
121EEFoto N. Afrati, Phokion G. Kolaitis: Repair checking in inconsistent databases: algorithms and complexity. ICDT 2009: 31-41
120EEBalder ten Cate, Phokion G. Kolaitis: Structural characterizations of schema-mapping languages. ICDT 2009: 63-72
119EERonald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Reverse data exchange: coping with nulls. PODS 2009: 23-32
118EECatriel Beeri, Phokion G. Kolaitis, Christos H. Papadimitriou: The ACM PODS Alberto O. Mendelzon test-of-time-award 2009. PODS 2009: 43
117EEPhokion G. Kolaitis, Swastik Kopparty: Random graphs and the parity quantifier. STOC 2009: 705-714
116EEBalder ten Cate, Laura Chiticariu, Phokion G. Kolaitis, Wang Chiew Tan: Laconic schema mappings: computing core universal solutions by means of SQL queries CoRR abs/0903.1953: (2009)
115EEBalder ten Cate, Laura Chiticariu, Phokion G. Kolaitis, Wang Chiew Tan: Laconic Schema Mappings: Computing the Core with SQL Queries. PVLDB 2(1): 1006-1017 (2009)
114EEParikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. SIAM J. Comput. 38(6): 2330-2355 (2009)
2008
113EENadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Springer 2008
112EEPhokion G. Kolaitis, Moshe Y. Vardi: A Logical Approach to Constraint Satisfaction. Complexity of Constraints 2008: 125-155
111EEFoto N. Afrati, Phokion G. Kolaitis: Answering aggregate queries in data exchange. PODS 2008: 129-138
110EERonald Fagin, Phokion G. Kolaitis, Alan Nash, Lucian Popa: Towards a theory of schema-mapping optimization. PODS 2008: 33-42
109EELaura Chiticariu, Phokion G. Kolaitis, Lucian Popa: Interactive generation of integrated schemas. SIGMOD Conference 2008: 833-846
108EERonald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Quasi-inverses of schema mappings. ACM Trans. Database Syst. 33(2): (2008)
107EENadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74(7): 1103-1115 (2008)
106EEHenry F. Korth, Philip A. Bernstein, Mary F. Fernández, Le Gruenwald, Phokion G. Kolaitis, Kathryn S. McKinley, M. Tamer Özsu: Paper and proposal reviews: is the process flawed? SIGMOD Record 37(3): 36-39 (2008)
2007
105EEPhokion G. Kolaitis: Reflections on Finite Model Theory. LICS 2007: 257-269
104EERonald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Quasi-inverses of schema mappings. PODS 2007: 123-132
103EELaura Chiticariu, Mauricio A. Hernández, Phokion G. Kolaitis, Lucian Popa: Semi-Automatic Schema Integration in Clio. VLDB 2007: 1326-1329
102EEDelbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis: Phase transitions of PP-complete satisfiability problems. Discrete Applied Mathematics 155(12): 1627-1639 (2007)
2006
101 Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: Complexity of Constraints, 01.10. - 06.10.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
100EENadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006
99EENadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006
98EEParikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. ICALP (1) 2006: 346-357
97EEPhokion G. Kolaitis, Jonathan Panttaja, Wang Chiew Tan: The complexity of data exchange. PODS 2006: 30-39
96EET. S. Jayram, Phokion G. Kolaitis, Erik Vee: The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89
95EEAriel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan: Peer data exchange. ACM Trans. Database Syst. 31(4): 1454-1498 (2006)
94EEParikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies CoRR abs/cs/0609072: (2006)
93EEParikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Electronic Colloquium on Computational Complexity (ECCC) 13(094): (2006)
92EETomás Feder, Phokion G. Kolaitis: Closures and dichotomies for quantified constraints. Electronic Colloquium on Computational Complexity (ECCC) 13(160): (2006)
91EEAlbert Atserias, Anuj Dawar, Phokion G. Kolaitis: On preservation under homomorphisms and unions of conjunctive queries. J. ACM 53(2): 208-237 (2006)
2005
90EEAriel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan: Peer data exchange. PODS 2005: 160-171
89EEPhokion G. Kolaitis: Schema mappings, data exchange, and metadata management. PODS 2005: 61-75
88EERonald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins: Efficient Implementation of Large-Scale Multi-Structural Databases. VLDB 2005: 958-969
87EEPhokion G. Kolaitis: LICS 2003 special issue. ACM Trans. Comput. Log. 6(4): 674 (2005)
86EERonald Fagin, Phokion G. Kolaitis, Lucian Popa: Data exchange: getting to the core. ACM Trans. Database Syst. 30(1): 174-210 (2005)
85EERonald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Composing schema mappings: Second-order dependencies to the rescue. ACM Trans. Database Syst. 30(4): 994-1055 (2005)
84EENadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Preferred representations of Boolean relations Electronic Colloquium on Computational Complexity (ECCC)(119): (2005)
83EELeopoldo E. Bertossi, Jan Chomicki, Parke Godfrey, Phokion G. Kolaitis, Alex Thomo, Calisto Zuzarte: Exchange, integration, and consistency of data: report on the ARISE/NISR workshop. SIGMOD Record 34(3): 87-90 (2005)
82EERonald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1): 89-124 (2005)
81EEArnaud Durand, Miki Hermann, Phokion G. Kolaitis: Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3): 496-513 (2005)
2004
80EEAlbert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi: Constraint Propagation as a Proof System. CP 2004: 77-91
79EEAlbert Atserias, Anuj Dawar, Phokion G. Kolaitis: On Preservation under Homomorphisms and Unions of Conjunctive Queries. PODS 2004: 319-329
78EERonald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Composing Schema Mappings: Second-Order Dependencies to the Rescue. PODS 2004: 83-94
77EEPhokion G. Kolaitis: Constraint Satisfaction, Complexity, and Logic. SETN 2004: 1-2
76EEPhokion G. Kolaitis, Michael J. Franklin: Foreword. ACM Trans. Database Syst. 29: 1 (2004)
75EEPhokion G. Kolaitis, Victor Vianu: Foreword. J. ACM 51(1): 1 (2004)
74EEGeorg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004)
73EELefteris M. Kirousis, Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput. Syst. 37(6): 695-715 (2004)
2003
72EEPhokion G. Kolaitis, Jonathan Panttaja: On the Complexity of Existential Pebble Games. CSL 2003: 314-329
71EERonald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa: Data Exchange: Semantics and Query Answering. ICDT 2003: 207-224
70 Delbert D. Bailey, Phokion G. Kolaitis: Phase Transitions of Bounded Satisfiability Problems. IJCAI 2003: 1187-1193
69 Phokion G. Kolaitis: Constraint Satisfaction, Databases, and Logic. IJCAI 2003: 1587-1595
68EERonald Fagin, Phokion G. Kolaitis, Lucian Popa: Data exchange: getting to the core. PODS 2003: 90-101
67EELefteris M. Kirousis, Phokion G. Kolaitis: The complexity of minimal satisfiability problems. Inf. Comput. 187(1): 20-39 (2003)
2002
66 Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis: Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. AAAI/IAAI 2002: 620-626
65EEVíctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. CP 2002: 310-326
2001
64EEPhokion G. Kolaitis, Thomas Raffill: In Search of a Phase Transition in the AC-Matching Problem. CP 2001: 433-450
63 Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis: Phase Transitions of PP-Complete Satisfiability Problems. IJCAI 2001: 183-192
62 Lefteris M. Kirousis, Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. LICS 2001: 71-80
61EELefteris M. Kirousis, Phokion G. Kolaitis: On the Complexity of Model Checking and Inference in Minimal Models. LPNMR 2001: 42-53
60EELefteris M. Kirousis, Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems. STACS 2001: 407-418
59EEJoseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu: On the unusual effectiveness of logic in computer science. Bulletin of Symbolic Logic 7(2): 213-236 (2001)
2000
58 Phokion G. Kolaitis, Moshe Y. Vardi: A Game-Theoretic Approach to Constraint Satisfaction. AAAI/IAAI 2000: 175-181
57 Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000: 664-674
56EEArnaud Durand, Miki Hermann, Phokion G. Kolaitis: Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000: 323-332
55EEPhokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. MFCS 2000: 84-98
54EELefteris M. Kirousis, Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems Electronic Colloquium on Computational Complexity (ECCC) 7(82): (2000)
53 Miki Hermann, Phokion G. Kolaitis: Unification Algorithms Cannot Be Combined in Polynomial Time. Inf. Comput. 162(1-2): 24-42 (2000)
52 Phokion G. Kolaitis, Moshe Y. Vardi: Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci. 61(2): 302-332 (2000)
51EEFoto N. Afrati, Phokion G. Kolaitis: Foreword: Selected Papers from ICDT 1997. Theor. Comput. Sci. 239(2): 187 (2000)
1999
50EEAlbert Atserias, Phokion G. Kolaitis: First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. LICS 1999: 275-284
49EEMiki Hermann, Laurent Juban, Phokion G. Kolaitis: On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. LPAR 1999: 13-32
48 Miki Hermann, Phokion G. Kolaitis: Computational Complexity of Simultaneous Elementary Matching Problems. J. Autom. Reasoning 23(2): 107-136 (1999)
1998
47 Phokion G. Kolaitis, Martin Otto: On the Boundedness Problem for Two-Variable First-Order Logic. LICS 1998: 513-524
46EEPhokion G. Kolaitis, David L. Martin, Madhukar N. Thakur: On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates. PODS 1998: 197-204
45EEPhokion G. Kolaitis, Moshe Y. Vardi: Conjunctive-Query Containment and Constraint Satisfaction. PODS 1998: 205-213
44EEKim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi: Panel: logic in the computer science curriculum. SIGCSE 1998: 376-377
43 Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur: Integer Programming as a Framework for Optimization and Approximability. J. Comput. Syst. Sci. 57(2): 144-161 (1998)
1997
42 Foto N. Afrati, Phokion G. Kolaitis: Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings Springer 1997
41 Miki Hermann, Phokion G. Kolaitis: On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. CP 1997: 282-296
40 Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: How to Define a Linear Order on Finite Models. Ann. Pure Appl. Logic 87(3): 241-267 (1997)
39EEErich Grädel, Phokion G. Kolaitis, Moshe Y. Vardi: On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic 3(1): 53-69 (1997)
38 Surajit Chaudhuri, Phokion G. Kolaitis: Can Datalog Be Approximated? J. Comput. Syst. Sci. 55(2): 355-369 (1997)
1996
37 Neil Immerman, Phokion G. Kolaitis: Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University American Mathematical Society 1996
36EEMiki Hermann, Phokion G. Kolaitis: Unification Algorithms Cannot be Combined in Polynomial Time. CADE 1996: 246-260
35EEIan Barland, Phokion G. Kolaitis, Madhukar N. Thakur: Integer Programming as a Framework for Optimization and Approximability. IEEE Conference on Computational Complexity 1996: 249-259
34 Phokion G. Kolaitis, Moshe Y. Vardi: On the Expressive Power of Variable-Confined Logics. LICS 1996: 348-359
33EELauri Hella, Phokion G. Kolaitis, Kerkko Luosto: Almost everywhere equivalence of logics in finite model theory. Bulletin of Symbolic Logic 2(4): 422-443 (1996)
1995
32EEAnuj Dawar, Lauri Hella, Phokion G. Kolaitis: Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP 1995: 624-635
31EEPhokion G. Kolaitis: Languages for Polynomial-Time Queries - An Ongoing Quest. ICDT 1995: 38-39
30EEMiki Hermann, Phokion G. Kolaitis: Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). MFCS 1995: 359-370
29EEPhokion G. Kolaitis: Combinatorial Games In Database Theory. PODS 1995: 231-232
28 Phokion G. Kolaitis, Jouko A. Väänänen: Generalized Quantifiers and Pebble Games on Finite Structures. Ann. Pure Appl. Logic 74(1): 23-75 (1995)
27 Phokion G. Kolaitis, Madhukar N. Thakur: Approximation Properties of NP Minimization Classes. J. Comput. Syst. Sci. 50(3): 391-411 (1995)
26 Phokion G. Kolaitis, Moshe Y. Vardi: On the Expressive Power of Datalog: Tools and a Case Study. J. Comput. Syst. Sci. 51(1): 110-134 (1995)
25 Miki Hermann, Phokion G. Kolaitis: The Complexity of Counting Problems in Equational Matching. J. Symb. Comput. 20(3): 343-362 (1995)
1994
24EEMiki Hermann, Phokion G. Kolaitis: The Complexity of Counting Problems in Equational Matching. CADE 1994: 560-574
23 Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: How to Define a Linear Order on Finite Models LICS 1994: 40-49
22EESurajit Chaudhuri, Phokion G. Kolaitis: Can Datalog be Approximated? PODS 1994: 86-96
21 Phokion G. Kolaitis, Madhukar N. Thakur: Logical Definability of NP Optimization Problems Inf. Comput. 115(2): 321-353 (1994)
1993
20 Phokion G. Kolaitis: A Tutorial on Finite Model Theory (Abstract) LICS 1993: 122
19 Phokion G. Kolaitis, Madhukar N. Thakur: Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). Structure in Complexity Theory Conference 1993: 31-41
1992
18EEPhokion G. Kolaitis, Moshe Y. Vardi: Infinitary Logic for Computer Science. ICALP 1992: 450-473
17 Phokion G. Kolaitis, Jouko A. Väänänen: Generalized Quantifiers and Pebble Games on Finite Structures LICS 1992: 348-359
16 Phokion G. Kolaitis, Moshe Y. Vardi: Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory LICS 1992: 46-57
15 Phokion G. Kolaitis, Moshe Y. Vardi: Infinitary Logics and 0-1 Laws Inf. Comput. 98(2): 258-294 (1992)
1991
14 Phokion G. Kolaitis, Madhukar N. Thakur: Approximation Properties of NP Minimization Classes. Structure in Complexity Theory Conference 1991: 353-366
13 Phokion G. Kolaitis: The Expressive Power of Stratified Programs Inf. Comput. 90(1): 50-66 (1991)
12 Phokion G. Kolaitis, Christos H. Papadimitriou: Why not Negation by Fixpoint? J. Comput. Syst. Sci. 43(1): 125-144 (1991)
1990
11 Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws for Infinitary Logics (Preliminary Report) LICS 1990: 156-167
10 Phokion G. Kolaitis: Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report) LICS 1990: 168-180
9EEPhokion G. Kolaitis, Moshe Y. Vardi: On the Expressive Power of Datalog: Tools and a Case Study. PODS 1990: 61-71
8 Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws and Decision Problems for Fragments of Second-Order Logic Inf. Comput. 87(1/2): 301-337 (1990)
7EEPhokion G. Kolaitis, Christos H. Papadimitriou: Some Computational Aspects of Circumscription J. ACM 37(1): 1-14 (1990)
1988
6 Phokion G. Kolaitis, Christos H. Papadimitriou: Some Computational Aspects of Circumscription. AAAI 1988: 455-469
5 Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws and Decision Problems for Fragments of Second-Order Logic LICS 1988: 2-11
4EEPhokion G. Kolaitis, Christos H. Papadimitriou: Why Not Negation by Fixpoint? PODS 1988: 231-239
1987
3 Phokion G. Kolaitis, Moshe Y. Vardi: The Decision Problem for the Probabilities of Higher-Order Properties STOC 1987: 425-435
1985
2 Phokion G. Kolaitis: On Asymptotic Probability of Inductive Queries and Their Decision Problem. Logic of Programs 1985: 153-166
1979
1 Phokion G. Kolaitis: Recursion in a Quantifier vs. Elementary Induction. J. Symb. Log. 44(2): 235-259 (1979)

Coauthor Index

1Foto N. Afrati [42] [51] [111] [121]
2Albert Atserias [50] [79] [80] [91]
3Delbert D. Bailey [63] [66] [70] [102]
4Ian Barland [35] [43]
5Catriel Beeri [118]
6Philip A. Bernstein [106]
7Leopoldo E. Bertossi [83]
8Kim B. Bruce [44]
9Balder ten Cate [115] [116] [120]
10Surajit Chaudhuri [22] [38]
11Laura Chiticariu [103] [109] [115] [116]
12Jan Chomicki [83]
13Nadia Creignou [84] [99] [100] [101] [107] [113]
14Víctor Dalmau [63] [65] [66] [102]
15Anuj Dawar [32] [79] [91]
16Arnaud Durand [56] [81]
17Ronald Fagin [68] [71] [78] [82] [85] [86] [88] [104] [108] [110] [119]
18Tomás Feder [92]
19Mary F. Fernández (Mary F. Fernandez) [106]
20Michael J. Franklin (Mike Franklin) [76]
21Ariel Fuxman [90] [95]
22Parke Godfrey [83]
23Parikshit Gopalan [93] [94] [98] [114]
24Georg Gottlob [57] [74]
25Erich Grädel [39]
26Le Gruenwald [106]
27Joseph Y. Halpern [59]
28Robert Harper [59]
29Lauri Hella [23] [32] [33] [40]
30Miki Hermann [24] [25] [30] [36] [41] [48] [49] [53] [56] [81]
31Mauricio A. Hernández [103]
32Neil Immerman [37] [59]
33T. S. Jayram (Jayram S. Thathachar) [96]
34Laurent Juban [49]
35Lefteris M. Kirousis [54] [60] [61] [62] [67] [73]
36Swastik Kopparty [117]
37Henry F. Korth [106]
38Ravi Kumar (S. Ravi Kumar) [88]
39Daniel Leivant [44]
40Kerkko Luosto [23] [33] [40]
41Elitza N. Maneva [93] [94] [98] [114]
42David L. Martin [46]
43Kathryn S. McKinley [106]
44Renée J. Miller [71] [82] [90] [95]
45Alan Nash [110]
46Jasmine Novak [88]
47Martin Otto [47]
48M. Tamer Özsu [106]
49Jonathan Panttaja [72] [97]
50Christos H. Papadimitriou [4] [6] [7] [12] [93] [94] [98] [114] [118]
51Lucian Popa [68] [71] [78] [82] [85] [86] [103] [104] [108] [109] [110] [119]
52Thomas Raffill [64]
53Thomas Schwentick [57] [74]
54D. Sivakumar [88]
55Wang Chiew Tan [78] [85] [90] [95] [97] [104] [108] [115] [116] [119]
56Madhukar N. Thakur [14] [19] [21] [27] [35] [43] [46]
57Alex Thomo [83]
58Andrew Tomkins [88]
59Jouko A. Väänänen [17] [28]
60Moshe Y. Vardi [3] [5] [8] [9] [11] [15] [16] [18] [26] [34] [39] [44] [45] [52] [55] [58] [59] [65] [80] [112]
61Erik Vee [96]
62Victor Vianu [59] [75]
63Heribert Vollmer [99] [100] [101] [113]
64Bruno Zanuttini [84] [107]
65Calisto Zuzarte [83]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)