Frank Neven

Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven: Generating, Sampling and Counting Subclasses of Regular Tree Languages. Theory Comput. Syst. 52(3): 542-585 (2013)

Timos Antonopoulos, Frank Neven, Frédéric Servais: Definability problems for graph query languages. ICDT 2013: 141-152

Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick: Developing and Analyzing XSDs through BonXai. PVLDB 5(12): 1994-1997 (2012)

Wouter Gelade, Frank Neven: Succinctness of the Complement and Intersection of Regular Expressions. ACM Trans. Comput. Log. 13(1): 4 (2012)

Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven: Deciding twig-definability of node selecting tree automata. ICDT 2012: 61-73

Wouter Gelade, Frank Neven: Succinctness of pattern-based schema languages for XML. J. Comput. Syst. Sci. 77(3): 505-519 (2011)

Tom J. Ameloot, Maarten Marx, Wim Martens, Frank Neven, Justin van Wees: 30 Years of PODS in facts and figures. SIGMOD Record 40(3): 54-60 (2011)

Peter Boyen, Dries Van Dyck, Frank Neven, Roeland C. H. J. van Ham, Aalt D. J. van Dijk: SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1344-1357 (2011)

Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven: Generating, sampling and counting subclasses of regular tree languages. ICDT 2011: 30-41

Timos Antonopoulos, Wim Martens, Frank Neven: The complexity of text-preserving XML transformations. PODS 2011: 247-258

Tom J. Ameloot, Frank Neven, Jan Van den Bussche: Relational transducers for declarative networking. PODS 2011: 283-292

Wouter Gelade, Frank Neven: Optimizing the Region Algebra is PSPACE-complete. Inf. Process. Lett. 110(16): 639-643 (2010)

Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren: Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2) (2010)

Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren: Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. TWEB 4(4) (2010)

Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven: Simplifying XML schema: single-type approximations of regular tree languages. PODS 2010: 251-260

Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren: Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. CoRR abs/1004.2372 (2010)

Tom J. Ameloot, Frank Neven, Jan Van den Bussche: Relational transducers for declarative networking. CoRR abs/1012.2858 (2010)

Wouter Gelade, Wim Martens, Frank Neven: Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. SIAM J. Comput. 38(5): 2021-2043 (2009)

Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. SIAM J. Comput. 39(4): 1486-1530 (2009)

Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan van Dijk, Roeland C. H. J. van Ham: SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks. ICDM 2009: 716-721

Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven: Simplifying XML schema: effortless handling of nondeterministic regular expressions. SIGMOD Conference 2009: 731-744

Frank Neven: XML Types. Encyclopedia of Database Systems 2009: 3650-3654

Wim Martens, Frank Neven, Marc Gyssens: Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput. 206(7): 806-827 (2008)

Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen, Stijn Vansummeren: Scalable multi-query optimization for exploratory queries over federated scientific databases. PVLDB 1(1): 16-27 (2008)

Wenfei Fan, Floris Geerts, Frank Neven: Expressiveness and complexity of XML publishing transducers. ACM Trans. Database Syst. 33(4) (2008)

Wim Martens, Frank Neven, Thomas Schwentick: Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530

Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen: BioScout: a life-science query monitoring system. EDBT 2008: 730-734

Wenfei Fan, Floris Geerts, Wouter Gelade, Frank Neven, Antonella Poggi: Complexity and composition of synthesized web services. PODS 2008: 231-240

Geert Jan Bex, Frank Neven, Stijn Vansummeren: SchemaScope: a system for inferring and cleaning XML schemas. SIGMOD Conference 2008: 1259-1262

Wouter Gelade, Frank Neven: Succinctness of the Complement and Intersection of Regular Expressions. STACS 2008: 325-336

Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren: Learning deterministic regular expressions for the inference of schemas from XML data. WWW 2008: 825-834

Wouter Gelade, Frank Neven: Succinctness of the Complement and Intersection of Regular Expressions. CoRR abs/0802.2869 (2008)

Wim Martens, Frank Neven: Frontiers of tractability for typechecking simple XML transformations. J. Comput. Syst. Sci. 73(3): 362-390 (2007)

Wim Martens, Frank Neven, Thomas Schwentick: Simple off the shelf abstractions for XML schema. SIGMOD Record 36(3): 15-22 (2007)

Michael Benedikt, Leonid Libkin, Frank Neven: Logical definability and query languages over ranked and unranked trees. ACM Trans. Comput. Log. 8(2) (2007)

Wouter Gelade, Frank Neven: Succinctness of Pattern-Based Schema Languages for XML. DBPL 2007: 201-215

Wouter Gelade, Wim Martens, Frank Neven: Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. ICDT 2007: 269-283

Wenfei Fan, Floris Geerts, Frank Neven: Expressiveness and complexity of xml publishing transducers. PODS 2007: 83-92

Geert Jan Bex, Frank Neven, Stijn Vansummeren: Inferring XML Schema Definitions from XML Data. VLDB 2007: 998-1009

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

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

Dieter Van de Craen, Frank Neven, Kerstin Koch: An Extensible Light-Weight XML-Based Monitoring System for Sequence Databases. DILS 2006: 280-296

Frank Neven, Dieter Van de Craen: Optimizing Monitoring Queries over Distributed Data. EDBT 2006: 829-846

Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls: Inference of Concise DTDs from XML Data. VLDB 2006: 115-126

Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. CoRR abs/cs/0606065 (2006)

Wim Martens, Frank Neven, Marc Gyssens: On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas. CoRR abs/cs/0606094 (2006)

Frank Neven: Attribute grammars for unranked trees as a query language for structured documents. J. Comput. Syst. Sci. 70(2): 221-257 (2005)

Wim Martens, Frank Neven: On the complexity of typechecking top-down XML transformations. Theor. Comput. Sci. 336(1): 153-180 (2005)

Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Abstracts Collection - Foundations of Semistructured Data. Foundations of Semistructured Data 2005

Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Summary - Foundations of Semi-structured Data. Foundations of Semistructured Data 2005

Wim Martens, Frank Neven, Thomas Schwentick: Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82

Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick: Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721

Frank Neven, Thomas Schwentick, Dan Suciu (Eds.): Foundations of Semistructured Data, 6.-11. February 2005. Dagstuhl Seminar Proceedings 05061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005

AnHai Doan, Frank Neven, Robert McCann, Geert Jan Bex (Eds.): Proceedings of the Eight International Workshop on the Web & Databases (WebDB 2005), Baltimore, Maryland, USA, Collocated mith ACM SIGMOD/PODS 2005, June 16-17, 2005. 2005

Frank Neven, Thomas Schwentick, Victor Vianu: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004)

Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900

Wim Martens, Frank Neven: Frontiers of Tractability for Typechecking Simple XML Transformations. PODS 2004: 23-34

Geert Jan Bex, Frank Neven, Jan Van den Bussche: DTDs versus XML Schema: A Practical Study. WebDB 2004: 79-84

Frank Neven, Thomas Schwentick: On the power of tree-walking automata. Inf. Comput. 183(1): 86-103 (2003)

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu: XML with data values: typechecking revisited. J. Comput. Syst. Sci. 66(4): 688-727 (2003)

Kenneth A. Ross, Frank Neven, Beng Chin Ooi: Reminiscences on Influential Papers. SIGMOD Record 32(2): 89 (2003)

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu: Typechecking XML views of relational databases. ACM Trans. Comput. Log. 4(3): 315-354 (2003)

Wim Martens, Frank Neven: Typechecking Top-Down Uniform Unranked Tree Transducers. ICDT 2003: 64-78

Frank Neven, Thomas Schwentick: XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326

Leonid Libkin, Frank Neven: Logical Definability and Query Languages over Unranked Trees. LICS 2003: 178-187

Frank Neven, Catriel Beeri, Tova Milo (Eds.): Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA. ACM 2003, isbn 1-58113-670-6

Geert Jan Bex, Sebastian Maneth, Frank Neven: A formal model for an expressive fragment of XSLT. Inf. Syst. 27(1): 21-39 (2002)

Frank Neven, Jan Van den Bussche: Expressiveness of structured document query languages based on attribute grammars. J. ACM 49(1): 56-100 (2002)

Frank Neven: Automata Theory for XML Researchers. SIGMOD Record 31(3): 39-46 (2002)

Frank Neven, Thomas Schwentick: Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002)

Frank Neven: Automata, Logic, and XML. CSL 2002: 2-26

Frank Neven: On the Power of Walking for Querying Tree-Structured Data. PODS 2002: 77-84

Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche: Adding For-Loops to First-Order Logic. Inf. Comput. 168(2): 156-186 (2001)

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu: Typechecking XML Views of Relational Databases. LICS 2001: 421-430

Frank Neven, Thomas Schwentick, Victor Vianu: Towards Regular Languages over Infinite Alphabets. MFCS 2001: 560-572

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu: XML with Data Values: Typechecking Revisited. PODS 2001

Frank Neven, Thomas Schwentick: Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178

Geert Jan Bex, Sebastian Maneth, Frank Neven: A Formal Model for an Expressive Fragment of XSLT. Computational Logic 2000: 1137-1151

Frank Neven, Thomas Schwentick: On the Power of Tree-Walking Automata. ICALP 2000: 547-560

Frank Neven, Thomas Schwentick: Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000: 145-156

Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen: Typed Query Languages for Databases Containing Queries. Inf. Syst. 24(7): 569-595 (1999)

Sebastian Maneth, Frank Neven: Structured Document Transformations Based on XSL. DBPL 1999: 80-98

Frank Neven: Extensions of Attribute Grammars for Structured Document Queries. DBPL 1999: 99-116

Frank Neven, Thomas Schwentick: Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999: 102-106

Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche: Adding For-Loops to First-Order Logic. ICDT 1999: 58-69

Frank Neven, Thomas Schwentick: Query Automata. PODS 1999: 205-214

Frank Neven: Structured Document Query Languages Based on Attribute Grammars: Locality and Non-Determinism. FMLDO 1998: 129-142

Frank Neven, Jan Van den Bussche: Expressiveness of Structured Document Query Languages Based on Attribute Grammars. PODS 1998: 11-17

Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen: Typed Query Languages for Databases Containing Queries. PODS 1998: 189-196

Frank Neven, Jan Van den Bussche: On Implementing Structured Document Query Facilities on Top of a DOOD. DOOD 1997: 351-367