Roberto Tamassia

Li Xiong

Farnoush Banaei Kashani

Erik G. Hoel

ACM SIGSPATIAL Special, 2019

Mitigation Techniques for Attacks on 1-Dimensional Databases that Support Range Queries.

[BibT_eX]

[DOI]

Evangelia Anna Markatou

IACR Cryptol. ePrint Arch., 2019

Full Database Reconstruction with Access and Search Pattern Leakage.

[BibT_eX]

[DOI]

Evangelia Anna Markatou

IACR Cryptol. ePrint Arch., 2019

The State of the Uniform: Attacks on Encrypted Databases Beyond the Uniform Query Distribution.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

2018

The 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2017) Redondo Beach, California, USA November 7-10, 2017: conference report.

[BibT_eX]

[DOI]

Goce Trajcevski

Siva Ravada

ACM SIGSPATIAL Special, 2018

Data Recovery on Encrypted Databases With k-Nearest Neighbor Query Leakage.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

2017

Efficient detection of motion-trend predicates in wireless sensor networks.

[BibT_eX]

[DOI]

Comput. Commun., 2017

Bypassing holes in sensor networks: Load-balance vs. latency.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2017

2016

Efficient Verifiable Range and Closest Point Queries in Zero-Knowledge.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2016

Auditable Data Structures.

[BibT_eX]

[DOI]

Michael Mitzenmacher

IACR Cryptol. ePrint Arch., 2016

More Practical and Secure History-Independent Hash Tables.

[BibT_eX]

[DOI]

Michael Mitzenmacher

IACR Cryptol. ePrint Arch., 2016

Authenticated Hash Tables Based on Cryptographic Accumulators.

[BibT_eX]

[DOI]

Algorithmica, 2016

Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Zero-Knowledge Accumulators and Set Algebra.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Dynamic Provable Data Possession.

[BibT_eX]

[DOI]

C. Christopher Erway

Alptekin Küpçü

ACM Trans. Inf. Syst. Secur., 2015

Practical Authenticated Pattern Matching with Optimal Proof Size.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

Proc. VLDB Endow., 2015

Authenticated Range \& Closest Point Queries in Zero-Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Zero-Knowledge Accumulators and Set Operations.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

IACR Cryptol. ePrint Arch., 2015

Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Bitconeview: visualization of flows in the bitcoin transaction graph.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE Symposium on Visualization for Cyber Security, 2015

Minimal Spatio-Temporal Database Repairs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Spatial and Temporal Databases, 2015

Falcon Codes: Fast, Authenticated LT Codes (Or: Making Rapid Tornadoes Unstoppable).

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Zero-Knowledge Authenticated Order Queries and Order Statistics on a List.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2015

2014

Secure Compression: Theory \& Practice.

[BibT_eX]

[DOI]

James Kelley

IACR Cryptol. ePrint Arch., 2014

Falcon Codes: Fast, Authenticated LT Codes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Verifiable Member and Order Queries on a List in Zero-Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Accountable Storage.

[BibT_eX]

[DOI]

Giuseppe Ateniese

Vassilios Lekakis

Evripidis Paraskevas

IACR Cryptol. ePrint Arch., 2014

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Signatures of Correct Computation.

[BibT_eX]

[DOI]

Elaine Shi

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Haze: privacy-preserving real-time traffic statistics.

[BibT_eX]

[DOI]

Joshua W. S. Brown

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

Streaming Authenticated Data Structures.

[BibT_eX]

[DOI]

Elaine Shi

Ke Yi

Proceedings of the Advances in Cryptology, 2013

2012

Deflection-Aware Tracking-Principal Selection in Active Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2012

Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers.

[BibT_eX]

[DOI]

Duy Nguyen

Cristina Videira Lopes

Proc. VLDB Endow., 2012

Data-Oblivious Graph Drawing Model and Algorithms

[BibT_eX]

[DOI]

CoRR, 2012

Verifying Search Results Over Web Collections

[BibT_eX]

[DOI]

Duy Nguyen

Cristina Videira Lopes

CoRR, 2012

Authenticating Email Search Results.

[BibT_eX]

[DOI]

Hobart Reynolds

Proceedings of the Security and Trust Management - 8th International Workshop, 2012

Privacy-preserving group data access via stateless oblivious RAM simulation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Motion Trends Detection in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Conference on Mobile Data Management, 2012

Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Hardening Access Control and Data Protection in GFS-like File Systems.

[BibT_eX]

[DOI]

James Kelley

Proceedings of the Computer Security - ESORICS 2012, 2012

Practical oblivious storage.

[BibT_eX]

[DOI]

Proceedings of the Second ACM Conference on Data and Application Security and Privacy, 2012

2011

Ranking continuous nearest neighbors for uncertain trajectories.

[BibT_eX]

[DOI]

Christopher Zamierowski

VLDB J., 2011

Cryptography for Efficiency: Authenticated Data Structures Based on Lattices and Parallel Online Memory Checking.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Publicly Verifiable Delegation of Computation.

[BibT_eX]

[DOI]

Elaine Shi

IACR Cryptol. ePrint Arch., 2011

Oblivious Storage with Low I/O Overhead

[BibT_eX]

[DOI]

CoRR, 2011

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems.

[BibT_eX]

[DOI]

Algorithmica, 2011

Oblivious RAM simulation with efficient worst-case access overhead.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM Cloud Computing Security Workshop, 2011

2010

Independently Verifiable Decentralized Role-Based Delegation.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern. Part A, 2010

Authenticated error-correcting codes with applications to multicast authentication.

[BibT_eX]

[DOI]

Anna Lysyanskaya

ACM Trans. Inf. Syst. Secur., 2010

Optimal Verification of Operations on Dynamic Sets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Optimal Authenticated Data Structures with Multilinear Forms.

[BibT_eX]

[DOI]

Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Selecting tracking principals with epoch awareness.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

Privacy-preserving data-oblivious geometric algorithms for geographic data.

[BibT_eX]

[DOI]

David Eppstein

Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

Certification and Authentication of Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

2009

Compact and Anonymous Role-Based Authorization Chain.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2009

Cryptographic Accumulators for Authenticated Hash Tables.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

An Efficient Dynamic and Distributed RSA Accumulator

[BibT_eX]

[DOI]

Jasminka Hasic

CoRR, 2009

Reliable Resource Searching in P2P Networks.

[BibT_eX]

[DOI]

Proceedings of the Security and Privacy in Communication Networks, 2009

Continuous probabilistic nearest-neighbor queries for uncertain trajectories.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2009, 2009

2008

Private Information: To Reveal or not to Reveal.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2008

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Papers from ALENEX 2005.

[BibT_eX]

[DOI]

Camil Demetrescu

ACM J. Exp. Algorithmics, 2008

Notarized federated ID management and authentication.

[BibT_eX]

[DOI]

Danfeng (Daphne) Yao

J. Comput. Secur., 2008

Effective Visualization of File System Access-Control.

[BibT_eX]

[DOI]

Alexander Heitzmann

Bernardo Palazzi

Proceedings of the 5th International Workshop on Visualization for Computer Security, 2008

Efficient integrity checking of untrusted network storage.

[BibT_eX]

[DOI]

Alexander Heitzmann

Bernardo Palazzi

Proceedings of the 2008 ACM Workshop On Storage Security And Survivability, 2008

Athos: Efficient Authentication of Outsourced File Systems.

[BibT_eX]

[DOI]

Proceedings of the Information Security, 11th International Conference, 2008

Graph Drawing for Security Visualization.

[BibT_eX]

[DOI]

Bernardo Palazzi

Proceedings of the Graph Drawing, 16th International Symposium, 2008

Alternating multiple tributaries + deltas.

[BibT_eX]

[DOI]

Proceedings of the 5th Workshop on Data Management for Sensor Networks, 2008

Super-Efficient Verification of Dynamic Outsourced Databases.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2008

Authenticated hash tables.

[BibT_eX]

[DOI]

Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

Algorithms for Location Estimation Based on RSSI Sampling.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007

On the Cost of Persistence and Authentication in Skip Lists.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Decentralized authorization and data security in web content delivery.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

A Role and Attribute Based Access Control System Using Semantic Web Technologies.

[BibT_eX]

[DOI]

Lorenzo Cirio

Isabel F. Cruz

Proceedings of the On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops, 2007

Private Distributed Scalar Product Protocol With Application To Privacy-Preserving Computation of Trust.

[BibT_eX]

[DOI]

Seth Proctor

Proceedings of the Trust Management, 2007

Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Information and Communications Security, 9th International Conference, 2007

Dynamics-aware similarity of moving objects trajectories.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

Privacy-Preserving Schema Matching Using Mutual Information.

[BibT_eX]

[DOI]

Isabel F. Cruz

Proceedings of the Data and Applications Security XXI, 2007

Efficient Content Authentication in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007

2006

Point-Based Trust: Define How Much Privacy Is Worth.

[BibT_eX]

[DOI]

Proceedings of the Information and Communications Security, 8th International Conference, 2006

Notarized Federated Identity Management for Web Services.

[BibT_eX]

[DOI]

Proceedings of the Data and Applications Security XX, 2006

2005

Visualization of Automated Trust Negotiation.

[BibT_eX]

[DOI]

Michael Shin

Proceedings of the 2nd IEEE Workshop on Visualization for Computer Security, 2005

On Improving the Performance of Role-Based Cascaded Delegation in Ubiquitous Computing.

[BibT_eX]

[DOI]

Seth Proctor

Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks, 2005

Computational Bounds on Hierarchical Data Processing with Applications to Information Security.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Secure Biometric Authentication for Weak Computational Devices.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2005

Accredited DomainKeys: A Service Architecture for Improved Email Validation.

[BibT_eX]

[DOI]

Proceedings of the CEAS 2005, 2005

Indexing Information for Data Forensics.

[BibT_eX]

[DOI]

Mikhail J. Atallah

Proceedings of the Applied Cryptography and Network Security, 2005

2004

Data Structures in JDSL.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Graph drawing.

[BibT_eX]

[DOI]

Giuseppe Liotta

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Secure Visualization of Authentication Information: A Case Study.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2004), 2004

Multicast Authentication in Fully Adversarial Networks.

[BibT_eX]

[DOI]

Anna Lysyanskaya

Proceedings of the 2004 IEEE Symposium on Security and Privacy (S&P 2004), 2004

Role-based cascaded delegation.

[BibT_eX]

[DOI]

Proceedings of the 9th ACM Symposium on Access Control Models and Technologies, 2004

Curvilinear Graph Drawing Using the Force-Directed Method.

[BibT_eX]

[DOI]

Benjamin Finkel

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Efficient Tree-Based Revocation in Groups of Low-State Devices.

[BibT_eX]

[DOI]

Jonathan Z. Sun

Proceedings of the Advances in Cryptology, 2004

GDS - A Graph Drawing Server on the Internet.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

Data structures and algorithms in C++.

[BibT_eX]

David M. Mount

Wiley, ISBN: 978-0-471-42924-1, 2004

2003

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2003

Authenticated Dictionaries for Fresh Attribute Credentials.

[BibT_eX]

[DOI]

Michael Shin

Proceedings of the Trust Management, First International Conference, 2003

Authenticated Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

Efficient and Scalable Infrastructure Support for Dynamic Coalitions.

[BibT_eX]

[DOI]

Giuseppe Francesco Italiano

Proceedings of the 3rd DARPA Information Survivability Conference and Exposition (DISCEX-III 2003), 2003

Distributed Data Authenication (System Demonstration).

[BibT_eX]

[DOI]

Proceedings of the 3rd DARPA Information Survivability Conference and Exposition (DISCEX-III 2003), 2003

Authenticated Data Structures for Graph and Geometric Searching.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2003

Graphs in Computer Science.

[BibT_eX]

[DOI]

Harold N. Gabow

Camil Demetrescu

Irene Finocchi

Proceedings of the Handbook of Graph Theory., 2003

Data structures and algorithms in Java (3. ed.).

[BibT_eX]

Wiley, ISBN: 978-0-471-64452-1, 2003

2002

A User Study in Similarity Measures for Graph Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2002

Optimizing area and aspect ration in straight-line orthogonal tree drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Authenticating distributed data using Web services and XML signatures.

[BibT_eX]

[DOI]

Daniel J. Polivy

Proceedings of the 2002 ACM Workshop on XML Security, Fairfax, VA, USA, November 22, 2002, 2002

JERPA: a distance-learning environment for introductory Java programming courses.

[BibT_eX]

[DOI]

David Emory

Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002

An Efficient Dynamic and Distributed Cryptographic Accumulator.

[BibT_eX]

[DOI]

Jasminka Hasic

Proceedings of the Information Security, 5th International Conference, 2002

Algorithm design - foundations, analysis and internet examples.

[BibT_eX]

Wiley, ISBN: 978-0-471-38365-9, 2002

2001

On the Computational Complexity of Upward and Rectilinear Planarity Testing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Takao Nishizeki

Dorothea Wagner

J. Graph Algorithms Appl., 2001

A Case Study in Algorithm Engineering for Geometric Computing.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

Incremental Convex Planarity Testing.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Teaching internet algorithmics.

[BibT_eX]

[DOI]

Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

Persistent Authenticated Dictionaries and Their Applications.

[BibT_eX]

[DOI]

Aris Anagnostopoulos

Proceedings of the Information Security, 4th International Conference, 2001

The Graph Drawing Server.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

Experimental studies on graph drawing algorithms.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2000

A Parallel Algorithm for Planar Orthogonal Grid Drawings.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2000

Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2000

Drawing Directed Acyclic Graphs: An Experimental Study.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

Turn-regularity and optimal area drawings of orthogonal representations.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Foreword.

[BibT_eX]

[DOI]

Takao Nishizeki

Dorothea Wagner

Algorithmica, 2000

Improving Angular Resolution in Visualizations of Geographic Networks.

[BibT_eX]

[DOI]

Ulrik Brandes

Galina Shubina

Proceedings of the 2nd Joint Eurographics - IEEE TCVG Symposium on Visualization, 2000

SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX.

[BibT_eX]

[DOI]

Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, 2000

PILOT: an interactive tool for learning and grading.

[BibT_eX]

[DOI]

Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, 2000

Fast Layout Methods for Timetable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

Minimum Depth Graph Embedding.

[BibT_eX]

[DOI]

Maurizio Pizzonia

Proceedings of the Algorithms, 2000

Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computational Geometry, 2000

1999

Advances in the Theory and Practice of Graph Drawing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

GeomNet: Geometric Computing Over the Internet.

[BibT_eX]

[DOI]

IEEE Internet Comput., 1999

A Graph Drawing and Translation Service on the World Wide Web.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

Visualizing geometric algorithms over the Web.

[BibT_eX]

[DOI]

Comput. Geom., 1999

Output-Sensitive Reporting of Disjoint Paths.

[BibT_eX]

[DOI]

Algorithmica, 1999

Using randomization in the teaching of data structures and algorithms.

[BibT_eX]

[DOI]

Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

Testers and visualizers for teaching data structures.

[BibT_eX]

[DOI]

Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

Turn-Regularity and Planar Orthogonal Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

Accessing the Internal Organization of Data Structures in the JDSL Library.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, 1999

Graph Drawing: Algorithms for the Visualization of Graphs

[BibT_eX]

Prentice-Hall, ISBN: 0-13-301615-3, 1999

Basic Data Structures.

[BibT_eX]

[DOI]

Bryan Cantrill

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design.

[BibT_eX]

[DOI]

Giuseppe Liotta

SIAM J. Comput., 1998

Dynamic Trees and Dynamic Point Location.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Optimal Upward Planarity Testing of Single-Source Digraphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Constraints in Graph Drawing Algorithms.

[BibT_eX]

[DOI]

Constraints An Int. J., 1998

Checking the convexity of polytopes and the planarity of subdivisions.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Teaching the analysis of algorithms with visual proofs.

[BibT_eX]

[DOI]

Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

Teaching data structure design patterns.

[BibT_eX]

[DOI]

Natasha Gelfand

Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

Implementing Algorithms and Data Structures: An Educational and Research Perspective.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Algorithmic Patterns for Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Natasha Gelfand

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Data structures and algorithms in Java.

[BibT_eX]

World wide series in computer science, Wiley, ISBN: 978-0-471-19308-1, 1998

1997

Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Area Requirement of Visibility Representations of Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

An Experimental Comparison of Four Graph Drawing Algorithms.

[BibT_eX]

[DOI]

Comput. Geom., 1997

Combine and Conquer.

[BibT_eX]

[DOI]

Algorithmica, 1997

A Case Study in Algorithm Engineering for Geometric Computing.

[BibT_eX]

James E. Baker

Proceedings of the Workshop on Algorithm Engineering, 1997

Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Classical Computational Geometry in GeomNet.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Area Requirement of Gabriel Drawings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Data Structures.

[BibT_eX]

Bryan Cantrill

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

On-Line Planarity Testing.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

On-Line Planar Graph Embedding.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Planar upward tree drawings with optimal area.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1996

An Algorithm for Drawing a Hierarchical Graph.

[BibT_eX]

[DOI]

Peter Eades

Xuemin Lin

Int. J. Comput. Geom. Appl., 1996

Strategic Directions in Computational Geometry.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

Data Structures.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

Optimal Cooperative Search in Fractional Cascaded Data Structures.

[BibT_eX]

[DOI]

Algorithmica, 1996

Guest Editors' Introduction to the Special Issue on Graph Drwaing.

[BibT_eX]

[DOI]

Algorithmica, 1996

On-Line Maintenance of Triconnected Components with SPQR-Trees.

[BibT_eX]

[DOI]

Algorithmica, 1996

A New Minimum Cost Flow Algorithm with Applications to Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

A Graph Drawing and Translation Service on the WWW.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Drawing with Colors (Extended Abstract).

[BibT_eX]

[DOI]

Paola Vocca

Proceedings of the Algorithms, 1996

Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version).

[BibT_eX]

[DOI]

