Giuseppe F. Italiano

According to our database1, Giuseppe F. Italiano authored at least 221 papers between 1986 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Dominating Sets and Connected Dominating Sets in Dynamic Graphs.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Dynamic Algorithms for the Massively Parallel Computation Model.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Faster Algorithms for All-Pairs Bounded Min-Cuts.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Dynamic algorithms via the primal-dual method.
Inf. Comput., 2018

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Preventing Ransomware Attacks Through File System Filter Drivers.
Proceedings of the Second Italian Conference on Cyber Security, Milan, Italy, February 6th - to, 2018

Decremental SPQR-trees for Planar Graphs.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Maximum Colorful Cycles in Vertex-Colored Graphs.
Proceedings of the Computer Science - Theory and Applications, 2018

Maximum Colorful Cliques in Vertex-Colored Graphs.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Sparse certificates for 2-connectivity in directed graphs.
Theor. Comput. Sci., 2017

Foreword.
Theor. Comput. Sci., 2017

On Bubble Generators in Directed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Decremental single-source reachability in planar digraphs.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Strong Connectivity in Directed Graphs under Failures, with Applications.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

An Operational Framework for Incident Handling.
Proceedings of the First Italian Conference on Cybersecurity (ITASEC17), 2017

Decremental Data Structures for Connectivity and Dominators in Directed Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

All-Pairs 2-Reachability in O(n^w log n) Time.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

A Data Streaming Approach to Link Mining in Criminal Networks.
Proceedings of the 5th International Conference on Future Internet of Things and Cloud Workshops, 2017

Contracting a Planar Graph Efficiently.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Tropical Paths in Vertex-Colored Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2017

Computing Critical Nodes in Directed Graphs.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Fully Dynamic Planarity Testing.
Encyclopedia of Algorithms, 2016

Fully Dynamic Minimum Spanning Trees.
Encyclopedia of Algorithms, 2016

Fully Dynamic Higher Connectivity for Planar Graphs.
Encyclopedia of Algorithms, 2016

Fully Dynamic Higher Connectivity.
Encyclopedia of Algorithms, 2016

Fully Dynamic Connectivity: Upper and Lower Bounds.
Encyclopedia of Algorithms, 2016

Fully Dynamic All Pairs Shortest Paths.
Encyclopedia of Algorithms, 2016

Visualization Techniques for Algorithm Engineering.
Encyclopedia of Algorithms, 2016

Trade-Offs for Dynamic Graph Problems.
Encyclopedia of Algorithms, 2016

Single-Source Fully Dynamic Reachability.
Encyclopedia of Algorithms, 2016

Decremental All-Pairs Shortest Paths.
Encyclopedia of Algorithms, 2016

EATCS Fellows' Advice to the Young Theoretical Computer Scientist.
Bulletin of the EATCS, 2016

Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022).
Dagstuhl Reports, 2016

Strong Articulation Points and Strong Bridges in Large Scale Graphs.
Algorithmica, 2016

Sparse Subgraphs for 2-Connectivity in Directed Graphs.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Frequency Domain Analysis of Large-Scale Proxy Logs for Botnet Traffic Detection.
Proceedings of the 9th International Conference on Security of Information and Networks, 2016

Online Handwritten Signature Verification for Low-End Devices.
Proceedings of the Information Systems Security and Privacy, 2016

Handwritten Signature Verification for Mobile Phones.
Proceedings of the 2nd International Conference on Information Systems Security and Privacy, 2016

Incremental 2-Edge-Connectivity in Directed Graphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2-Connectivity in Directed Graphs.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
A New System for Secure Handwritten Signing of Documents.
IJCSA, 2015

Erratum to: Editorial.
Algorithmica, 2015

Editorial.
Algorithmica, 2015

2-Edge Connectivity in Directed Graphs.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2-Vertex Connectivity in Directed Graphs.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Design of Dynamic Algorithms via Primal-Dual Method.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.
Proceedings of the Algorithms - ESA 2015, 2015

2-Connectivity in Directed Graphs: An Experimental Study.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

Fast Mining of Large-Scale Logs for Botnet Detection: A Field Study.
Proceedings of the 15th IEEE International Conference on Computer and Information Technology, 2015

