Sfoglia per Autore
Reconstructing Visibility Graphs with Simple Robots
2009-01-01 Bilò, Davide; Disser, Yann; Mihalák, Matus; Suri, Subash; Vicari, Elias; Widmayer, Peter
Dynamic mechanism design
2009-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Reoptimization of the Shortest Common Superstring Problem
2009-01-01 Bilò, Davide; BÖCKENHAUER HANS, Joachim; Komm, Dennis; Královic, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna
Improved approximability and non-approximability results for graph diameter decreasing problems
2010-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
2010-01-01 Bilò, Davide; Guala', Luciano; Leucci, Stefano; Proietti, Guido
Discovery of network properties with all-shortest-paths queries
2010-01-01 Bilò, Davide; Erlebach, Thomas; Mihalák, Matús; Widmayer, Peter
Finding best swap edges minimizing the routing cost of a spanning tree
2010-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Approximating the Metric TSP in Linear Time
2011-01-01 Bilò, Davide; Forlizzi, Luca; Proietti, Guido
Network Verification via Routing Table Queries
2011-01-01 Bampas, Evangelos; Bilò, Davide; Drovandi, Guido; Gualà, Luciano; Klasing, Ralf; Proietti, Guido
New reoptimization techniques applied to Steiner tree problem
2011-01-01 Bilò, Davide; Zych, Anna
Reoptimization of the Shortest Common Superstring Problem
2011-01-01 Bilò, Davide; BÖCKENHAUER HANS, Joachim; Komm, Dennis; Královic, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna
The max-distance network creation game on general host graphs
2012-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Reconstructing visibility graphs with simple robots
2012-01-01 Bilò, Davide; Disser, Yann; Mihalak, Matus; Suri, Subash; Vicari, Elias; Widmayer, Peter
Improved approximability and non-approximability results for graph diameter decreasing problems
2012-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Bounded-distance network creation game
2012-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
New advances in reoptimizing the minimum Steiner tree problem
2012-01-01 Bilò, Davide; Zych, Anna
A faster computation of all the best swap edges of a shortest paths tree
2013-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Polygon-constrained motion planning problems
2013-01-01 Bilò, Davide; Disser, Yann; Gualà, Luciano; Mihal'Ak, Matúš; Proietti, Guido; Widmayer, Peter
Exact and approximate algorithms for movement problems on (special classes of) graphs
2013-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
New bounds for the balloon popping problem
2013-01-01 Bilò, Davide; Bilo', Vittorio
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Reconstructing Visibility Graphs with Simple Robots | 1-gen-2009 | Bilò, Davide; Disser, Yann; Mihalák, Matus; Suri, Subash; Vicari, Elias; Widmayer, Peter | |
| Dynamic mechanism design | 1-gen-2009 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| Reoptimization of the Shortest Common Superstring Problem | 1-gen-2009 | Bilò, Davide; BÖCKENHAUER HANS, Joachim; Komm, Dennis; Královic, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna | |
| Improved approximability and non-approximability results for graph diameter decreasing problems | 1-gen-2010 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game | 1-gen-2010 | Bilò, Davide; Guala', Luciano; Leucci, Stefano; Proietti, Guido | |
| Discovery of network properties with all-shortest-paths queries | 1-gen-2010 | Bilò, Davide; Erlebach, Thomas; Mihalák, Matús; Widmayer, Peter | |
| Finding best swap edges minimizing the routing cost of a spanning tree | 1-gen-2010 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| Approximating the Metric TSP in Linear Time | 1-gen-2011 | Bilò, Davide; Forlizzi, Luca; Proietti, Guido | |
| Network Verification via Routing Table Queries | 1-gen-2011 | Bampas, Evangelos; Bilò, Davide; Drovandi, Guido; Gualà, Luciano; Klasing, Ralf; Proietti, Guido | |
| New reoptimization techniques applied to Steiner tree problem | 1-gen-2011 | Bilò, Davide; Zych, Anna | |
| Reoptimization of the Shortest Common Superstring Problem | 1-gen-2011 | Bilò, Davide; BÖCKENHAUER HANS, Joachim; Komm, Dennis; Královic, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna | |
| The max-distance network creation game on general host graphs | 1-gen-2012 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
| Reconstructing visibility graphs with simple robots | 1-gen-2012 | Bilò, Davide; Disser, Yann; Mihalak, Matus; Suri, Subash; Vicari, Elias; Widmayer, Peter | |
| Improved approximability and non-approximability results for graph diameter decreasing problems | 1-gen-2012 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| Bounded-distance network creation game | 1-gen-2012 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| New advances in reoptimizing the minimum Steiner tree problem | 1-gen-2012 | Bilò, Davide; Zych, Anna | |
| A faster computation of all the best swap edges of a shortest paths tree | 1-gen-2013 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| Polygon-constrained motion planning problems | 1-gen-2013 | Bilò, Davide; Disser, Yann; Gualà, Luciano; Mihal'Ak, Matúš; Proietti, Guido; Widmayer, Peter | |
| Exact and approximate algorithms for movement problems on (special classes of) graphs | 1-gen-2013 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
| New bounds for the balloon popping problem | 1-gen-2013 | Bilò, Davide; Bilo', Vittorio |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile