1. Mikolaj Boja 'n, Anca Muscholl, Thomas Schwentick, Luc Segoufin and Claire David.
    Two-Variable Logic on Words with Data.
    In 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings. 2006, 7–16.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/lics/BojanczykMSSD06,
    	author = "Miko{l}aj Boja{'{n}}czyk and Anca Muscholl and Thomas Schwentick and Luc Segoufin and Claire David",
    	title = "Two-Variable Logic on Words with Data",
    	booktitle = "21th {IEEE} Symposium on Logic in Computer Science {(LICS} 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings",
    	pages = "7--16",
    	publisher = "{IEEE} Computer Society",
    	year = 2006,
    	url = "https://doi.org/10.1109/LICS.2006.51",
    	doi = "10.1109/LICS.2006.51",
    	timestamp = "Thu, 25 May 2017 00:42:41 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/lics/BojanczykMSSD06",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Mikolaj Boja 'n, Claire David, Anca Muscholl, Thomas Schwentick and Luc Segoufin.
    Two-variable logic on data trees and XML reasoning.
    In Stijn Vansummeren (ed.). Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA. 2006, 10–19.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/pods/BojanczykDMSS06,
    	author = "Miko{l}aj Boja{'{n}}czyk and Claire David and Anca Muscholl and Thomas Schwentick and Luc Segoufin",
    	editor = "Stijn Vansummeren",
    	title = "Two-variable logic on data trees and {XML} reasoning",
    	booktitle = "Proceedings of the Twenty-Fifth {ACM} {SIGACT-SIGMOD-SIGART} Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, {USA}",
    	pages = "10--19",
    	publisher = "{ACM}",
    	year = 2006,
    	url = "https://doi.org/10.1145/1142351.1142354",
    	doi = "10.1145/1142351.1142354",
    	timestamp = "Tue, 06 Nov 2018 16:58:02 +0100",
    	biburl = "https://dblp.org/rec/bib/conf/pods/BojanczykDMSS06",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Pierre McKenzie, Thomas Schwentick, Denis Thérien and Heribert Vollmer.
    The many faces of a translation.
    J. Comput. Syst. Sci. 72(1):163–179, 2006.
    URL, DOI BibTeX

    @article{DBLP:journals/jcss/McKenzieSTV06,
    	author = "Pierre McKenzie and Thomas Schwentick and Denis Th{\'{e}}rien and Heribert Vollmer",
    	title = "The many faces of a translation",
    	journal = "J. Comput. Syst. Sci.",
    	volume = 72,
    	number = 1,
    	pages = "163--179",
    	year = 2006,
    	url = "https://doi.org/10.1016/j.jcss.2005.08.003",
    	doi = "10.1016/j.jcss.2005.08.003",
    	timestamp = "Sat, 20 May 2017 00:25:56 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/jcss/McKenzieSTV06",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Wim Martens, Frank Neven, Thomas Schwentick and Geert Jan Bex.
    Expressiveness and complexity of XML Schema.
    ACM Trans. Database Syst. 31(3):770–813, 2006.
    URL, DOI BibTeX

    @article{DBLP:journals/tods/MartensNSB06,
    	author = "Wim Martens and Frank Neven and Thomas Schwentick and Geert Jan Bex",
    	title = "Expressiveness and complexity of {XML} Schema",
    	journal = "{ACM} Trans. Database Syst.",
    	volume = 31,
    	number = 3,
    	pages = "770--813",
    	year = 2006,
    	url = "https://doi.org/10.1145/1166074.1166076",
    	doi = "10.1145/1166074.1166076",
    	timestamp = "Thu, 09 May 2019 13:10:55 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/tods/MartensNSB06",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Anca Muscholl, Thomas Schwentick and Luc Segoufin.
    Active Context-Free Games.
    Theory Comput. Syst. 39(1):237–276, 2006.
    URL, DOI BibTeX

    @article{DBLP:journals/mst/MuschollSS06,
    	author = "Anca Muscholl and Thomas Schwentick and Luc Segoufin",
    	title = "Active Context-Free Games",
    	journal = "Theory Comput. Syst.",
    	volume = 39,
    	number = 1,
    	pages = "237--276",
    	year = 2006,
    	url = "https://doi.org/10.1007/s00224-005-1278-3",
    	doi = "10.1007/s00224-005-1278-3",
    	timestamp = "Sun, 28 May 2017 13:18:25 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/mst/MuschollSS06",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Frank Neven and Thomas Schwentick.
    On the complexity of XPath containment in the presence of disjunction, DTDs, and variables.
    Logical Methods in Computer Science 2(3), 2006.
    URL, DOI BibTeX

    @article{DBLP:journals/lmcs/NevenS06,
    	author = "Frank Neven and Thomas Schwentick",
    	title = "On the complexity of XPath containment in the presence of disjunction, DTDs, and variables",
    	journal = "Logical Methods in Computer Science",
    	volume = 2,
    	number = 3,
    	year = 2006,
    	url = "https://doi.org/10.2168/LMCS-2(3:1)2006",
    	doi = "10.2168/LMCS-2(3:1)2006",
    	timestamp = "Tue, 14 May 2019 16:31:27 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/lmcs/NevenS06",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

2005

  1. Volker Weber and Thomas Schwentick.
    Dynamic Complexity Theory Revisited.
    Theory Comput. Syst. 40(4):355–377, 2007.
    URL, DOI BibTeX

    @article{DBLP:journals/mst/WeberS07,
    	author = "Volker Weber and Thomas Schwentick",
    	title = "Dynamic Complexity Theory Revisited",
    	journal = "Theory Comput. Syst.",
    	volume = 40,
    	number = 4,
    	pages = "355--377",
    	year = 2007,
    	url = "https://doi.org/10.1007/s00224-006-1312-0",
    	doi = "10.1007/s00224-006-1312-0",
    	timestamp = "Sun, 28 May 2017 13:18:24 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/mst/WeberS07",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Geert Jan Bex, Wim Martens, Frank Neven and Thomas Schwentick.
    Expressiveness of XSDs: from practice to theory, there and back again.
    In Allan Ellis and Tatsuya Hagino (eds.). Proceedings of the 14th international conference on World Wide Web, WWW 2005, Chiba, Japan, May 10-14, 2005. 2005, 712–721.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/www/BexMNS05,
    	author = "Geert Jan Bex and Wim Martens and Frank Neven and Thomas Schwentick",
    	editor = "Allan Ellis and Tatsuya Hagino",
    	title = "Expressiveness of XSDs: from practice to theory, there and back again",
    	booktitle = "Proceedings of the 14th international conference on World Wide Web, {WWW} 2005, Chiba, Japan, May 10-14, 2005",
    	pages = "712--721",
    	publisher = "{ACM}",
    	year = 2005,
    	url = "https://doi.org/10.1145/1060745.1060848",
    	doi = "10.1145/1060745.1060848",
    	timestamp = "Tue, 06 Nov 2018 16:57:08 +0100",
    	biburl = "https://dblp.org/rec/bib/conf/www/BexMNS05",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Frank Neven, Thomas Schwentick and Dan Suciu (eds.).
    Foundations of Semistructured Data, 6.-11. February 2005

    05061. IBFI, Schloss Dagstuhl, Germany, 2005.
    URL BibTeX

    @proceedings{DBLP:conf/dagstuhl/2005P5061,
    	editor = "Frank Neven and Thomas Schwentick and Dan Suciu",
    	title = "Foundations of Semistructured Data, 6.-11. February 2005",
    	series = "Dagstuhl Seminar Proceedings",
    	volume = 05061,
    	publisher = "IBFI, Schloss Dagstuhl, Germany",
    	year = 2005,
    	url = "http://drops.dagstuhl.de/portals/05061/",
    	timestamp = "Mon, 09 Dec 2013 17:20:14 +0100",
    	biburl = "https://dblp.org/rec/bib/conf/dagstuhl/2005P5061",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Kumar Neeraj Verma, Helmut Seidl and Thomas Schwentick.
    On the Complexity of Equational Horn Clauses.
    In Robert Nieuwenhuis (ed.). Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings 3632. 2005, 337–352.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/cade/VermaSS05,
    	author = "Kumar Neeraj Verma and Helmut Seidl and Thomas Schwentick",
    	editor = "Robert Nieuwenhuis",
    	title = "On the Complexity of Equational Horn Clauses",
    	booktitle = "Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings",
    	series = "Lecture Notes in Computer Science",
    	volume = 3632,
    	pages = "337--352",
    	publisher = "Springer",
    	year = 2005,
    	url = "https://doi.org/10.1007/11532231\_25",
    	doi = "10.1007/11532231\_25",
    	timestamp = "Tue, 14 May 2019 10:00:39 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/cade/VermaSS05",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Wim Martens, Frank Neven and Thomas Schwentick.
    Which XML Schemas Admit 1-Pass Preorder Typing?.
    In Thomas Eiter and Leonid Libkin (eds.). Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings 3363. 2005, 68–82.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/icdt/MartensNS05,
    	author = "Wim Martens and Frank Neven and Thomas Schwentick",
    	editor = "Thomas Eiter and Leonid Libkin",
    	title = "Which {XML} Schemas Admit 1-Pass Preorder Typing?",
    	booktitle = "Database Theory - {ICDT} 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings",
    	series = "Lecture Notes in Computer Science",
    	volume = 3363,
    	pages = "68--82",
    	publisher = "Springer",
    	year = 2005,
    	url = "https://doi.org/10.1007/978-3-540-30570-5\_5",
    	doi = "10.1007/978-3-540-30570-5\_5",
    	timestamp = "Tue, 14 May 2019 10:00:54 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/icdt/MartensNS05",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }