 | 2009 |
|---|
| 79 |       | Davide Bilò,
Michael Gatto,
Luciano Gualà,
Guido Proietti,
Peter Widmayer:
Stability of Networks in Stretchable Graphs.
SIROCCO 2009: 100-112 |
| 78 | | Davide Bilò,
Luciano Gualà,
Guido Proietti:
Dynamic mechanism design.
Theor. Comput. Sci. 410(17): 1564-1572 (2009) |
| 77 | | Paolo Penna,
Guido Proietti,
Peter Widmayer:
Strongly polynomial-time truthful mechanisms in one shot.
Theor. Comput. Sci. 410(17): 1607-1615 (2009) |
| 2008 |
|---|
| 76 | | Davide Bilò,
Luca Forlizzi,
Guido Proietti:
Approximating the Metric TSP in Linear Time.
WG 2008: 43-54 |
| 75 | | Davide Bilò,
Luciano Gualà,
Guido Proietti,
Peter Widmayer:
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.
WINE 2008: 251-262 |
| 74 | | Hans-Joachim Böckenhauer,
Dirk Bongartz,
Juraj Hromkovic,
Ralf Klasing,
Guido Proietti,
Sebastian Seibert,
Walter Unger:
On k-connectivity problems with sharpened triangle inequality.
J. Discrete Algorithms 6(4): 605-617 (2008) |
| 73 | | Davide Bilò,
Guido Proietti:
On the complexity of minimizing interference in ad-hoc and sensor networks.
Theor. Comput. Sci. 402(1): 43-55 (2008) |
| 2007 |
|---|
| 72 | | Davide Bilò,
Jörg Derungs,
Luciano Gualà,
Guido Proietti,
Peter Widmayer:
Locating Facilities on a Network to Minimize Their Average Service Radius.
ISAAC 2007: 587-598 |
| 71 | | Davide Bilò,
Luca Forlizzi,
Luciano Gualà,
Guido Proietti:
An algorithm composition scheme preserving monotonicity.
PODC 2007: 360-361 |
| 70 | | Davide Bilò,
Luca Forlizzi,
Luciano Gualà,
Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems.
WINE 2007: 503-514 |
| 69 | | Luciano Gualà,
Guido Proietti:
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem.
Algorithmica 49(3): 171-191 (2007) |
| 68 | | Luciano Gualà,
Guido Proietti:
Efficient truthful mechanisms for the single-source shortest paths tree problem.
Concurrency and Computation: Practice and Experience 19(17): 2285-2297 (2007) |
| 67 | | Aleksej Di Salvo,
Guido Proietti:
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor.
Theor. Comput. Sci. 383(1): 23-33 (2007) |
| 2006 |
|---|
| 66 | | Davide Bilò,
Guido Proietti:
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks.
ALGOSENSORS 2006: 13-24 |
| 65 | | Davide Bilò,
Luciano Gualà,
Guido Proietti:
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem.
CAAN 2006: 19-30 |
| 64 | | Hans-Joachim Böckenhauer,
Luca Forlizzi,
Juraj Hromkovic,
Joachim Kneis,
Joachim Kupke,
Guido Proietti,
Peter Widmayer:
Reusing Optimal TSP Solutions for Locally Modified Input Instances.
IFIP TCS 2006: 251-270 |
| 63 | | Guido Proietti,
Peter Widmayer:
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii.
ISAAC 2006: 578-587 |
| 62 | | Davide Bilò,
Luciano Gualà,
Guido Proietti:
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.
SIROCCO 2006: 295-309 |
| 61 | | Davide Bilò,
Luciano Gualà,
Guido Proietti:
Dynamic Mechanism Design.
WINE 2006: 3-15 |
| 60 | | Paolo Penna,
Guido Proietti,
Peter Widmayer:
Strongly Polynomial-Time Truthful Mechanisms in One Shot.
WINE 2006: 377-388 |
| 59 | | Luca Forlizzi,
Juraj Hromkovic,
Guido Proietti,
Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems.
Algorithmic Operations Research 1(1): (2006) |
| 58 | | Enrico Nardelli,
Guido Proietti:
Efficient unbalanced merge-sort.
Inf. Sci. 176(10): 1321-1337 (2006) |
| 57 | | Carlo Gaibisso,
Guido Proietti,
Richard B. Tan:
Efficient management of transient station failures in linear radio communication networks with bases.
J. Parallel Distrib. Comput. 66(4): 556-565 (2006) |
| 2005 |
|---|
| 56 | | Luciano Gualà,
Guido Proietti:
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals.
COCOON 2005: 390-400 |
| 55 | | Luciano Gualà,
Guido Proietti:
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem.
Euro-Par 2005: 941-951 |
| 54 | | Davide Bilò,
Guido Proietti:
Range Augmentation Problems in Static Ad-Hoc Wireless Networks.
SIROCCO 2005: 49-64 |
| 53 | | Luca Forlizzi,
Juraj Hromkovic,
Guido Proietti,
Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems.
SOFSEM 2005: 147-156 |
| 52 | | Guido Proietti,
Peter Widmayer:
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem.
SPAA 2005: 195-202 |
| 2004 |
|---|
| 51 |  | Giovanna Melideo,
Paolo Penna,
Guido Proietti,
Roger Wattenhofer,
Peter Widmayer:
Truthful Mechanisms for Generalized Utilitarian Problems.
IFIP TCS 2004: 167-180 |
| 50 | | Davide Bilò,
Guido Proietti:
Augmenting the Edge-Connectivity of a Spider Tree.
ISAAC 2004: 159-171 |
| 49 | | Aleksej Di Salvo,
Guido Proietti:
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor.
SIROCCO 2004: 99-110 |
| 48 | | Davide Bilò,
Guido Proietti:
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path.
WAOA 2004: 181-196 |
| 47 | | Michele Conforti,
Anna Galluccio,
Guido Proietti:
Edge-Connectivity Augmentation and Network Matrices.
WG 2004: 355-364 |
| 46 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures.
Algorithmica 40(2): 119-132 (2004) |
| 45 | | Hans-Joachim Böckenhauer,
Dirk Bongartz,
Juraj Hromkovic,
Ralf Klasing,
Guido Proietti,
Sebastian Seibert,
Walter Unger:
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci. 326(1-3): 137-153 (2004) |
| 2003 |
|---|
| 44 | | Hans-Joachim Böckenhauer,
Dirk Bongartz,
Juraj Hromkovic,
Ralf Klasing,
Guido Proietti,
Sebastian Seibert,
Walter Unger:
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.
CIAC 2003: 189-200 |
| 43 | | Carlo Gaibisso,
Guido Proietti,
Richard B. Tan:
Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs.
COCOON 2003: 404-414 |
| 42 | | Vittorio Bilò,
Adriano Di Pasquale,
Fabio Fioravanti,
Michele Flammini,
Luca Forlizzi,
Francesco Lo Presti,
Giovanna Melideo,
Enrico Nardelli,
Alfredo Navarra,
Guido Proietti:
Quality of Service in Wireless Networks.
IPDPS 2003: 224 |
| 41 | | Adriano Di Pasquale,
Luca Forlizzi,
Christian S. Jensen,
Yannis Manolopoulos,
Enrico Nardelli,
Dieter Pfoser,
Guido Proietti,
Simonas Saltenis,
Yannis Theodoridis,
Theodoros Tzouramanis,
Michael Vassilakopoulos:
Access Methods and Query Processing Techniques.
Spatio-Temporal Databases: The CHOROCHRONOS Approach 2003: 203-261 |
| 40 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast.
Algorithmica 35(1): 56-74 (2003) |
| 39 | | Anna Galluccio,
Guido Proietti:
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems.
Algorithmica 36(4): 361-374 (2003) |
| 38 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
Finding the most vital node of a shortest path.
Theor. Comput. Sci. 296(1): 167-177 (2003) |
| 2002 |
|---|
| 37 | | Hans-Joachim Böckenhauer,
Dirk Bongartz,
Juraj Hromkovic,
Ralf Klasing,
Guido Proietti,
Sebastian Seibert,
Walter Unger:
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.
FSTTCS 2002: 59-70 |
| 36 | | Anna Galluccio,
Guido Proietti:
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.
ISAAC 2002: 150-162 |
| 35 | | Adriano Di Pasquale,
Enrico Nardelli,
Guido Proietti:
An Improved Upper Bound for Scalable Distributed Search Trees.
WDAS 2002: 15-28 |
| 2001 |
|---|
| 34 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
Finding the Most Vital Node of a Shortest Path.
COCOON 2001: 278-287 |
| 33 | | Anna Galluccio,
Guido Proietti:
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths.
ISAAC 2001: 345-354 |
| 32 | | Yannis Manolopoulos,
Enrico Nardelli,
Guido Proietti,
Eleni Tousidou:
A generalized comparison of linear representations of thematic layers.
Data Knowl. Eng. 37(1): 1-23 (2001) |
| 31 | | Michele Flammini,
Enrico Nardelli,
Guido Proietti:
ATM layouts with bounded hop count and congestion.
Distributed Computing 14(2): 65-73 (2001) |
| 30 | | Guido Proietti,
Christos Faloutsos:
Accurate Modeling of Region Data.
IEEE Trans. Knowl. Data Eng. 13(6): 874-883 (2001) |
| 29 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
A faster computation of the most vital edge of a shortest path.
Inf. Process. Lett. 79(2): 81-85 (2001) |
| 28 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures.
J. Graph Algorithms Appl. 5(5): 39-57 (2001) |
| 2000 |
|---|
| 27 | | Michele Flammini,
Enrico Nardelli,
Guido Proietti,
Paul G. Spirakis:
SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000
Carleton Scientific 2000 |
| 26 | | Enrico Nardelli,
Guido Proietti:
Size Estimation of the Intersection Join between Two Line Segment Datasets.
ADBIS-DASFAA 2000: 229-238 |
| 25 | | Guido Proietti:
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees.
Algorithm Engineering 2000: 207-217 |
| 24 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
Maintaining a Minimum Spanning Tree Under Transient Node Failures.
ESA 2000: 346-355 |
| 23 | | Guido Proietti,
Christos Faloutsos:
Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree.
IEEE Trans. Knowl. Data Eng. 12(5): 751-762 (2000) |
| 22 | | Enrico Nardelli,
Guido Proietti:
An efficient spatial access method for spatial images containing multiple non-overlapping features.
Inf. Syst. 25(8): 553-568 (2000) |
| 1999 |
|---|
| 21 | | Enrico Nardelli,
Guido Proietti:
S*-Tree: An Improved S+-Tree for Coloured Images.
ADBIS 1999: 156-167 |
| 20 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
How to Swap a Failing Edge of a Single Source Shortest Paths Tree.
COCOON 1999: 144-153 |
| 19 | | Guido Proietti,
Christos Faloutsos:
I/O Complexity for Range Queries on Region Data Stored Using an R-tree.
ICDE 1999: 628-635 |
| 18 | | Yihong Gong,
Guido Proietti,
David LaRose:
A Robust Image Mosaicing Technique Capable of Creating Integrated Panoramas.
IV 1999: 24- |
| 17 | | Guido Proietti:
An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks.
Acta Inf. 36(4): 257-266 (1999) |
| 16 | | Enrico Nardelli,
Guido Proietti:
Probabilistic models for images and quadtrees: differences and equivalences.
Image Vision Comput. 17(9): 659-665 (1999) |
| 15 | | Carlo Gaibisso,
Enrico Nardelli,
Guido Proietti:
Intersection Reporting on Two Collections of Disjoint Sets.
Inf. Sci. 114(1-4): 41-52 (1999) |
| 1998 |
|---|
| 14 | | Guido Proietti,
Christos Faloutsos:
Selectivity Estimation of Window Queries.
CIKM 1998: 340-347 |
| 13 | | Yihong Gong,
Guido Proietti,
Christos Faloutsos:
Image Indexing and Retrieval Based on Human Perceptual Color Clustering.
CVPR 1998: 578-585 |
| 12 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures.
ESA 1998: 55-66 |
| 11 | | Enrico Nardelli,
Guido Proietti,
Peter Widmayer:
Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes.
Inf. Process. Lett. 67(1): 51-54 (1998) |
| 1997 |
|---|
| 10 | | Carlo Gaibisso,
Guido Proietti:
Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary.
SOFSEM 1997: 399-406 |
| 9 | | Michele Flammini,
Enrico Nardelli,
Guido Proietti:
ATM Layouts with Bounded Hop Count and Congestion.
WDAG 1997: 52-65 |
| 8 | | Enrico Nardelli,
Guido Proietti:
Time and Space Efficient Secondary Memory Representation of Quadtrees.
Inf. Syst. 22(1): 25-37 (1997) |
| 7 | | Yannis Manolopoulos,
Enrico Nardelli,
Apostolos Papadopoulos,
Guido Proietti:
MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features.
Inf. Syst. 22(8): 465-481 (1997) |
| 1996 |
|---|
| 6 | | Carlo Gaibisso,
Enrico Nardelli,
Guido Proietti:
An Output Sensitive Solution to the Set Union and Intersection Problem.
SOFSEM 1996: 351-358 |
| 5 | | Yannis Manolopoulos,
Enrico Nardelli,
Guido Proietti,
Michael Vassilakopoulos:
On the creation of quadtrees by using a branching process.
Image Vision Comput. 14(2): 159-164 (1996) |
| 1995 |
|---|
| 4 | | Yannis Manolopoulos,
Enrico Nardelli,
Guido Proietti,
Michael Vassilakopoulos:
On the Generation of Aggregated Random Spatial Regions.
CIKM 1995: 318-325 |
| 3 | | Enrico Nardelli,
Guido Proietti:
Efficient Secondary Memory Processing of Window Queries on Spatial Data.
Inf. Sci. 84(1&2): 67-83 (1995) |
| 1994 |
|---|
| 2 | | Enrico Nardelli,
Guido Proietti:
An Accurate Model for Quadtrees Representing Noiseless Images of Spatial Data.
ICIP (2) 1994: 610-614 |
| 1 | | Enrico Nardelli,
Guido Proietti:
A Hybrid Pointerless Representation of Quadtrees for Efficient Processing of Window Queries.
IGIS 1994: 259-269 |
