Daniel Varró - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged graph-rewriting

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]

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]

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

New Regular Partial Difference Sets and Strongly Regular Graphs with Parameters (96, 20, 4, 4) and (96, 19, 2, 4)Anka Golemac, Josko Mandic, Tanja Vucicic. combinatorics, 13(1), 2006. [doi]

Aspect graphs for three-dimensional object recognition machine vision systemsTatiana Tambouratzis, Michael J. Wright. ijis, 20(1):47-72, 2005. [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]

Register Allocation by Optimal Graph ColoringChristian Andersson. cc 2003: 33-45 [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]

The effects of metacognition and email interactions on learning graphingBracha Kramarski, R. Ritkof. jcal, 18(1):33-43, 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]

Solving the Word Problem for Two Classes of Non-associative Rings by RewritingAlfred Widiger. JSC, 32(3):291-301, 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.

The Strongly Regular (40, 12, 2, 4) GraphsEdward Spence. combinatorics, 7, 2000. [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]

Efficient sorting on the star graph interconnection networkSelim G. Akl, Tanya Wolff. telsys, 10(1):3-20, 1998.

Live Range Splitting in a Graph Coloring Register AllocatorKeith D. Cooper, L. Taylor Simpson. CC 1998: 174-187

Basic-Block Graphs: Living Dinosaurs?CC 1998: 65-79

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

Regularities on the Cayley Graphs of Groups of Linear GrowthRoberto Incitti. ejc, 18(2):175-178, 1997. [doi]

Fault Tolerant Algorithms for Broadcasting on the Star Graph NetworkN. W. Lo, Bradley S. Carlson, D. L. Tao. TC, 46(12):1357-1362, 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.

Characterization of Laborde-Mulder graphs (extended odd graphs)Rafaï Mourad Madani. DM, 150(1-3):293-301, 1996. [doi]

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.

Reduction of Visual Complexity in Dynamic GraphsDoug Kimelman, Bruce Leban, Tova Roth, Dror Zernik. gd 1995: 218-225

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.

Newtonian graphs for families of complex polynomialsJeremy A. Kahn. jc, 7(4):425-442, 1991. [doi]

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]

A Separator Theorem for Graphs of Bounded GenusJohn R. Gilbert, Joan P. Hutchinson, Robert Endre Tarjan. jal, 5(3):391-407, 1984.

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]

On reconstructing graphs from their sets of subgraphsBennet Manvel. JCT, 21(2):156-165, 1976. [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