Tom Mens - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged rewriting

A case study to evaluate the suitability of graph transformation tools for program refactoringFrancisco Javier Pérez, Yania Crespo, Berthold Hoffmann, Tom Mens. STTT, 12(3-4):183-199, 2010. [doi]

Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, ProceedingsRalf Treinen, editor, Volume 5595 of Lecture Notes in Computer Science, Springer, 2009. [doi]

Bandwidth of the corona of two graphsToru Kojima. DM, 308(17):3770-3781, 2008. [doi]

Analysing refactoring dependencies using graph transformationTom Mens, Gabriele Taentzer, Olga Runge. SoSyM, 6(3):269-285, 2007. [doi]

Specifying Domain-Specific Refactorings for AndroMDA Based on Graph TransformationGabriele Taentzer, Dirk Müller 0002, Tom Mens. agtive 2008: 104-119 [doi]

Using Graph Transformation to Support Collaborative Ontology EvolutionPieter De Leenheer, Tom Mens. agtive 2008: 44-58 [doi]

Generation of Sierpinski Triangles: A Case Study for Graph Transformation ToolsGabriele Taentzer, Enrico Biermann, Dénes Bisztray, Bernd Bohnet, Iovka Boneva, Artur Boronat, Leif Geiger, Rubino Geiß, Ákos Horváth, Ole Kniemeyer, Tom Mens, Benjamin Ness, Detlef Plump, Tamás Vajk. agtive 2008: 514-539 [doi]

Dynamic Multilevel Graph VisualizationTodd L. Veldhuizen. corr, abs/0712.1549, 2007. [doi]

Graphing Kendall s tauMatthew K. Davis, Gemai Chen. csda, 51(5):2375-2378, 2007. [doi]

Evolution d Architectures à base de Composants par Transformation de GraphesTom Mens, Dalila Tamzalit. cal 2006: 171-172

On the Use of Graph Transformations for Model RefactoringTom Mens. GTTSE 2006: 219-257 [doi]

Applying a Model Transformation Taxonomy to Graph Transformation TechnologyTom Mens, Pieter Van Gorp, Dániel Varró, Gabor Karsai. ENTCS, 152:143-159, 2006. [doi]

Which claw-free graphs are strongly perfect?Hui-Yu Wang. DM, 306(19-20):2602-2629, 2006. [doi]

Detecting Structural Refactoring Conflicts Using Critical Pair AnalysisTom Mens, Gabriele Taentzer, Olga Runge. ENTCS, 127(3):113-128, 2005. [doi]

Formalizing refactorings with graph transformationsTom Mens, Niels Van Eetvelde, Serge Demeyer, Dirk Janssens. SMR, 17(4):247-276, 2005. [doi]

Aspect graphs for three-dimensional object recognition machine vision systemsTatiana Tambouratzis, Michael J. Wright. ijis, 20(1):47-72, 2005. [doi]

Workshop on Graph-Based ToolsTom Mens, Andy Schürr, Gabriele Taentzer. gg 2004: 439-441 [doi]

Finding hidden independent sets in interval graphsTCS, 310(1-3):287-307, 2004. [doi]

Superfluous edges and exponential expansions of De Bruijn and Kautz graphsEduardo A. Canale, José Gómez. DAM, 138(3):303-331, 2004. [doi]

Lower Bounds for General Graph-Driven Read-Once Parity Branching ProgramsHenrik Brosenne, Matthias Homeister, Stephan Waack. mfcs 2003: 290-299 [doi]

Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching ProgramsMatthias Homeister. eccc, (068), 2003. [doi]

A Graph-Based Metamodel for Object-Oriented Software MetricsTom Mens, Michele Lanza. ENTCS, 72(2):57-68, 2002. [doi]

Workshop on Graph-Based ToolsTom Mens, Andy Schürr, Gabriele Taentzer. gg 2002: 440-444 [doi]

Graph-Based Tools (GraBaTs 2002)Tom Mens, Andy Schürr, Gabriele Taentzer. ENTCS, 72(2):11-13, 2002. [doi]

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDsHenrik Brosenne, Matthias Homeister, Stephan Waack. ita, 36(3):229-247, 2002. [doi]

