Guido Proietti

According to our database1, Guido Proietti
  • authored at least 130 papers between 1993 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner.
CoRR, 2017

Rational Fair Consensus in the GOSSIP Model.
CoRR, 2017

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges.
CoRR, 2017

Rational Fair Consensus in the Gossip Model.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2016
Locality-Based Network Creation Games.
TOPC, 2016

Exact and approximate algorithms for movement problems on (special classes of) graphs.
Theor. Comput. Sci., 2016

Compact and Fast Sensitivity Oracles for Single-Source Distances.
CoRR, 2016

Locality-based Network Creation Games.
CoRR, 2016

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees.
CoRR, 2016

Sequence Hypergraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

On the Clustered Shortest-Path Tree Problem.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Compact and Fast Sensitivity Oracles for Single-Source Distances.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Bounded-Distance Network Creation Games.
ACM Trans. Economics and Comput., 2015

Specializations and generalizations of the Stackelberg minimum spanning tree game.
Theor. Comput. Sci., 2015

The max-distance network creation game on general host graphs.
Theor. Comput. Sci., 2015

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments.
ACM Journal of Experimental Algorithmics, 2015

Network verification via routing table queries.
J. Comput. Syst. Sci., 2015

Path-Fault-Tolerant Approximate Shortest-Path Trees.
CoRR, 2015

Improved Purely Additive Fault-Tolerant Spanners.
CoRR, 2015

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

Path-Fault-Tolerant Approximate Shortest-Path Trees.
Proceedings of the Structural Information and Communication Complexity, 2015

A Faster Computation of All the Best Swap Edges of a Tree Spanner.
Proceedings of the Structural Information and Communication Complexity, 2015

Improved Purely Additive Fault-Tolerant Spanners.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game.
CoRR, 2014

The Max-Distance Network Creation Game on General Host Graphs.
CoRR, 2014

Fault-Tolerant Approximate Shortest-Path Trees.
CoRR, 2014

Exact and approximate algorithms for movement problems on (special classes of) graphs.
CoRR, 2014

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

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Locality-based network creation games.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Network Creation Games with Traceroute-Based Strategies.
Proceedings of the Structural Information and Communication Complexity, 2014

Fault-Tolerant Approximate Shortest-Path Trees.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Dynamically Maintaining Shortest Path Trees under Batches of Updates.
Proceedings of the Structural Information and Communication Complexity, 2013

Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs.
Proceedings of the Structural Information and Communication Complexity, 2013

A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree.
Proceedings of the Algorithms - ESA 2013, 2013

Polygon-Constrained Motion Planning Problems.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Improved approximability and non-approximability results for graph diameter decreasing problems.
Theor. Comput. Sci., 2012

Bounded-Distance Network Creation Games.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

The Max-Distance Network Creation Game on General Host Graphs.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011
Approximating the Metric TSP in Linear Time.
Theory Comput. Syst., 2011

Bounded-Distance Network Creation Games
CoRR, 2011

Network Verification via Routing Table Queries.
Proceedings of the Structural Information and Communication Complexity, 2011

2010
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
Strongly polynomial-time truthful mechanisms in one shot.
Theor. Comput. Sci., 2009

Dynamic mechanism design.
Theor. Comput. Sci., 2009

Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Stability of Networks in Stretchable Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

2008
On the complexity of minimizing interference in ad-hoc and sensor networks.
Theor. Comput. Sci., 2008

On k-connectivity problems with sharpened triangle inequality.
J. Discrete Algorithms, 2008

Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems.
Internet Mathematics, 2008

Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Approximating the Metric TSP in Linear Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor.
Theor. Comput. Sci., 2007

Efficient truthful mechanisms for the single-source shortest paths tree problem.
Concurrency and Computation: Practice and Experience, 2007

On the Approximability of TSP on Local Modifications of Optimally Solved Instances.
Algorithmic Operations Research, 2007

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

Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

An algorithm composition scheme preserving monotonicity.
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.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
Efficient management of transient station failures in linear radio communication networks with bases.
J. Parallel Distrib. Comput., 2006

Efficient unbalanced merge-sort.
Inf. Sci., 2006

