1. Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello and Thomas Schwentick.
    Tree Projections: Game Characterization and Computational Aspects.
    In Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. 2009, 217–226.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/birthday/GottlobGMSS09,
    	author = "Georg Gottlob and Gianluigi Greco and Zolt{\'{a}}n Mikl{\'{o}}s and Francesco Scarcello and Thomas Schwentick",
    	title = "Tree Projections: Game Characterization and Computational Aspects",
    	booktitle = "Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday",
    	year = 2009,
    	pages = "217--226",
    	crossref = "DBLP:conf/birthday/2009golumbic",
    	url = "http://dx.doi.org/10.1007/978-3-642-02029-2_21",
    	doi = "10.1007/978-3-642-02029-2_21",
    	timestamp = "Tue, 18 Nov 2014 21:31:41 +0100",
    	biburl = "http://dblp.uni-trier.de/rec/bib/conf/birthday/GottlobGMSS09",
    	bibsource = "dblp computer science bibliography, http://dblp.org"
    }
    

2008

  1. Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick and Victor Vianu (eds.).
    Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04. - 25.04.2008

    08171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2008.
    URL BibTeX

    @proceedings{DBLP:conf/dagstuhl/2008P8171,
    	editor = {Anca Muscholl and Ramaswamy Ramanujam and Micha{\"{e}}l Rusinowitch and Thomas Schwentick and Victor Vianu},
    	title = "Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04. - 25.04.2008",
    	series = "Dagstuhl Seminar Proceedings",
    	volume = 08171,
    	publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
    	year = 2008,
    	url = "http://drops.dagstuhl.de/portals/08171/",
    	timestamp = "Tue, 07 Apr 2015 19:23:45 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/dagstuhl/2008P8171",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Henrik Björklund, Wim Martens and Thomas Schwentick.
    Optimizing Conjunctive Queries over Trees Using Schema Information.
    In Edward Ochmanski and Jerzy Tyszkiewicz (eds.). Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings 5162. 2008, 132–143.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/mfcs/BjorklundMS08,
    	author = {Henrik Bj{\"{o}}rklund and Wim Martens and Thomas Schwentick},
    	editor = "Edward Ochmanski and Jerzy Tyszkiewicz",
    	title = "Optimizing Conjunctive Queries over Trees Using Schema Information",
    	booktitle = "Mathematical Foundations of Computer Science 2008, 33rd International Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings",
    	series = "Lecture Notes in Computer Science",
    	volume = 5162,
    	pages = "132--143",
    	publisher = "Springer",
    	year = 2008,
    	url = "https://doi.org/10.1007/978-3-540-85238-4\_10",
    	doi = "10.1007/978-3-540-85238-4\_10",
    	timestamp = "Tue, 14 May 2019 10:00:37 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/mfcs/BjorklundMS08",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Thomas Schwentick.
    A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract).
    In Susanne Albers and Pascal Weil (eds.). STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings 1. 2008, 17–18.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/stacs/Schwentick08,
    	author = "Thomas Schwentick",
    	editor = "Susanne Albers and Pascal Weil",
    	title = "A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract)",
    	booktitle = "{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings",
    	series = "LIPIcs",
    	volume = 1,
    	pages = "17--18",
    	publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany",
    	year = 2008,
    	url = "https://doi.org/10.4230/LIPIcs.STACS.2008.1325",
    	doi = "10.4230/LIPIcs.STACS.2008.1325",
    	timestamp = "Thu, 23 Aug 2018 15:56:39 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/stacs/Schwentick08",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Wim Martens, Frank Neven and Thomas Schwentick.
    Deterministic top-down tree automata: past, present, and future.
    In Jörg Flum, Erich Grädel and Thomas Wilke (eds.). Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. 2. 2008, 505–530.
    BibTeX

    @inproceedings{DBLP:conf/birthday/MartensNS08,
    	author = "Wim Martens and Frank Neven and Thomas Schwentick",
    	editor = {J{\"{o}}rg Flum and Erich Gr{\"{a}}del and Thomas Wilke},
    	title = "Deterministic top-down tree automata: past, present, and future",
    	booktitle = "Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas].",
    	series = "Texts in Logic and Games",
    	volume = 2,
    	pages = "505--530",
    	publisher = "Amsterdam University Press",
    	year = 2008,
    	timestamp = "Wed, 15 Dec 2010 22:16:39 +0100",
    	biburl = "https://dblp.org/rec/bib/conf/birthday/MartensNS08",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Thomas Schwentick and Dan Suciu.
    Introduction to ICDT 2007 special section.
    ACM Trans. Database Syst. 33(4):27:1, 2008.
    URL, DOI BibTeX

    @article{DBLP:journals/tods/SchwentickS08,
    	author = "Thomas Schwentick and Dan Suciu",
    	title = "Introduction to {ICDT} 2007 special section",
    	journal = "{ACM} Trans. Database Syst.",
    	volume = 33,
    	number = 4,
    	pages = "27:1",
    	year = 2008,
    	url = "https://doi.org/10.1145/1412331.1412339",
    	doi = "10.1145/1412331.1412339",
    	timestamp = "Tue, 06 Nov 2018 12:51:47 +0100",
    	biburl = "https://dblp.org/rec/bib/journals/tods/SchwentickS08",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

2007

  1. Henrik Björklund, Wim Martens and Thomas Schwentick.
    Conjunctive Query Containment over Trees.
    In Marcelo Arenas and Michael I Schwartzbach (eds.). Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers 4797. 2007, 66–80.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/dbpl/BjorklundMS07,
    	author = {Henrik Bj{\"{o}}rklund and Wim Martens and Thomas Schwentick},
    	editor = "Marcelo Arenas and Michael I. Schwartzbach",
    	title = "Conjunctive Query Containment over Trees",
    	booktitle = "Database Programming Languages, 11th International Symposium, {DBPL} 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers",
    	series = "Lecture Notes in Computer Science",
    	volume = 4797,
    	pages = "66--80",
    	publisher = "Springer",
    	year = 2007,
    	url = "https://doi.org/10.1007/978-3-540-75987-4\_5",
    	doi = "10.1007/978-3-540-75987-4\_5",
    	timestamp = "Tue, 14 May 2019 10:00:50 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/dbpl/BjorklundMS07",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Henrik Björklund and Thomas Schwentick.
    On Notions of Regularity for Data Languages.
    In Erzsébet Csuhaj-Varjú and Zoltán Ésik (eds.). Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings 4639. 2007, 88–99.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/fct/BjorklundS07,
    	author = {Henrik Bj{\"{o}}rklund and Thomas Schwentick},
    	editor = "Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Zolt{\'{a}}n {\'{E}}sik",
    	title = "On Notions of Regularity for Data Languages",
    	booktitle = "Fundamentals of Computation Theory, 16th International Symposium, {FCT} 2007, Budapest, Hungary, August 27-30, 2007, Proceedings",
    	series = "Lecture Notes in Computer Science",
    	volume = 4639,
    	pages = "88--99",
    	publisher = "Springer",
    	year = 2007,
    	url = "https://doi.org/10.1007/978-3-540-74240-1\_9",
    	doi = "10.1007/978-3-540-74240-1\_9",
    	timestamp = "Tue, 14 May 2019 10:00:53 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/fct/BjorklundS07",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Georg Gottlob, Zoltán Miklós and Thomas Schwentick.
    Generalized hypertree decompositions: np-hardness and tractable variants.
    In Leonid Libkin (ed.). Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China. 2007, 13–22.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/pods/GottlobMS07,
    	author = "Georg Gottlob and Zolt{\'{a}}n Mikl{\'{o}}s and Thomas Schwentick",
    	editor = "Leonid Libkin",
    	title = "Generalized hypertree decompositions: np-hardness and tractable variants",
    	booktitle = "Proceedings of the Twenty-Sixth {ACM} {SIGACT-SIGMOD-SIGART} Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China",
    	pages = "13--22",
    	publisher = "{ACM}",
    	year = 2007,
    	url = "https://doi.org/10.1145/1265530.1265533",
    	doi = "10.1145/1265530.1265533",
    	timestamp = "Sun, 02 Jun 2019 21:25:51 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/pods/GottlobMS07",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Gjergji Kasneci and Thomas Schwentick.
    The complexity of reasoning about pattern-based XML schemas.
    In Leonid Libkin (ed.). Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China. 2007, 155–164.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/pods/KasneciS07,
    	author = "Gjergji Kasneci and Thomas Schwentick",
    	editor = "Leonid Libkin",
    	title = "The complexity of reasoning about pattern-based {XML} schemas",
    	booktitle = "Proceedings of the Twenty-Sixth {ACM} {SIGACT-SIGMOD-SIGART} Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China",
    	pages = "155--164",
    	publisher = "{ACM}",
    	year = 2007,
    	url = "https://doi.org/10.1145/1265530.1265552",
    	doi = "10.1145/1265530.1265552",
    	timestamp = "Tue, 06 Nov 2018 16:58:02 +0100",
    	biburl = "https://dblp.org/rec/bib/conf/pods/KasneciS07",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Thomas Schwentick and Volker Weber.
    Bounded-Variable Fragments of Hybrid Logics.
    In Wolfgang Thomas and Pascal Weil (eds.). STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings 4393. 2007, 561–572.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/stacs/SchwentickW07,
    	author = "Thomas Schwentick and Volker Weber",
    	editor = "Wolfgang Thomas and Pascal Weil",
    	title = "Bounded-Variable Fragments of Hybrid Logics",
    	booktitle = "{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings",
    	series = "Lecture Notes in Computer Science",
    	volume = 4393,
    	pages = "561--572",
    	publisher = "Springer",
    	year = 2007,
    	url = "https://doi.org/10.1007/978-3-540-70918-3\_48",
    	doi = "10.1007/978-3-540-70918-3\_48",
    	timestamp = "Tue, 14 May 2019 10:00:48 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/stacs/SchwentickW07",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Thomas Schwentick, Denis Thérien and Heribert Vollmer (eds.).
    Circuits, Logic, and Games, 08.11. - 10.11.2006

    06451. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.
    URL BibTeX

    @proceedings{DBLP:conf/dagstuhl/2006P6451,
    	editor = "Thomas Schwentick and Denis Th{\'{e}}rien and Heribert Vollmer",
    	title = "Circuits, Logic, and Games, 08.11. - 10.11.2006",
    	series = "Dagstuhl Seminar Proceedings",
    	volume = 06451,
    	publisher = "Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany",
    	year = 2007,
    	url = "http://drops.dagstuhl.de/portals/06451/",
    	timestamp = "Wed, 19 Jun 2013 12:19:16 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/dagstuhl/2006P6451",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Thomas Schwentick and Dan Suciu (eds.).
    Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings

    4353. Springer, 2007.
    URL, DOI BibTeX

    @proceedings{DBLP:conf/icdt/2007,
    	editor = "Thomas Schwentick and Dan Suciu",
    	title = "Database Theory - {ICDT} 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings",
    	series = "Lecture Notes in Computer Science",
    	volume = 4353,
    	publisher = "Springer",
    	year = 2007,
    	url = "https://doi.org/10.1007/11965893",
    	doi = "10.1007/11965893",
    	isbn = "3-540-69269-X",
    	timestamp = "Tue, 14 May 2019 10:00:54 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/icdt/2007",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    
  1. Wim Martens, Frank Neven and Thomas Schwentick.
    Simple off the shelf abstractions for XML schema.
    SIGMOD Record 36(3):15–22, 2007.
    URL, DOI BibTeX

    @article{DBLP:journals/sigmod/MartensNS07,
    	author = "Wim Martens and Frank Neven and Thomas Schwentick",
    	title = "Simple off the shelf abstractions for {XML} schema",
    	journal = "{SIGMOD} Record",
    	volume = 36,
    	number = 3,
    	pages = "15--22",
    	year = 2007,
    	url = "https://doi.org/10.1145/1324185.1324188",
    	doi = "10.1145/1324185.1324188",
    	timestamp = "Tue, 06 Nov 2018 12:51:22 +0100",
    	biburl = "https://dblp.org/rec/bib/journals/sigmod/MartensNS07",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Thomas Schwentick.
    Automata for XML - A survey.
    J. Comput. Syst. Sci. 73(3):289–315, 2007.
    URL, DOI BibTeX

    @article{DBLP:journals/jcss/Schwentick07,
    	author = "Thomas Schwentick",
    	title = "Automata for {XML} - {A} survey",
    	journal = "J. Comput. Syst. Sci.",
    	volume = 73,
    	number = 3,
    	pages = "289--315",
    	year = 2007,
    	url = "https://doi.org/10.1016/j.jcss.2006.10.003",
    	doi = "10.1016/j.jcss.2006.10.003",
    	timestamp = "Sat, 20 May 2017 00:25:55 +0200",
    	biburl = "https://dblp.org/rec/bib/journals/jcss/Schwentick07",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

2006

  1. Geert Jan Bex, Frank Neven, Thomas Schwentick and Karl Tuyls.
    Inference of Concise DTDs from XML Data.
    In Umeshwar Dayal, Kyu-Young Whang, David B Lomet, Gustavo Alonso, Guy M Lohman, Martin L Kersten, Sang Kyun Cha and Young-Kuk Kim (eds.). Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006. 2006, 115–126.
    URL BibTeX

    @inproceedings{DBLP:conf/vldb/BexNST06,
    	author = "Geert Jan Bex and Frank Neven and Thomas Schwentick and Karl Tuyls",
    	editor = "Umeshwar Dayal and Kyu{-}Young Whang and David B. Lomet and Gustavo Alonso and Guy M. Lohman and Martin L. Kersten and Sang Kyun Cha and Young{-}Kuk Kim",
    	title = "Inference of Concise DTDs from {XML} Data",
    	booktitle = "Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006",
    	pages = "115--126",
    	publisher = "{ACM}",
    	year = 2006,
    	url = "http://dl.acm.org/citation.cfm?id=1164139",
    	timestamp = "Thu, 30 Apr 2015 18:34:40 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/vldb/BexNST06",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Mikolaj Boja 'n, Mathias Samuelides, Thomas Schwentick and Luc Segoufin.
    Expressive Power of Pebble Automata.
    In Michele Bugliesi, Bart Preneel, Vladimiro Sassone and Ingo Wegener (eds.). Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I 4051. 2006, 157–168.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/icalp/BojanczykSSS06,
    	author = "Miko{l}aj Boja{'{n}}czyk and Mathias Samuelides and Thomas Schwentick and Luc Segoufin",
    	editor = "Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener",
    	title = "Expressive Power of Pebble Automata",
    	booktitle = "Automata, Languages and Programming, 33rd International Colloquium, {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}",
    	series = "Lecture Notes in Computer Science",
    	volume = 4051,
    	pages = "157--168",
    	publisher = "Springer",
    	year = 2006,
    	url = "https://doi.org/10.1007/11786986\_15",
    	doi = "10.1007/11786986\_15",
    	timestamp = "Tue, 14 May 2019 10:00:44 +0200",
    	biburl = "https://dblp.org/rec/bib/conf/icalp/BojanczykSSS06",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }