| 2013 |
|---|
| 84 | Definability problems for graph query languages. Timos Antonopoulos, Frank Neven, Frédéric Servais. ICDT 2013, 141-152. Web SearchBibTeXDownload |
| 83 | Generating, Sampling and Counting Subclasses of Regular Tree Languages. Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven. Theory Comput. Syst. (52): 542-585 (2013). Web SearchBibTeXDownload |
| 2012 |
|---|
| 82 | Succinctness of the Complement and Intersection of Regular Expressions. Wouter Gelade, Frank Neven. ACM Trans. Comput. Log. (13): 4 (2012). Cited by 21Web SearchBibTeXDownload |
| 81 | Deciding twig-definability of node selecting tree automata. Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven. ICDT 2012, 61-73. Web SearchBibTeXDownload |
| 80 | Developing and Analyzing XSDs through BonXai. Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick. PVLDB (5): 1994-1997 (2012). Web SearchBibTeXDownload |
| 2011 |
|---|
| 79 | Generating, sampling and counting subclasses of regular tree languages. Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven. ICDT 2011, 30-41. Web SearchBibTeXDownload |
| 78 | SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks. Peter Boyen, Dries Van Dyck, Frank Neven, Roeland C. H. J. van Ham, Aalt D. J. van Dijk. IEEE/ACM Trans. Comput. Biology Bioinform. (8): 1344-1357 (2011). Web SearchBibTeXDownload |
| 77 | Succinctness of pattern-based schema languages for XML. Wouter Gelade, Frank Neven. J. Comput. Syst. Sci. (77): 505-519 (2011). Web SearchBibTeXDownload |
| 76 | Relational transducers for declarative networking. Tom Ameloot, Frank Neven, Jan Van den Bussche. PODS 2011, 283-292. Web SearchBibTeXDownload |
| 75 | The complexity of text-preserving XML transformations. Timos Antonopoulos, Wim Martens, Frank Neven. PODS 2011, 247-258. Web SearchBibTeXDownload |
| 74 | 30 Years of PODS in facts and figures. Tom J. Ameloot, Maarten Marx, Wim Martens, Frank Neven, Justin van Wees. SIGMOD Record (40): 54-60 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 73 | Inference of concise regular expressions and DTDs. Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren. ACM Trans. Database Syst. (35) (2010). Web SearchBibTeXDownload |
| 72 | Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren. CoRR (abs/1004.2372) (2010). Web SearchBibTeXDownload |
| 71 | Relational transducers for declarative networking. Tom Ameloot, Frank Neven, Jan Van den Bussche. CoRR (abs/1012.2858) (2010). Web SearchBibTeXDownload |
| 70 | Optimizing the Region Algebra is PSPACE-complete. Wouter Gelade, Frank Neven. Inf. Process. Lett. (110): 639-643 (2010). Web SearchBibTeXDownload |
| 69 | Simplifying XML schema: single-type approximations of regular tree languages. Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven. PODS 2010, 251-260. Web SearchBibTeXDownload |
| 2009 |
|---|
| 68 | XML Types. Frank Neven. Encyclopedia of Database Systems 2009, 3650-3654. Web SearchBibTeXDownload |
| 67 | SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks. Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan van Dijk, Roeland C. H. J. van Ham. ICDM 2009, 716-721. Web SearchBibTeXDownload |
| 66 | Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. Wouter Gelade, Wim Martens, Frank Neven. SIAM J. Comput. (38): 2021-2043 (2009). Cited by 21Web SearchBibTeXDownload |
| 65 | Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. Wim Martens, Frank Neven, Thomas Schwentick. SIAM J. Comput. (39): 1486-1530 (2009). Web SearchBibTeXDownload |
| 64 | Simplifying XML schema: effortless handling of nondeterministic regular expressions. Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven. SIGMOD Conference 2009, 731-744. Cited by 1Web SearchBibTeXDownload |
| 2008 |
|---|
| 63 | Expressiveness and complexity of XML publishing transducers. Wenfei Fan, Floris Geerts, Frank Neven. ACM Trans. Database Syst. (33) (2008). Cited by 4Web SearchBibTeXDownload |
| 62 | BioScout: a life-science query monitoring system. Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen. EDBT 2008, 730-734. Cited by 3Web SearchBibTeXDownload |
| 61 | Typechecking top-down XML transformations: Fixed input or output schemas. Wim Martens, Frank Neven, Marc Gyssens. Inf. Comput. (206): 806-827 (2008). Cited by 2Web SearchBibTeXDownload |
| 60 | Deterministic top-down tree automata: past, present, and future. Wim Martens, Frank Neven, Thomas Schwentick. Logic and Automata 2008, 505-530. Web SearchBibTeX |
| 59 | Complexity and composition of synthesized web services. Wenfei Fan, Floris Geerts, Wouter Gelade, Frank Neven, Antonella Poggi. PODS 2008, 231-240. Cited by 4Web SearchBibTeXDownload |
| 58 | Scalable multi-query optimization for exploratory queries over federated scientific databases. Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen, Stijn Vansummeren. PVLDB (1): 16-27 (2008). Cited by 6Web SearchBibTeXDownload |
| 57 | SchemaScope: a system for inferring and cleaning XML schemas. Geert Jan Bex, Frank Neven, Stijn Vansummeren. SIGMOD Conference 2008, 1259-1262. Cited by 4Web SearchBibTeXDownload |
| 56 | Succinctness of the Complement and Intersection of Regular Expressions. Wouter Gelade, Frank Neven. STACS (abs/0802.2869): 325-336 (2008). Cited by 21Web SearchBibTeXDownload |
| 55 | Learning deterministic regular expressions for the inference of schemas from XML data. Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren. WWW 2008, 825-834. Cited by 13Web SearchBibTeXDownload |
| 2007 |
|---|
| 54 | Logical definability and query languages over ranked and unranked trees. Michael Benedikt, Leonid Libkin, Frank Neven. ACM Trans. Comput. Log. (8) (2007). Cited by 8Web SearchBibTeXDownload |
| 53 | Succinctness of Pattern-Based Schema Languages for XML. Wouter Gelade, Frank Neven. DBPL 2007, 201-215. Cited by 5Web SearchBibTeXDownload |
| 52 | Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. Wouter Gelade, Wim Martens, Frank Neven. ICDT 2007, 269-283. Cited by 21Web SearchBibTeXDownload |
| 51 | Frontiers of tractability for typechecking simple XML transformations. Wim Martens, Frank Neven. J. Comput. Syst. Sci. (73): 362-390 (2007). Cited by 50Web SearchBibTeXDownload |
| 50 | Expressiveness and complexity of xml publishing transducers. Wenfei Fan, Floris Geerts, Frank Neven. PODS 2007, 83-92. Web SearchBibTeXDownload |
| 49 | Simple off the shelf abstractions for XML schema. Wim Martens, Frank Neven, Thomas Schwentick. SIGMOD Record (36): 15-22 (2007). Cited by 5Web SearchBibTeXDownload |
| 48 | Inferring XML Schema Definitions from XML Data. Geert Jan Bex, Frank Neven, Stijn Vansummeren. VLDB 2007, 998-1009. Cited by 29Web SearchBibTeXDownload |
| 2006 |
|---|
| 47 | Expressiveness and complexity of XML Schema. Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex. ACM Trans. Database Syst. (31): 770-813 (2006). Cited by 57Web SearchBibTeXDownload |
| 46 | On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas. Wim Martens, Frank Neven, Marc Gyssens. CoRR (abs/cs/0606094) (2006). Web SearchBibTeXDownload |
| 45 | An Extensible Light-Weight XML-Based Monitoring System for Sequence Databases. Dieter Van de Craen, Frank Neven, Kerstin Koch. DILS 2006, 280-296. Cited by 2Web SearchBibTeXDownload |
| 44 | Optimizing Monitoring Queries over Distributed Data. Frank Neven, Dieter Van de Craen. EDBT 2006, 829-846. Cited by 5Web SearchBibTeXDownload |
| 43 | On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Frank Neven, Thomas Schwentick. Logical Methods in Computer Science (2) (2006). Cited by 27Web SearchBibTeXDownload |
| 42 | Inference of Concise DTDs from XML Data. Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls. VLDB 2006, 115-126. Cited by 52Web SearchBibTeXDownload |
| 2005 |
|---|
| 41 | 05061 Summary - Foundations of Semi-structured Data. Frank Neven, Thomas Schwentick, Dan Suciu. Foundations of Semistructured Data 2005. Web SearchBibTeXDownload |
| 40 | 05061 Abstracts Collection - Foundations of Semistructured Data. Frank Neven, Thomas Schwentick, Dan Suciu. Foundations of Semistructured Data 2005. Web SearchBibTeXDownload |
| 39 | Which XML Schemas Admit 1-Pass Preorder Typing?. Wim Martens, Frank Neven, Thomas Schwentick. ICDT 2005, 68-82. Cited by 25Web SearchBibTeXDownload |
| 38 | Attribute grammars for unranked trees as a query language for structured documents. Frank Neven. J. Comput. Syst. Sci. (70): 221-257 (2005). Cited by 6Web SearchBibTeXDownload |
| 37 | On the complexity of typechecking top-down XML transformations. Wim Martens, Frank Neven. Theor. Comput. Sci. (336): 153-180 (2005). Cited by 28Web SearchBibTeXDownload |
| 36 | Expressiveness of XSDs: from practice to theory, there and back again. Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick. WWW 2005, 712-721. Web SearchBibTeXDownload |
| 2004 |
|---|
| 35 | Finite state machines for strings over infinite alphabets. Frank Neven, Thomas Schwentick, Victor Vianu. ACM Trans. Comput. Log. (5): 403-435 (2004). Cited by 61Web SearchBibTeXDownload |
| 34 | Complexity of Decision Problems for Simple Regular Expressions. Wim Martens, Frank Neven, Thomas Schwentick. MFCS 2004, 889-900. Cited by 43Web SearchBibTeXDownload |
| 33 | Frontiers of Tractability for Typechecking Simple XML Transformations. Wim Martens, Frank Neven. PODS 2004, 23-34. Web SearchBibTeXDownload |
| 32 | DTDs versus XML Schema: A Practical Study. Geert Jan Bex, Frank Neven, Jan Van den Bussche. WebDB 2004, 79-84. Cited by 85Web SearchBibTeXDownload |
| 2003 |
|---|
| 31 | Typechecking XML views of relational databases. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. ACM Trans. Comput. Log. (4): 315-354 (2003). Cited by 48Web SearchBibTeXDownload |
| 30 | Typechecking Top-Down Uniform Unranked Tree Transducers. Wim Martens, Frank Neven. ICDT 2003, 64-78. Cited by 48Web SearchBibTeXDownload |
| 29 | XPath Containment in the Presence of Disjunction, DTDs, and Variables. Frank Neven, Thomas Schwentick. ICDT 2003, 312-326. Cited by 180Web SearchBibTeXDownload |
| 28 | On the power of tree-walking automata. Frank Neven, Thomas Schwentick. Inf. Comput. (183): 86-103 (2003). Cited by 41Web SearchBibTeXDownload |
| 27 | XML with data values: typechecking revisited. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. J. Comput. Syst. Sci. (66): 688-727 (2003). Web SearchBibTeXDownload |
| 26 | Logical Definability and Query Languages over Unranked Trees. Leonid Libkin, Frank Neven. LICS 2003, 178-187. Cited by 6Web SearchBibTeXDownload |
| 25 | Reminiscences on Influential Papers. Kenneth A. Ross, Amr El Abbadi, Sophie Cluet, Kaladhar Voruganti, Guy M. Lohman, Moshe Y. Vardi, Gultekin Özsoyoglu, Gerhard Weikum, Philip S. Yu, Timos K. Sellis, Patrick Valduriez. SIGMOD Record (32): 104-105 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 24 | Automata, Logic, and XML. Frank Neven. CSL 2002, 2-26. Cited by 126Web SearchBibTeXDownload |
| 23 | A formal model for an expressive fragment of XSLT. Geert Jan Bex, Sebastian Maneth, Frank Neven. Inf. Syst. (27): 21-39 (2002). Cited by 109Web SearchBibTeXDownload |
| 22 | Expressiveness of structured document query languages based on attribute grammars. Frank Neven, Jan Van den Bussche. J. ACM (49): 56-100 (2002). Cited by 87Web SearchBibTeXDownload |
| 21 | On the Power of Walking for Querying Tree-Structured Data. Frank Neven. PODS 2002, 77-84. Cited by 22Web SearchBibTeXDownload |
| 20 | Automata Theory for XML Researchers. Frank Neven. SIGMOD Record (31): 39-46 (2002). Cited by 145Web SearchBibTeXDownload |
| 19 | Query automata over finite trees. Frank Neven, Thomas Schwentick. Theor. Comput. Sci. (275): 633-674 (2002). Cited by 140Web SearchBibTeXDownload |
| 2001 |
|---|
| 18 | Adding For-Loops to First-Order Logic. Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche. Inf. Comput. (168): 156-186 (2001). Cited by 3Web SearchBibTeXDownload |
| 17 | Typechecking XML Views of Relational Databases. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. LICS 2001, 421-430. Web SearchBibTeXDownload |
| 16 | Towards Regular Languages over Infinite Alphabets. Frank Neven, Thomas Schwentick, Victor Vianu. MFCS 2001, 560-572. Cited by 31Web SearchBibTeXDownload |
| 15 | XML with Data Values: Typechecking Revisited. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. PODS 2001. Cited by 96Web SearchBibTeXDownload |
| 14 | Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Frank Neven, Thomas Schwentick. Semantics in Databases 2001, 160-178. Cited by 19Web SearchBibTeXDownload |
| 2000 |
|---|
| 13 | A Formal Model for an Expressive Fragment of XSLT. Geert Jan Bex, Sebastian Maneth, Frank Neven. Computational Logic 2000, 1137-1151. Web SearchBibTeXDownload |
| 12 | On the Power of Tree-Walking Automata. Frank Neven, Thomas Schwentick. ICALP 2000, 547-560. Web SearchBibTeXDownload |
| 11 | Expressive and Efficient Pattern Languages for Tree-Structured Data. Frank Neven, Thomas Schwentick. PODS 2000, 145-156. Cited by 78Web SearchBibTeXDownload |
| 1999 |
|---|
| 10 | Extensions of Attribute Grammars for Structured Document Queries. Frank Neven. DBPL 1999, 99-116. Cited by 52Web SearchBibTeXDownload |
| 9 | Structured Document Transformations Based on XSL. Sebastian Maneth, Frank Neven. DBPL 1999, 80-98. Cited by 50Web SearchBibTeXDownload |
| 8 | Automata for Unary Queries on Trees. Frank Neven, Thomas Schwentick. Grundlagen von Datenbanken 1999, 102-106. Web SearchBibTeX |
| 7 | Adding For-Loops to First-Order Logic. Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche. ICDT 1999, 58-69. Cited by 3Web SearchBibTeXDownload |
| 6 | Typed Query Languages for Databases Containing Queries. Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen. Inf. Syst. (24): 569-595 (1999). Cited by 17Web SearchBibTeXDownload |
| 5 | Query Automata. Frank Neven, Thomas Schwentick. PODS 1999, 205-214. Web SearchBibTeXDownload |
| 1998 |
|---|
| 4 | Structured Document Query Languages Based on Attribute Grammars: Locality and Non-Determinism. Frank Neven. FMLDO 1998, 129-142. Web SearchBibTeX |
| 3 | Expressiveness of Structured Document Query Languages Based on Attribute Grammars. Frank Neven, Jan Van den Bussche. PODS 1998, 11-17. Cited by 1Web SearchBibTeXDownload |
| 2 | Typed Query Languages for Databases Containing Queries. Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen. PODS 1998, 189-196. Cited by 17Web SearchBibTeXDownload |
| 1997 |
|---|
| 1 | On Implementing Structured Document Query Facilities on Top of a DOOD. Frank Neven, Jan Van den Bussche. DOOD 1997, 351-367. Cited by 8Web SearchBibTeXDownload |
