Lennart C. L. Kats - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged graph-rewriting

The Spoofax language workbench: rules for declarative specification of languages and IDEsLennart C. L. Kats, Eelco Visser. OOPSLA 2010: 444-463 [doi]

The Third Rewrite Engines CompetitionFrancisco Durán, Manuel Roldán, Jean-Christophe Bach, Emilie Balland, Mark G. J. van den Brand, James R. Cordy, Steven Eker, Luc Engelen, Maartje de Jonge, Karl Trygve Kalleberg, Lennart C. L. Kats, Pierre-Etienne Moreau, Eelco Visser. WRLA 2010: 243-261 [doi]

Decorated Attribute Grammars: Attribute Evaluation Meets Strategic ProgrammingLennart C. L. Kats, Anthony M. Sloane, Eelco Visser. CC 2009: 142-157 [doi]

The Second Rewrite Engines CompetitionFrancisco Durán, Manuel Roldán, Emilie Balland, Mark G. J. van den Brand, Steven Eker, Karl Trygve Kalleberg, Lennart C. L. Kats, Pierre-Etienne Moreau, Ruslan Shevchenko, Eelco Visser. ENTCS, 238(3):281-291, 2009. [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]

Code Generation by Model TransformationZef Hemel, Lennart C. L. Kats, Eelco Visser. ICMT 2008: 183-198 [doi]

Wiener index of graphs with more than one cut-vertexR. Balakrishnan, N. Sridharan, K. Viswanathan Iyer. appml, 21(9):922-927, 2008. [doi]

Supporting Language Extension and Separate Compilation by Mixing Java and BytecodeLennart C. L. Kats. Master's thesis, Utrecht University, Utrecht, The Netherlands, August 2007.

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

Bytecode Rewriting in TomEmilie Balland, Pierre-Etienne Moreau, Antoine Reilles. ENTCS, 190(1):19-33, 2007. [doi]

Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised PapersMichael Kaufmann, Dorothea Wagner, editors, Volume 4372 of Lecture Notes in Computer Science, Springer, 2007.

On the reduction of Yutsis graphsDries Van Dyck, Veerle Fack. DM, 307(11-12):1506-1515, 2007. [doi]

Reducibility of gene patterns in ciliates using the breakpoint graphRobert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg. TCS, 356(1-2):26-45, 2006. [doi]

Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. TCS, 362(1-3):86-99, 2006. [doi]

Feasible Trace Reconstruction for Rewriting ApproximationsYohan Boichut, Thomas Genet. RTA 2006: 123-135 [doi]

Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and ConstructionBhawani Sankar Panda, Anita Das. endm, 27:79-80, 2006. [doi]

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

Multi-way spatial join selectivity for the ring join graphJun-Ki Min, Ho-Hyun Park, Chin-Wan Chung. INFSOF, 47(12):785-795, 2005. [doi]

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

Coloring graphs from lists with bounded size of their unionDaniel Král, Jiri Sgall. jgt, 49(3):177-186, 2005. [doi]

Hermitian matrices and graphs: singular values and discrepancyBéla Bollobás, Vladimir Nikiforov. DM, 285(1-3):17-32, 2004. [doi]

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

Canonical Graph ShapesArend Rensink. ESOP 2004: 401-415 [doi]

Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, ProceedingsRobert Nieuwenhuis, editor, Volume 2706 of Lecture Notes in Computer Science, Springer, 2003.

Associative-Commutative Rewriting on Large TermsSteven Eker. RTA 2003: 14-29 [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]

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]

Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. ifipTCS 2002: 83-94

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]

Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Philipp Woelfel, Stephan Waack. eccc, 8(073), 2001. [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.

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.

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]

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 96, Berkeley, California, USA, September 18-20, ProceedingsStephen C. North, editor, Volume 1190 of Lecture Notes in Computer Science, Springer, 1997.

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.

Counting H-free graphsHans Jürgen Prömel, Angelika Steger. DM, 154(1-3):311-315, 1996. [doi]

Uniform strong 2-cell imbeddings of bridgeless graphsBruce P. Mull, Dionysios Kountanis, Reza Rashidi. DM, 143(1-3):209-220, 1995. [doi]

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

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

Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, ProceedingsClaude Kirchner, editor, Volume 690 of Lecture Notes in Computer Science, Springer, 1993.

Efficient Implementation of Narrowing and RewritingMichael Hanus. pdk 1991: 344-365

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

Graph Reduction, Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29 - October 1, 1986Joseph H. Fasel, Robert M. Keller, editors, Volume 279 of Lecture Notes in Computer Science, Springer, 1987.

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]

runs on WebDSL