On the Stability of Approximation for Hamiltonian Path Problems.
Algorithmic Operations Research, 2006

Strongly Polynomial-Time Truthful Mechanisms in One Shot.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Dynamic Mechanism Design.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.
Proceedings of the Structural Information and Communication Complexity, 2006

Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Reusing Optimal TSP Solutions for Locally Modified Input Instances.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

On the Stability of Approximation for Hamiltonian Path Problems.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Range Augmentation Problems in Static Ad-Hoc Wireless Networks.
Proceedings of the Structural Information and Communication Complexity, 2005

Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals.
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.
Theor. Comput. Sci., 2004

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

Edge-Connectivity Augmentation and Network Matrices.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor.
Proceedings of the Structural Information and Communication Complexity, 2004

Augmenting the Edge-Connectivity of a Spider Tree.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Truthful Mechanisms for Generalized Utilitarian Problems.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Finding the most vital node of a shortest path.
Theor. Comput. Sci., 2003

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

Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems.
Algorithmica, 2003

Quality of Service in Wireless Networks.
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.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Access Methods and Query Processing Techniques.
Proceedings of the Spatio-Temporal Databases: The CHOROCHRONOS Approach, 2003

2002
An Improved Upper Bound for Scalable Distributed Search Trees.
Proceedings of the Distributed Data & Structures 4, 2002

A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2001
Accurate Modeling of Region Data.
IEEE Trans. Knowl. Data Eng., 2001

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures.
J. Graph Algorithms Appl., 2001

A faster computation of the most vital edge of a shortest path.
Inf. Process. Lett., 2001

A generalized comparison of linear representations of thematic layers.
Data Knowl. Eng., 2001

ATM layouts with bounded hop count and congestion.
Distributed Computing, 2001

Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Finding the Most Vital Node of a Shortest Path.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree.
IEEE Trans. Knowl. Data Eng., 2000

An efficient spatial access method for spatial images containing multiple non-overlapping features.
Inf. Syst., 2000

Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees.
Proceedings of the Algorithm Engineering, 2000

Maintaining a Minimum Spanning Tree Under Transient Node Failures.
Proceedings of the Algorithms, 2000

Size Estimation of the Intersection Join between Two Line Segment Datasets.
Proceedings of the Current Issues in Databases and Information Systems, 2000

1999
Probabilistic models for images and quadtrees: differences and equivalences.
Image Vision Comput., 1999

Intersection Reporting on Two Collections of Disjoint Sets.
Inf. Sci., 1999

An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks.
Acta Inf., 1999

A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas.
Proceedings of the International Conference on Information Visualisation, 1999

I/O Complexity for Range Queries on Region Data Stored Using an R-tree.
Proceedings of the 15th International Conference on Data Engineering, 1999

How to Swap a Failing Edge of a Single Source Shortest Paths Tree.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

S*-Tree: An Improved S+-Tree for Coloured Images.
Proceedings of the Advances in Databases and Information Systems, 1999

1998
Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes.
Inf. Process. Lett., 1998

Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures.
Proceedings of the Algorithms, 1998

Image Indexing and Retrieval Based on Human Perceptual Color Clustering.
Proceedings of the 1998 Conference on Computer Vision and Pattern Recognition (CVPR '98), 1998

Selectivity Estimation of Window Queries.
Proceedings of the 1998 ACM CIKM International Conference on Information and Knowledge Management, 1998

1997
Time and Space Efficient Secondary Memory Representation of Quadtrees.
Inf. Syst., 1997

MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features.
Inf. Syst., 1997

ATM Layouts with Bounded Hop Count and Congestion.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

1996
On the creation of quadtrees by using a branching process.
Image Vision Comput., 1996

An Output Sensitive Solution to the Set Union and Intersection Problem.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995
Efficient Secondary Memory Processing of Window Queries on Spatial Data.
Inf. Sci., 1995

On the Generation of Aggregated Random Spatial Regions.
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.
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.
Proceedings of the Proceedings 1994 International Conference on Image Processing, 1994

1993
Raster to object conversion aided by knowledge based image processing.
Proceedings of the 2nd International Conference Document Analysis and Recognition, 1993


  Loading...