CYBERMAP: yet another way of navigating in hyperspace
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
Architectures for volatile hypertext
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
Converting a textbook to hypertext
ACM Transactions on Information Systems (TOIS)
Contours of constructive hypertexts
ECHT '92 Proceedings of the ACM conference on Hypertext
Selective text utilization and text traversal
HYPERTEXT '93 Proceedings of the fifth ACM conference on Hypertext
HieNet: a user-centered approach for automatic link generation
HYPERTEXT '93 Proceedings of the fifth ACM conference on Hypertext
Text-hypertext mutual conversion and hypertext interchange through SGML
CIKM '93 Proceedings of the second international conference on Information and knowledge management
VIKI: spatial hypertext supporting emergent structure
ECHT '94 Proceedings of the 1994 ACM European conference on Hypermedia technology
Frame-axis model for automatic information organizing and spatial navigation
ECHT '94 Proceedings of the 1994 ACM European conference on Hypermedia technology
HyperActive: extending an open hypermedia architecture to support agency
ACM Transactions on Computer-Human Interaction (TOCHI)
Practical methods for automatically generating typed links
Proceedings of the the seventh ACM conference on Hypertext
Automatic hypertext link typing
Proceedings of the the seventh ACM conference on Hypertext
Media-based navigation with generic links
Proceedings of the the seventh ACM conference on Hypertext
Discovering similar resources by content part-linking
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Query-based navigation in semantically indexed hypermedia
HYPERTEXT '97 Proceedings of the eighth ACM conference on Hypertext
Semiautomatic generation of glossary links: a practical solution
Proceedings of the tenth ACM Conference on Hypertext and hypermedia : returning to our diverse roots: returning to our diverse roots
Incremental formalization with the hyper-object substrate
ACM Transactions on Information Systems (TOIS)
Phrasier: a system for interactive document retrieval using keyphrases
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
An orthogonal taxonomy for hyperlink anchor generation in video streams using OvalTine
HYPERTEXT '00 Proceedings of the eleventh ACM on Hypertext and hypermedia
ACM Computing Surveys (CSUR)
Semantics happen: knowledge building in spatial hypertext
Proceedings of the thirteenth ACM conference on Hypertext and hypermedia
Applying JAVA-triggers for X-link management in the industrial framework
Effective databases for text & document management
Autonomous authoring tools for hypertext
ACM Computing Surveys (CSUR)
What is an analogue for the semantic web and why is having one important?
Proceedings of the eighteenth conference on Hypertext and hypermedia
What is an analogue for the semantic web and why is having one important?
ACM SIGWEB Newsletter
Expanding a humanities digital library: musical references in Cervantes’ works
ECDL'06 Proceedings of the 10th European conference on Research and Advanced Technology for Digital Libraries
| Hi-index | 0.00 |
The fully dynamic planarity testing problem consists of performing an arbitrary sequence of the following three kinds of operations on a planar graph G: (i) insert an edge if the resultant graph remains planar; (ii) delete an edge; and (iii) test whether an edge could be added to the graph without violating planarity. We show how to support each of the above operations in O(n2/3) time, where n is the number of vertices in the graph. The bound for tests and deletions is worst-case, while the bound for insertions is amortized. This is the first algorithm for this problem with sub-linear running time. The same data structure has further applications in maintaining the biconnected and triconnected components of a dynamic planar graph.