Search results for "Davide Bilò"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Davide Bilò, Luciano Gualà, Guido Proietti	Improved approximability and non-approximability results for graph diameter decreasing problems.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
1	Anna Zych, Davide Bilò	New Reoptimization Techniques applied to Steiner Tree Problem.	Electronic Notes in Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych	Reoptimization of the Shortest Common Superstring Problem.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Davide Bilò, Luciano Gualà, Guido Proietti	Bounded-Distance Network Creation Games	CoRR	2011	DBLP BibTeX RDF
1	Davide Bilò, Luca Forlizzi, Guido Proietti	Approximating the Metric TSP in Linear Time.	Theory Comput. Syst.	2011	DBLP DOI BibTeX RDF
1	Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti	Network Verification via Routing Table Queries.	SIROCCO	2011	DBLP DOI BibTeX RDF
1	Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer	Discovery of network properties with all-shortest-paths queries.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti	Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game.	WINE	2010	DBLP DOI BibTeX RDF
1	Davide Bilò, Luciano Gualà, Guido Proietti	Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems.	MFCS	2010	DBLP DOI BibTeX RDF
1	Davide Bilò, Luciano Gualà, Guido Proietti	Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.	MFCS	2010	DBLP DOI BibTeX RDF
1	Davide Bilò, Luciano Gualà, Guido Proietti	Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game.	Electronic Colloquium on Computational Complexity (ECCC)	2009	DBLP BibTeX RDF
1	Davide Bilò, Luciano Gualà, Guido Proietti	Dynamic mechanism design.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer	Reconstructing Visibility Graphs with Simple Robots.	SIROCCO	2009	DBLP DOI BibTeX RDF
1	Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer	Stability of Networks in Stretchable Graphs.	SIROCCO	2009	DBLP DOI BibTeX RDF
1	Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych	Reoptimization of the Shortest Common Superstring Problem.	CPM	2009	DBLP DOI BibTeX RDF
1	Davide Bilò, Guido Proietti	On the complexity of minimizing interference in ad-hoc and sensor networks.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti	Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems.	Internet Mathematics	2008	DBLP DOI BibTeX RDF
1	Davide Bilò, Luca Forlizzi, Guido Proietti	Approximating the Metric TSP in Linear Time.	WG	2008	DBLP DOI BibTeX RDF	Metric Graphs, Linear-time Approximation Algorithms, NP-hardness, Traveling Salesman Problem
1	Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer	Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.	WINE	2008	DBLP DOI BibTeX RDF	Network Pricing Games, Communication Networks, Stackelberg Games, Shortest Paths Tree
1	Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych	Reoptimization of Steiner Trees.	SWAT	2008	DBLP DOI BibTeX RDF
1	Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer	Discovery of Network Properties with All-Shortest-Paths Queries.	SIROCCO	2008	DBLP DOI BibTeX RDF
1	Davide Bilò, Peter Widmayer, Anna Zych	Reoptimization of Weighted Graph and Covering Problems.	WAOA	2008	DBLP DOI BibTeX RDF
1	Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti	Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems.	WINE	2007	DBLP DOI BibTeX RDF	Graph Traversal Problems, Approximate Truthful Mechanisms, Algorithmic Mechanism Design, Selfish Agents
1	Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti	An algorithm composition scheme preserving monotonicity.	PODC	2007	DBLP DOI BibTeX RDF	step-integral monotonicity, algorithmic mechanism design, selfish agents, truthful mechanisms
1	Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer	Locating Facilities on a Network to Minimize Their Average Service Radius.	ISAAC	2007	DBLP DOI BibTeX RDF	Graph radius, Graph treewidth, NP-hardness, Graph partition, Facility location problems
1	Davide Bilò, Luciano Gualà, Guido Proietti	Dynamic Mechanism Design.	WINE	2006	DBLP DOI BibTeX RDF	On-line Problems, Approximate Mechanisms, Dynamic Algorithms, Algorithmic Mechanism Design
1	Davide Bilò, Luciano Gualà, Guido Proietti	On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.	SIROCCO	2006	DBLP DOI BibTeX RDF
1	Davide Bilò, Guido Proietti	On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks.	ALGOSENSORS	2006	DBLP DOI BibTeX RDF
1	Davide Bilò, Luciano Gualà, Guido Proietti	Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem.	CAAN	2006	DBLP DOI BibTeX RDF	Multi-parameter Agents, Bicriteria Network Design, Truthful Single-Minded Mechanisms, Algorithmic Mechanism Design
1	Davide Bilò, Guido Proietti	Range Augmentation Problems in Static Ad-Hoc Wireless Networks.	SIROCCO	2005	DBLP DOI BibTeX RDF	Connectivity Augmentation, Approximation Algorithms, Radio Networks, Network Survivability
1	Davide Bilò, Guido Proietti	A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path.	WAOA	2004	DBLP DOI BibTeX RDF
1	Davide Bilò, Guido Proietti	Augmenting the Edge-Connectivity of a Spider Tree.	ISAAC	2004	DBLP DOI BibTeX RDF	Edge-Connectivity Augmentation, Spider Tress, Graph Algorithms, NP-hardness, Network Survivability

Publications of "Davide Bilò" ( http://dblp.L3S.de/Authors/Davide_Bilò )