Neighbourhood Graphs of Cayley Graphs for Finitely-generated GroupsMarkus Neuhauser. ejc, 23(6):733-740, 2002. [doi]

Drawing Graphs on the TorusWilliam Kocay, Daniel Neilson, Ryan Szypowski. arscom, 59, 2001.

Graph-Driven Free Parity BDDs: Algorithms and Lower BoundsHenrik Brosenne, Matthias Homeister, Stephan Waack. mfcs 2001: 212-223 [doi]

Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, ProceedingsJoe Marks, editor, Volume 1984 of Lecture Notes in Computer Science, Springer, 2001.

Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency GraphsJosep Lladós, Enric Martí, Juan José Villanueva. pami, 23(10):1137-1143, 2001. [doi]

Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, ProceedingsLeo Bachmair, editor, Volume 1833 of Lecture Notes in Computer Science, Springer, 2000.

Conditional Graph Rewriting as a Domain-Independent Formalism for Software EvolutionTom Mens. agtive 2000: 127-143 [doi]

Embedding Graphs into a Three Page Book with ::::O::::(::::m:::: log ::::n::::) Crossings of Edges over the SpineHikoe Enomoto, Miki Shimabara Miyauchi. siamdm, 12(3):337-341, 1999. [doi]

Tenth Spectral Moment for Molecular Graphs of PhenylenesSvetlana Markovic. jcisd, 39(4):654-658, 1999. [doi]

Neighborhood conditions for balanced independent sets in bipartite graphsDenise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz. DM, 181(1-3):31-36, 1998. [doi]

Within ARM s Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite SystemsWan Fokkink, Jasper Kamperman, Pum Walters. TOPLAS, 20(3):679-706, 1998. [doi]

on Global Dynamics of Optimal Graph ReductionJulia L. Lawall, Harry G. Mairson. ICFP 1997: 188-195

Graph Drawing, Symposium on Graph Drawing, GD 95, Passau, Germany, September 20-22, 1995, ProceedingsFranz-Josef Brandenburg, editor, Volume 1027 of Lecture Notes in Computer Science, Springer, 1996.

On m-centers in P::t::-free graphsOdile Favaron, Jean-Luc Fouquet. DM, 125(1-3):147-152, 1994. [doi]

A probabilistic upper bound for the edge identification complexity of graphsEberhard Triesch. DM, 125(1-3):371-376, 1994. [doi]

Primitivity and Ends of GraphsRögnvaldur G. Möller. combinatorica, 14(4):477-484, 1994.

Graph TypesNils Klarlund, Michael I. Schwartzbach. POPL 1993: 196-205

Correspondence between Sylvester, Petersen, Hilbert and Klein on invariants and the factorisation of graphs 1889-1891Gert Sabidussi. DM, 100(1-3):99-155, 1992. [doi]

International Conference on Rewriting Techniques and ApplicationsRonald V. Book, editor, Volume 488 of Lecture Notes in Computer Science, Springer, Como, Italy, April 1991. [doi]

The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer NetworkHugh Kingdon, David R. Lester, Geoffrey L. Burn. cj, 34(4):290-301, 1991.

Inequalities between the domination number and the chromatic number of a graphDieter Gernert. DM, 76(2):151-153, 1989. [doi]

On the number of induced subgraphs of a random graphHiroshi Maehara. DM, 64(2-3):309-312, 1987. [doi]

When m vertices in a k-connected graph cannot be walked round along a simple cycleAlexander K. Kelmans, M. V. Lomonosov. DM, 38(2-3):317-322, 1982. [doi]

Twofold Triple Systems and Graph ImbeddingsSeth R. Alpert. JCT, 18(1):101-107, 1975.

Applying a Model Transformation Taxonomy to Graph Transformation TechnologyTom Mens, Pieter Van Gorp, Daniel Varró, Gabor Karsai. In Proceedings of the International Workshop on Graph and Model Transformation (GraMoT 2005). :

runs on WebDSL