Guido Proietti

ACM Trans. Economics and Comput., 2015

Specializations and generalizations of the Stackelberg minimum spanning tree game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The max-distance network creation game on general host graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2015

Network verification via routing table queries.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree.

[BibT_eX]

[DOI]

Algorithmica, 2015

Path-Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

A Faster Computation of All the Best Swap Edges of a Tree Spanner.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

Improved Purely Additive Fault-Tolerant Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.

[BibT_eX]

[DOI]

Algorithmica, 2014

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013

Dynamically Maintaining Shortest Path Trees under Batches of Updates.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

Polygon-Constrained Motion Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Improved approximability and non-approximability results for graph diameter decreasing problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications.

[BibT_eX]

[DOI]

Annalisa D'Andrea

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011

Approximating the Metric TSP in Linear Time.

[BibT_eX]

[DOI]

Luca Forlizzi

Theory Comput. Syst., 2011

2009

Strongly polynomial-time truthful mechanisms in one shot.

[BibT_eX]

[DOI]

Paolo Penna

Theor. Comput. Sci., 2009

Dynamic mechanism design.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

Stability of Networks in Stretchable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

2008

On the complexity of minimizing interference in ad-hoc and sensor networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

On k-connectivity problems with sharpened triangle inequality.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems.

[BibT_eX]

[DOI]

Internet Math., 2008

Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007

Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor.

[BibT_eX]

[DOI]

Aleksej Di Salvo

Theor. Comput. Sci., 2007

Efficient truthful mechanisms for the single-source shortest paths tree problem.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2007

On the Approximability of TSP on Local Modifications of Optimally Solved Instances.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2007

Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem.

[BibT_eX]

[DOI]

Algorithmica, 2007

An algorithm composition scheme preserving monotonicity.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Locating Facilities on a Network to Minimize Their Average Service Radius.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Efficient management of transient station failures in linear radio communication networks with bases.

[BibT_eX]

[DOI]

Richard B. Tan

J. Parallel Distributed Comput., 2006

Efficient unbalanced merge-sort.

[BibT_eX]

[DOI]

Inf. Sci., 2006

On the Stability of Approximation for Hamiltonian Path Problems.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2006

On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Reusing Optimal TSP Solutions for Locally Modified Input Instances.

[BibT_eX]

[DOI]

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

A truthful mechanism for the non-utilitarian minimum radius spanning tree problem.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Range Augmentation Problems in Static Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures.

[BibT_eX]

[DOI]

Algorithmica, 2004

Edge-Connectivity Augmentation and Network Matrices.

[BibT_eX]

[DOI]

Michele Conforti

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

A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Augmenting the Edge-Connectivity of a Spider Tree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Truthful Mechanisms for Generalized Utilitarian Problems.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Finding the most vital node of a shortest path.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast.

[BibT_eX]

[DOI]

Algorithmica, 2003

Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems.

[BibT_eX]

[DOI]

Algorithmica, 2003

Quality of Service in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs.

[BibT_eX]

[DOI]

Richard B. Tan

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Access Methods and Query Processing Techniques.

[BibT_eX]

[DOI]

Theodoros Tzouramanis

Michael Vassilakopoulos

Proceedings of the Spatio-Temporal Databases: The CHOROCHRONOS Approach, 2003

2002

An Improved Upper Bound for Scalable Distributed Search Trees.

[BibT_eX]

Adriano Di Pasquale

Proceedings of the Distributed Data & Structures 4, 2002

A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Accurate Modeling of Region Data.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2001

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2001

A faster computation of the most vital edge of a shortest path.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

A generalized comparison of linear representations of thematic layers.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2001

ATM layouts with bounded hop count and congestion.

[BibT_eX]

[DOI]

Michele Flammini

Distributed Comput., 2001

Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2000

An efficient spatial access method for spatial images containing multiple non-overlapping features.

[BibT_eX]

[DOI]

Inf. Syst., 2000

Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 2000

Maintaining a Minimum Spanning Tree Under Transient Node Failures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

Size Estimation of the Intersection Join between Two Line Segment Datasets.

[BibT_eX]

[DOI]

Proceedings of the Current Issues in Databases and Information Systems, 2000

1999

Probabilistic models for images and quadtrees: differences and equivalences.

[BibT_eX]

[DOI]

Image Vis. Comput., 1999

Intersection Reporting on Two Collections of Disjoint Sets.

[BibT_eX]

[DOI]

Inf. Sci., 1999

An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks.

[BibT_eX]

[DOI]

Acta Informatica, 1999

A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas.

[BibT_eX]

[DOI]

Yihong Gong

David LaRose

Proceedings of the International Conference on Information Visualisation, 1999

I/O Complexity for Range Queries on Region Data Stored Using an R-tree.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Data Engineering, 1999

How to Swap a Failing Edge of a Single Source Shortest Paths Tree.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

S*-Tree: An Improved S+-Tree for Coloured Images.

[BibT_eX]

[DOI]

Proceedings of the Advances in Databases and Information Systems, 1999

1998

Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Image Indexing and Retrieval Based on Human Perceptual Color Clustering.

[BibT_eX]

[DOI]

Yihong Gong

Proceedings of the 1998 Conference on Computer Vision and Pattern Recognition (CVPR '98), 1998

Selectivity Estimation of Window Queries.

[BibT_eX]

[DOI]

Proceedings of the 1998 ACM CIKM International Conference on Information and Knowledge Management, 1998

1997

Time and Space Efficient Secondary Memory Representation of Quadtrees.

[BibT_eX]

[DOI]

Inf. Syst., 1997

MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features.

[BibT_eX]

[DOI]

Yannis Manolopoulos

Apostolos Papadopoulos

Inf. Syst., 1997

Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

1996

On the creation of quadtrees by using a branching process.

[BibT_eX]

[DOI]

Yannis Manolopoulos

Michael Vassilakopoulos

Image Vis. Comput., 1996

An Output Sensitive Solution to the Set Union and Intersection Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995

Efficient Secondary Memory Processing of Window Queries on Spatial Data.

[BibT_eX]

[DOI]

Inf. Sci., 1995

On the Generation of Aggregated Random Spatial Regions.

[BibT_eX]

[DOI]

Yannis Manolopoulos

Michael Vassilakopoulos

Proceedings of the CIKM '95, Proceedings of the 1995 International Conference on Information and Knowledge Management, November 28, 1995

1994

A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries.

[BibT_eX]

[DOI]

Proceedings of the IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28, 1994

An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1994 International Conference on Image Processing, 1994

1993

Raster to object conversion aided by knowledge based image processing.

[BibT_eX]

[DOI]