David Harel - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged 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]

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.

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]

One-dimensional layout optimization, with applications to graph drawing by axis separationYehuda Koren, David Harel. comgeo, 32(2):115-138, 2005. [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]

Combining Hierarchy and Energy Drawing Directed GraphsLiran Carmel, David Harel, Yehuda Koren. tvcg, 10(1):46-57, 2004. [doi]

Graph Drawing by High-Dimensional EmbeddingDavid Harel, Yehuda Koren. jgaa, 8(2):195-214, 2004. [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]

On the Visualization and Aesthetics of Large Graphs: Short AbstractDavid Harel. ershov 2003: 120 [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]

Graph Drawing by High-Dimensional EmbeddingDavid Harel, Yehuda Koren. gd 2002: 207-219 [doi]

ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge GraphsYehuda Koren, Liran Carmel, David Harel. infovis 2002: 137-144 [doi]

A Fast Multi-Scale Method for Drawing Large GraphsDavid Harel, Yehuda Koren. jgaa, 6(3):179-202, 2002. [doi]

Drawing Directed Graphs Using One-Dimensional OptimizationLiran Carmel, David Harel, Yehuda Koren. gd 2002: 193-206 [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

A multi-scale algorithm for drawing graphs nicelyRonny Hadany, David Harel. DAM, 113(1):3-21, 2001.

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.

A Fast Multi-Scale Method for Drawing Large GraphsDavid Harel, Yehuda Koren. avi 2000: 282-285

A Fast Multi-scale Method for Drawing Large GraphsDavid Harel, Yehuda Koren. gd 2001: 183-196 [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.

A Multi-Scale Algorithm for Drawing Graphs NicelyRonny Hadany, David Harel. criwg 1999: 262-277 [doi]

An Algorithm for Straight-Line Drawing of Planar GraphsDavid Harel, Meir Sardas. algorithmica, 20(2):119-135, 1998.

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.

Drawing Graphs Nicely Using Simulated AnnealingRon Davidson, David Harel. tog, 15(4):301-331, 1996. [doi]

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.

Randomized Graph Drawing with Heavy-Duty PreprocessingDavid Harel, Meir Sardas. JCL (JVLC), 6(3):233-253, 1995.

Randomized Graph Drawing with Heavy-Duty PreprocessingDavid Harel, Meir Sardas. avi 1994: 19-33 [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.

Hamiltonian Paths in Infinite GraphsDavid Harel. stoc 1991: 220-229

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.

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