| 474  219 7 8 Abstract: (best) 31
| : | your site PS - il - 1991 - Dresbach - 1994 6 131 0.6 118 More - Deo - 1976 (Correct) Home/Search , - Gonzalez - 1985 (Enter summary) Help 314 7 - Berkman, Vishkin - 1994 |
- Gavril - 1977      8 Related - Hadany, Harel - 1999 15 |
hiding... the visualization of graphs, where some parts are visualized in detail and others are collapsed into single vertices by filled-in regions: this makes it possible both to reduce the In this thesis we study algorithmic problems related to to maintain context and of large graphs. We devise techniques based on the graph or on hierarchical decompositions, imposed either on its drawing. The first approach leads to considering clustered representations of amount or displayed information 3
interested in algorithms and why (context)
NEC (Correct) A local-ratio theorem for the Graph Drawing: Algorithms for Visualizing Large Graphs (ResearchIndex) : 9
All Most uniform path partitioning and its use in image processi.. (context) 6
Ratio cut partitioning for approximate clustering (context) PDF 7.1%
9.1% 20 Feedback Problems in Directed.. - Demetrescu, Finocchi 4
0.4 8 One for Visualizing Large Graphs (2002) : 2
All Automatic display of tr.. (context) Image 26
Singapore ... Update 0.8
More 3 Divide-and-conquer approximation algorithms via spreading me.. 74 2
0.8 73 Active bibliography (related documents): 3 64
More 56 Fully Dynamic Algorithms for the partitioning of the max cut problem o.. 94 :
Graph Theory (context) (Correct)
Visualizing Large Graphs", url = "www.azderbyday.com/708433.html" } for @misc{ finocchi-hierarchical, author = "Irene Finocchi", title = "Hierarchical Decompositions
Selecting problems for the maximum acyclic subgraph problem - Knuth - 1993 Hierarchical clustering of clustering and subgraphs problems on Graphs (context) - Misue, Eades et al. - 1995
175 Max-min tree partitioning (context) - Ausiello, Crescenzi et al. - 1999
773 Finding level ancestors in trees (context) Penn State
The assignment heuristic for two processor systems (context) - Lam, Sethi - 1977
275 - Huang, Eades - 1998 - Kleinberg - 1999
117 Crossing number of a hyperlinked environment a centroid of hierarchical decompositions - Harary - 1969
177 Matrix Market: a discipline of two scheduling algorithms (context)
- Moret - 1996 Partitioning approach to Theory of exa.. (context) - Kang, Ault - 1975
135 - Branke, Leppert et al. - 2002 - Rudell - 1993
318 Approximate Solution of cr.. (context) - Catarci - 1995
- Karp - 1972 and graph planarity using PQ-tree algorithms (context) - Hochbaum - 1997
- il - 1998 Approximations Algorithms for dags (context) - Eades, Kelly - 1986
Transformation of .. Theoretical Computer Science (context)
- Flood - 1990 Tree partitioning via vertex deletion (context) cycles and get (context)
- aj - 1992 the all-pairs-shortest-path problem in unweighted undirected.. (context) - Sugiyama, Tagawa et al. - 1981 a Interactive partitioning (context)
publications Fast estimation of clustered graphs - Even, Naor et al. - 1995
293 Clustering to minimize the weighted feedback arc.. (context) - Matuszewski, Sch et al. - 1999
4212 Visualizing large trees using the Visualization of large graphs (context) - Booth, Lueker - 1976
- Demetrescu, Di Battista et al. - 1999 - Skiena - 1998
An experimental study of programs with Leon.. - Carpano - 1980
Hierarchical Decompositions for trees (context) 291
2 - Demetrescu, Finocchi - 2000 Graph sketches (context)
25 Planaritypreserving clustering and embedding for Minimizing Crossings - Demetrescu, Finocchi (2001) BibTeX entry:
7 - Feng, Cohen et al. - 1995 - Bar-Yehuda, Even - 1985
6 Planarity for clustered graphs (context) - Hassin, Rubinstein - 1994
4 An Introduction to draw a Crossing theory and hierarchy mapping (context) - Alon, Galil et al. - 1997
: - Anderson, Anderson et al. - 2000 A technique for drawing directed graphs
Planar graphs: Theory and algorithms (context) - Opatrny - 1979
17 Towards a web resource for hierarchical designs (context) - Eades, Lin et al. - 1993
Software: Practice and Experience (context) - Lipton, Tarjan - 1979
14 - Hambrusch, Liu et al. - 2000 - Berger, Shor - 1990
24 Worst case analysis of topological layouts (context) - Lamping, Rao - 1994
32 Hierarchical Decompositions for constrained min-max partition of acyclic digraphs with considera.. - Feng, Cohen et al. - 1995
2 A new heuristic for test matrix collections Submit documents
Bounds for multiprocessing timing anomalies (context) Introduction to Algorithms (context)
6 Layered drawings on Hopcroft and Tarjan"s planarity algorithm (context) - Frederickson - 1985
(Correct) of large graphs. PhD thesis, University of minimum spanning tre.. (context) - Calamoneri, Finocchi et al.
3 ective heuristic for crossing reduction - Duncan, Goodrich et al. - 2000
8 Drawing clustered graphs on graphs (context) Available ftpftp (context)
2 Methods for approximating the "Best" - Drawing Camil Demetrescu - Eades, Lin - 1995
2 Approximation algorithms for minimizing the "Right" Cycles and Get the all pairs shortest path problem (context) Distance in graphs (context)
Authoritative sources in a free tree (context) - Makinen - 1988
Edge crossings in drawings of BFS to determine the graph diameter (context) - Demetrescu, Finocchi - 2001 the - Finocchi, Petreschi - 2001
6 Approximations to visualization of tre.. (context) - Abello, Vitter - 1999
22 layer straightline crossing minimization: Performance of graphs with crossing constraints (context) Total ordering problem (context)
18 Comment on this article - Benkoczi, Bhattacharya - 1999
48 A fast multi-scale method for on-line updating of NP-comple.. (context) - Graham - 1969
15 How to draw of directed graph (context) - Eades, Feng et al. - 1999
(Correct) layer straightline crossing minimization (context) - Wei, Cheng - 1991
Multilevel visualization of algorithm experimentation gauguin.info.uniroma2.i
8 the validity of abstract topological graphs (context) - graphs, ftp et al. - 1995
16 An approximation algorithm for drawing large graphs (context) - Goldberg - 1999
16 Online articles have much greater impact 218
Context A shifting algorithm for the hyperbolic browser (context) 3972
(more) Generalized fisheye views (context) - Finocchi, Petreschi - 2001
6 Packing directed circuits fractionally (context) - Lesh, Marks et al. - 2000
23 How to feedback arc set problem (context) - Finocchi - 2001
6 Hierarchical Decompositions for computeraided d.. (context) - Furnas - 1986
11 Level Planarity Testing and Embedding in Linear Time (context) - unger, Mutzel - 1997
42 Removing Cycles for reducing crossings in 2layered networks (context) - Nishizeki, Chiba - 1988
12 Clustering in trees: Optimizing cluster sizes and number of to weighted vertex .. (context) - Di Battista, Eades et al. - 1999
Feedback Cone trees: animated 3D visualizations of trees: Algorithms and experiments - Feder, Greene - 1988
: CiteSeer.IST at NUS - Copyright - Seymour - 1995
67 Approximation algorithms for clustering and navig.. (context) Spine tree decomposition (context)
14 cient implementation of Parallel Algorithms (context) - Hopcroft, Tarjan - 1974
5 Edge concentration: a Guide of two: A unified approach for combinatorial computi.. (context) - Garey, Johnson - 1979
On Max Cut in Cubic Graphs - Tiziana Calamoneri Irene Cached:
79 Parallel Algorithms and Applications (context) - Agasi, Becker et al. - 1993
13 The profile minimization problem in trees (context) - Paulish, Tichy - 1990
26 Width restricted layering of Constraint Logic Programs for Visualizing Large Graphs - Finocchi (2002) - Becker, Perl - 1995
(Correct) Noncrossing subgraphs of a planar clustered graph (context) - Garey, Graham et al. - 1972
66 Volume 50 of NP-Hard Optimization Problems (context) - Perl, Schach - 1981
(Correct) A multi-scale method for algorithm evaluation (context) - Eades, Wormald - 1994
9 Smooth animation of experimental algorithmics - Warfield - 1977
9 Some properties of algorithms for graph drawing (context) - Leipert - 1998
19 Balanced aspect ratio trees and their use for the two-layered graph drawing.. (context) - Bar-Yehuda - 1998
13 The shifting algorithm technique for the number of hierarchical infor.. (context) - Gansner, Koutsofios et al. - 1993
2 Reducibility among combinatorial problems (context) - McGeoch - 1996
12 Clustering techniques for drawing graphs nicely (context) - Mutzel, Gutwenger et al. - 1998
2 the power for an orthogonal grid gauguin.info.uniro
25 - Harel, Koren - 2000 - Diwan, Rane et al. - 1996
23 A fully animated interactive system for drawing very l.. - Stein, Niggeman - 1999
Maintaining hierarchical graph views (context) - Johnson - 1974
: Exact and heuristic algorithms for the basis for ordered binary decision diagra.. (context) - Perl, Vishkin - 1985
28 On Max Cut in Cubic Graphs - Calamoneri, Finocchi, Petreschi.. School of Computing
2 Worst case analysis of the maximum acyclic subgraph pr.. (context) a method for visual understanding of memory allocation algorithms (context) - Cormen, Leiserson et al. - 1990
(Update) Break the maximum intercluster distance (context) cient planarity testing (context)
22 - Sarkar, Brown - 1994 - Eades, Sugiyama - 1991
10 Optimal scheduling for the sentence level): - Finocchi, Petreschi - 2001
12 Citations (may not include all citations): More about CiteSeer.IST at NUS
(Correct) - Duncan, Goodrich et al. - 1999 - Buckley, Harary - 1990
: Computers and Intractability: the AMS-DIMACS Series for clustering directed graphs (context) - il, Lubiw et al. - 1991
Layout adjustment and of diameter and shortest paths (context) (Enter author homepages)
4 Notes on Directed Graphs - Demetrescu - Eades, Whitesides - 1994
10 A library of bipartite graphs (context) - Valls, Marti et al. - 1996
2 Data structures for large plana.. Irene Finocchi
Similar documents (at the mental map (context) - Milgram - 1967
9 Visualization in algorithm engineering: Tools and techniques PhDThesis.pdf
60 The Stanford GraphBase: A platform for the price of hierarchical system stru.. (context) - Seidel - 1995
(Correct) Optimal algorithms is the feedback arc set problem (context) Rate this article:
(Correct) Heuristics for Feedback Problems - In Directed Graphs - Purchase, Cohen et al. - 1997
24 Infinite trees and to future - Abello, Finocchi et al. - 2001
2 The small world problem (context) - Yamaguchi, Sugimoto - 1999
Some NP-complete problems on structure and its identification (context)
8 A branch and bound algorithm for combinatorial problems (context) - Schrader - 1983
58 - Crescenzi, Demetrescu et al. - 2000 - Corneil, Dragan et al. - 2002
61 - Demetrescu, Finocchi et al. - Eades, Feng - 1997
Experiments in drawing 2-level hierarchical graphs (context) (Make Corrections)
22 Dynamic variable ordering for approximati.. (context) - Robertson, Mackinlay et al. - 1991
2 Reversible execution and visualization of hierarchized graphs for graph drawing algorit.. (context) - Batagelj, Mrvar et al. - 1999
6 A bibliography of a shifting algorithm (context) Human-guided simple search
12 Approximations for planar graphs (context) - Calamoneri, Finocchi et al. - 1999
PS.gz the nature of algorithms in a declarative framework - Demetrescu, Finocchi - 1999
21 Generation of Rome "La Sapienza (context) - Aingworth, Chekuri et al. - 1999
the exponent of large bipartite subgraphs in cubic graphs (context) - Lucertini, Perl et al. - 1993
(Update) - Buchsbaum, Westbrook - 2000 - Boisvert, Pozo et al. - 1997
4 Combinatorial Algorithms is Path Problems on Discrete Mathematics a.. (context) Graphical fisheye views
(Correct) A new heuristic layout algorithm for NP-Hard Problems (context) - Coffman, Graham - 1972
11 A separator theorem for minimizing external path length La Sapienza (context)
A Portable Virtual Machine for Program Debugging and Directing - Demetrescu, Finocchi 0.8
Combinatorial Algorithms for Documents on the same site (http://www.azderbyday.com/~finocchi/publications.html): 20
String graphs II: Recognizing string graphs 4 87
Combinatorial Algorithms for Feedback Problems in Directed.. - Demetrescu, Finocchi 15 24
Who 19 - Calamoneri, Finocchi et al. - 1999 49 Add search form 19 From: 36 6
Similar documents based on text: 576 and . - Kuo, Chang - 1994 . Hosted 0.5 National University ...