2014
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201).
Dagstuhl Reports, 2014

Reliability and data density in high capacity color barcodes.
Comput. Sci. Inf. Syst., 2014

Engineering Color Barcode Algorithms for Mobile Applications.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Exploiting GPS Data in Public Transport Journey Planners.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

The (not so) Critical Nodes of Criminal Networks.
Proceedings of the Social Informatics - SocInfo 2014 International Workshops, Barcelona, 2014

Better transit routing by exploiting vehicle GPS data.
Proceedings of the IWCTS 2014, 2014

Handwritten Signature Verification with 2D Color Barcodes.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2013
On a facility location problem with applications to tele-diagnostic.
Optimization Letters, 2013

Facial Recognition with 2D Color Barcodes.
IJCSA, 2013

The Gödel Prize 2014 - Call for Nominations.
Bulletin of the EATCS, 2013

Algorithm Engineering (Dagstuhl Seminar 13391).
Dagstuhl Reports, 2013

A traffic-based evolutionary algorithm for network clustering.
Appl. Soft Comput., 2013

Color Classifiers for 2D Color Barcodes.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

Topic 12: Theory and Algorithms for Parallel Computation - (Introduction).
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

On Resilient Graph Spanners.
Proceedings of the Algorithms - ESA 2013, 2013

Is Timetabling Routing Always Reliable for Public Transport?.
Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

The Quest for the Shortest Route.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Strong Bridges and Strong Articulation Points of Directed Graphs.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Traffic vs topology in network clustering: Does it matter?
Proceedings of the 8th International Wireless Communications and Mobile Computing Conference, 2012

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Facial Biometrics for 2D Barcodes.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

An Experimental Study of Dynamic Dominators.
Proceedings of the Algorithms - ESA 2012, 2012

2011
2D Color Barcodes for Mobile Phones.
IJCSA, 2011

A Model for the Dynamics of Bidders in the Simulation of Keyword Auctions.
Proceedings of the 13th UKSim-AMSS International Conference on Computer Modelling and Simulation, Cambridge University, Emmanuel College, Cambridge, UK, 30 March, 2011

Improved algorithms for min cut and max flow in undirected planar graphs.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

On Suffix Extensions in Suffix Trees.
Proceedings of the String Processing and Information Retrieval, 2011

Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem.
Proceedings of the String Processing and Information Retrieval, 2011

A Simulator of a Mobile Ad-Hoc Network in a Hostile Environment.
Proceedings of the SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Noordwijkerhout, The Netherlands, 29, 2011

Shared Backup & Restore: Save, Recover and Share Personal Information into Closed Groups of Smartphones.
Proceedings of the 4th IFIP International Conference on New Technologies, 2011

An evolutionary algorithm for network clustering through traffic matrices.
Proceedings of the 7th International Wireless Communications and Mobile Computing Conference, 2011

The Competitor Busting Strategy in Keyword Auctions: Who's Worst Hit?
Proceedings of the Ninth Annual Communication Networks and Services Research Conference, 2011

2010
The value of location in keyword auctions.
Electronic Commerce Research and Applications, 2010

Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming.
Discrete Math., Alg. and Appl., 2010

Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Experimental Study of Resilient Algorithms and Data Structures.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

SAVED: Secure Android Value addED services.
Proceedings of the Mobile Computing, Applications, and Services, 2010

Traffic-based network clustering.
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, 2010

High Capacity Colored Two Dimensional Codes.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2010

10261 Executive Summary - Algorithm Engineering.
Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

10261 Abstracts Collection - Algorithm Engineering.
Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

SecureMyDroid: enforcing security in the mobile devices lifecycle.
Proceedings of the 6th Cyber Security and Information Intelligence Research Workshop, 2010

Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Finding Strong Bridges and Strong Articulation Points in Linear Time.
Proceedings of the Combinatorial Optimization and Applications, 2010

Penalized Second Price: A New Pricing Algorithm for Advertising in Search Engines.
Proceedings of the 8th Annual Conference on Communication Networks and Services Research, 2010

Resilient Algorithms and Data Structures.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Small stretch (alpha, beta)-spanners in the streaming model.
Theor. Comput. Sci., 2009

Resilient dictionaries.
ACM Trans. Algorithms, 2009

Preface.
J. Discrete Algorithms, 2009

Graph Spanners in the Streaming Model: An Experimental Study.
Algorithmica, 2009

Extracting social networks from seized smartphones and web data.
Proceedings of the First IEEE International Workshop on Information Forensics and Security, 2009

Data reverse engineering on a smartphone.
Proceedings of the International Conference on Ultra Modern Telecommunications, 2009

An automatized methodology design for real-time signal processing applications in multiple multi-core platforms.
Proceedings of the 2009 IEEE International Conference on Multimedia and Expo, 2009

2008
Fully Dynamic Planarity Testing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Fully Dynamic Minimum Spanning Trees.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Fully Dynamic Higher Connectivity for Planar Graphs.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Fully Dynamic Higher Connectivity.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Fully Dynamic Connectivity: Upper and Lower Bounds.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Fully Dynamic All Pairs Shortest Paths.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Visualization Techniques for Algorithm Engineering.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Trade-Offs for Dynamic Graph Problems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Single-Source Fully Dynamic Reachability.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Decremental All-Pairs Shortest Paths.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Novel Local-Search-Based Approaches to University Examination Timetabling.
INFORMS Journal on Computing, 2008

Sorting and Searching in Faulty Memories.
Algorithmica, 2008

Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure.
Algorithmica, 2008

Transaction Oriented Text Messaging with Trusted-SMS.
Proceedings of the Twenty-Fourth Annual Computer Security Applications Conference, 2008

2007
Preface.
Theor. Comput. Sci., 2007

Preface.
ACM Journal of Experimental Algorithmics, 2007

Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks.
Electr. Notes Theor. Comput. Sci., 2007

Resilient search trees.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Transparent File Protection in On-Demand Computing.
Proceedings of the 2007 International Conference on Grid Computing & Applications, 2007


Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments.
Proceedings of the Algorithms, 2007

2006
Experimental analysis of dynamic all pairs shortest path algorithms.
ACM Trans. Algorithms, 2006

Design of trees in the hose model: The balanced case.
Oper. Res. Lett., 2006

Preface.
J. Discrete Algorithms, 2006

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures.
J. Discrete Algorithms, 2006

CHECKCOL: Improved local search for graph coloring.
J. Discrete Algorithms, 2006

Improved Approximation for Single-Sink Buy-at-Bulk.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Optimal Resilient Sorting and Searching in the Presence of Memory Faults.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

The Price of Resiliency: A Case Study on Sorting with Memory Faults.
Proceedings of the Algorithms, 2006

Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?
Proceedings of the Algorithms, 2006

Algorithms and Constraint Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier.
J. ACM, 2005

Portraying Algorithms with Leonardo Web.
Proceedings of the Web Information Systems Engineering - WISE 2005 Workshops, 2005

Designing Reliable Algorithms in Unreliable Memories.
Proceedings of the Algorithms, 2005

Small Stretch Spanners on Dynamic Graphs.
Proceedings of the Algorithms, 2005

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

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

Decremental Clique Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

A Stochastic Location Problem with Applications to Tele-diagnostic.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Engineering Shortest Path Algorithms.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

JIVE: Java Interactive Software Visualization Environment.
Proceedings of the 2004 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2004), 2004

Sorting and searching in the presence of memory faults (without redundancy).
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Experimental analysis of dynamic all pairs shortest path algorithms.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

GSM and GPRS Performance of IPSEC Data Communication.
Proceedings of the ICETE 2004, 2004

2003
Preface.
J. Algorithms, 2003

Algorithm engineering, Algorithmics Column.
Bulletin of the EATCS, 2003

Search Data Structures for Skewed Strings.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

A new approach to dynamic all pairs shortest paths.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Engineering and Visualizing Algorithms.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Improved Algorithms for Max-restricted Path Consistency.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
CATAI: Concurrent Algorithms and Data Types Animation over the Internet.
J. Vis. Lang. Comput., 2002

Restoration Algorithms for Virtual Private Networks in the Hose Model.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Maintaining Dynamic Minimum Spanning Trees: An Experimental Study.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
Guest Editor's Introduction.
Algorithmica, 2001