Marek Chrobak

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Animating Geometric Algorithms Over the Web.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Output-Sensitive Reporting of Disjoint Paths (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

Robust Proximity Queries in Implicit Voronoi Diagrams.

[BibT_eX]

[DOI]

Giuseppe Liotta

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

The Mocha algorithm animation system.

[BibT_eX]

[DOI]

Proceedings of the workshop on Advanced visual interfaces 1996, 1996

Algorithm animation over the World Wide Web.

[BibT_eX]

[DOI]

Proceedings of the workshop on Advanced visual interfaces 1996, 1996

1995

Report on graph drawing '94.

[BibT_eX]

[DOI]

SIGACT News, 1995

Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

A New Model for Algorithm Animation Over the WWW.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1995

An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs.

[BibT_eX]

[DOI]

Sairam Subramanian

Algorithmica, 1995

Dynamic Expression Trees.

[BibT_eX]

[DOI]

Algorithmica, 1995

External-Memory Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Complexity Models for Incremental Computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

How to Draw a Series-Parallel Digraph.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1994

Algorithms for Drawing Graphs: an Annotated Bibliography.

[BibT_eX]

[DOI]

Comput. Geom., 1994

On-Line Convex Plabarity Testing.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

On the Compuational Complexity of Upward and Rectilinear Planarity Testing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

Advances in Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

Dynamic Reachability in Planar Digraphs with One Source and One Sink.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Algorithms for orthogonal drawings (abstract).

[BibT_eX]

[DOI]

SIGACT News, 1993

Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.

[BibT_eX]

J. Algorithms, 1993

Reinventing the wheel: an optimal data structure for connectivity queries.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

A Complexity Theoretic Approach to Incremental Computation.

[BibT_eX]

[DOI]

Sairam Sairam

Proceedings of the STACS 93, 1993

Dynamic algorithms for optimization problems in bounded tree-width graphs.

[BibT_eX]

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Area-Efficient Upward Tree Drawings.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Efficient Point Location in a Convex Spatial Cell-Complex.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Dynamic algorithms in computational geometry.

[BibT_eX]

[DOI]

Proc. IEEE, 1992

Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.

[BibT_eX]

[DOI]

J. Algorithms, 1992

Constrained Visibility Representations of Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Dynamization of the trapezoid method for planar point location in monotone subdivisions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1992

Area Requirement and Symmetry Display of Planar Upward Drawings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

How to Draw a Series-Parallel Digraph (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1992

A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs.

[BibT_eX]

[DOI]

Sairam Sairam

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

A Framework for Dynamic Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

A Network Flow Approach to the Reconfiguration of VLSI Arrays.

[BibT_eX]

[DOI]

Bruno Codenotti

IEEE Trans. Computers, 1991

Representations of Graphs on a Cylinder.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

Parallel Transitive Closure and Point Location in Planar Structures.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

Lower Bounds for Planar Orthogonal Drawings of Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

An Incremental Reconstruction Method for Dynamic Planar Point Location.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Dynamic Trees and Dynamic Point Location (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Lower bounds and parallel algorithms for planar orthogonal grid drawings.

[BibT_eX]

[DOI]

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Dynamic Expression Trees and their Applications (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Dynamic Planar Point Location with Optimal Query Time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Dynamic Maintenance of Planar Digraphs, with Applications.

[BibT_eX]

[DOI]

Algorithmica, 1990

Drawing algorithms for planar st-graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1990

The Architecture of Diagram Server.

[BibT_eX]

[DOI]

Proceedings of the 1990 IEEE Workshop on Visual Languages, 1990

Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph.

[BibT_eX]

[DOI]

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

On-Line Graph Algorithms with SPQR-Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Fully Dynamic Point Location in a Monotone Subdivision.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Definition Libraries for Conceptual Modelling.

[BibT_eX]

[DOI]

Hannu Kangassalo

Data Knowl. Eng., 1989

Efficient Spatial Point Location (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

Automatic layout of PERT diagrams with X-PERT.

[BibT_eX]

[DOI]

Proceedings of the IEEE Workshop on Visual Languages, 1989

Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Incremental Planarity Testing (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Area Requirement and Symmetry Display in Drawing Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Dynamic Data Structures for Two Dimensional Searching

[BibT_eX]

[DOI]

PhD thesis, 1988

Automatic graph drawing and readability of diagrams.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern., 1988

Algorithms for Plane Representations of Acyclic Digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Efficient Reconfiguration of VLSI Arrays.

[BibT_eX]

[DOI]

Bruno Codenotti

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

On Embedding a Graph in the Grid with the Minimum Number of Bends.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

Upward Drawings of Acyclic Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

1986

A Layout Algorithm for Data Flow Diagrams.

[BibT_eX]

[DOI]

Enrico Nardelli

IEEE Trans. Software Eng., 1986

A Unified Approach a Visibility Representation of Planar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1986

Centipede Graphs and Visibility on a Cylinder.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

Algorithms for Visibility Representations of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 86, 1986

1985

New Layout Techniques for Entity-Relationship Diagrams.

[BibT_eX]

Proceedings of the Entity-Relationship Approach: The Use of ER Concept in Knowledge Representation, 1985

GINCOD: A Graphical Tool for Conceptual Design of Data Base Applications.

[BibT_eX]

Proceedings of the Computer-Aided Database Design: the DATAID approach., 1985

1984

Computer aided layout of entity relationship diagrams.

[BibT_eX]

[DOI]

Maurizio Talamo

J. Syst. Softw., 1984

1983

An Algorithm for Automatic Layout of Entity-Relationship Diagrams.

[BibT_eX]