Fully Dynamic All Pairs Shortest Paths with Real Edge Weights.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
An algorithm for finding a k-median in a directed tree.
Inf. Process. Lett., 2000

Dynamically Switching Vertices in Planar Graphs.
Algorithmica, 2000

New Algorithms for Examination Timetabling.
Proceedings of the Algorithm Engineering, 2000

What Do We Learn from Experimental Algorithmics?
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Visualization in Algorithm Engineering: Tools and Techniques.
Proceedings of the Experimental Algorithmics, 2000

Wavelength rerouting in optical networks, or the Venetian routing problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
PREFACE: Festschrift for Zvi Galil.
J. Complexity, 1999

Fully Dynamic Planarity Testing with Applications.
J. ACM, 1999

Efficient Splitting and Merging Algorithms for Order Decomposable Problems.
Inf. Comput., 1999

Algorithm Engineering.
ACM Comput. Surv., 1999

On the Optimal Placement of Web Proxies in the Internet.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures.
Proceedings of the Automata, 1999

1998
Separator-Based Sparsification II: Edge and Vertex Connectivity.
SIAM J. Comput., 1998

Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Concurrent Algorithms and Data Types Animation over the Internet.
Proceedings of the Fundamentals - Foundations of Computer Science, 1998

Efficient cross-trees for external memory.
Proceedings of the External Memory Algorithms, 1998

1997
An Empirical Study of Dynamic Graph Algorithms.
ACM Journal of Experimental Algorithmics, 1997

Sparsification - a technique for speeding up dynamic graph algorithms.
J. ACM, 1997

Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Dynamically Switching Vertices in Planar Graphs (Extended Abstract).
Proceedings of the Algorithms, 1997

1996
Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees.
J. Comput. Syst. Sci., 1996

Decremental 2- and 3-Connectivity on Planar Graphs.
Algorithmica, 1996

An Empirical Study of Dynamic Graph Algorithms (Extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1994
The Set Union Problem With Unlimited Backtracking.
SIAM J. Comput., 1994

Maintaining Spanning Trees of Small Diameter.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Maintaining the 3-Edge-Connected Components of a Graph On-Line.
SIAM J. Comput., 1993

Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.
J. Algorithms, 1993

Separator based sparsification for dynamic planar graph algorithms.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract).
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
On-Line Computation of Minimal and Maximal Length Paths.
Theor. Comput. Sci., 1992

Fully Dynamic Algorithms for 2-Edge Connectivity.
SIAM J. Comput., 1992

Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.
J. Algorithms, 1992

Sparse Dynamic Programming II: Convex and Concave Cost Functions.
J. ACM, 1992

Sparse Dynamic Programming I: Linear Cost Functions.
J. ACM, 1992

Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version).
Proceedings of the Algorithm Theory, 1992

Fully Dynamic Planarity Testing (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Reducing edge connectivity to vertex connectivity.
SIGACT News, 1991

On-Line Algorithms for Polynomially Solvable Satisfiability Problems.
J. Log. Program., 1991

A Note on Set Union with Arbitrary Deunions.
Inf. Process. Lett., 1991

Data Structures and Algorithms for Disjoint Set Union Problems.
ACM Comput. Surv., 1991

The Set Union Problem with Dynamic Weighted Backtracking.
BIT, 1991

Distributed Algorithms for Updating Shortest Paths (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Fully Persistent Data Structures for Disjoint Set Union Problems.
Proceedings of the Algorithms and Data Structures, 1991

Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Maintaining Biconnected Components of Dynamic Planar Graphs.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Sparse Dynamic Programming.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Incremental Algorithms for Minimal Length Paths.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
Worst-Case Analysis of the Set-Union Problem with Extended Backtracking.
Theor. Comput. Sci., 1989

Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 1989

1988
Finding Paths and Deleting Edges in Directed Acyclic Graphs.
Inf. Process. Lett., 1988

Getting Back to the Past in the Union-Find Problem.
Proceedings of the STACS 88, 1988

Predicting deadlock in Store-and-Forward Networks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1986
Amortized Efficiency of a Path Retrieval Data Structure.
Theor. Comput. Sci., 1986


  Loading...