Sfoglia per Serie LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS
13th International Conference on Spatial Information Theory
2017-01-01 Clementini, Eliseo; Donnelly, Maureen; Yuan, May; Kray, Christian; Fogliaroni, Paolo; Ballatore, Andrea
Almost Envy-Free Allocations with Connected Bundles
2019-01-01 Bilò, Vittorio; Caragiannis, Ioannis; Flammini, Michele; Igarashi, Ayumi; Monaco, Gianpiero; Peters, Dominik; Cosimo, Vinci; Zwicker, William S.
Almost optimal algorithms for diameter-optimally augmenting trees
2018-01-01 Bilò, Davide
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances
2022-01-01 Bilo', D.; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M.
Digraph k-Coloring Games: From Theory to Practice
2022-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero
Dual-mode greedy algorithms can save energy
2019-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.; Proietti, G.
Fair tree connection games with topology-dependent edge cost
2020-01-01 Bilò, Davide; Friedrich, T.; Lenzner, P.; Melnichenko, A.; Molitor, L.
Fault-Tolerant ST-Diameter Oracles
2023-01-01 Bilo', Davide; Keerti, Choudhary; Sarel, Cohen; Tobias, Friedrich; Simon, Krogmann; Martin, Schirneck
Fixed-Parameter Sensitivity Oracles
2022-01-01 Bilò, Davide; Casel, K.; Choudhary, K.; Cohen, S.; Friedrich, T.; Lagodzinski, J. A. G.; Schirneck, M.; Wietheger, S.
Generalized budgeted submodular set function maximization
2018-01-01 Cellinese, Francesco; D'Angelo, Gianlorenzo; Monaco, Gianpiero; Velaj, Yllka
Near-optimal deterministic single-source distance sensitivity oracles
2021-01-01 Bilò, Davide; Cohen, S.; Friedrich, T.; Schirneck, M.
New algorithms for Steiner tree reoptimization
2018-01-01 Bilò, Davide
A novel algorithm for the all-best-swap-edge problem on tree spanners
2018-01-01 Bilò, Davide; Papadopoulos, K.
On the complexity of two dots for narrow boards and few colors
2018-01-01 Bilo', Davide; Gualà, L.; Leucci, S.; Misra, N.
On the tree conjecture for the network creation game
2018-01-01 Bilò, Davide; Lenzner, P.
Optimal dislocation with persistent errors in subquadratic time
2018-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.
Optimal sorting with persistent comparison errors
2019-01-01 Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.
Pricing Problems with Buyer Preselection
2018-01-01 Bilò, Vittorio; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca
Resilient dictionaries for randomly unreliable memory
2019-01-01 Leucci, S.; Liu, C. -H.; Meierhans, S.
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
2021-01-01 Guala, L.; Leucci, S.; Ziccardi, I.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| 13th International Conference on Spatial Information Theory | 1-gen-2017 | Clementini, Eliseo; Donnelly, Maureen; Yuan, May; Kray, Christian; Fogliaroni, Paolo; Ballatore, Andrea | |
| Almost Envy-Free Allocations with Connected Bundles | 1-gen-2019 | Bilò, Vittorio; Caragiannis, Ioannis; Flammini, Michele; Igarashi, Ayumi; Monaco, Gianpiero; Peters, Dominik; Cosimo, Vinci; Zwicker, William S. | |
| Almost optimal algorithms for diameter-optimally augmenting trees | 1-gen-2018 | Bilò, Davide | |
| Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances | 1-gen-2022 | Bilo', D.; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M. | |
| Digraph k-Coloring Games: From Theory to Practice | 1-gen-2022 | D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero | |
| Dual-mode greedy algorithms can save energy | 1-gen-2019 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P.; Proietti, G. | |
| Fair tree connection games with topology-dependent edge cost | 1-gen-2020 | Bilò, Davide; Friedrich, T.; Lenzner, P.; Melnichenko, A.; Molitor, L. | |
| Fault-Tolerant ST-Diameter Oracles | 1-gen-2023 | Bilo', Davide; Keerti, Choudhary; Sarel, Cohen; Tobias, Friedrich; Simon, Krogmann; Martin, Schirneck | |
| Fixed-Parameter Sensitivity Oracles | 1-gen-2022 | Bilò, Davide; Casel, K.; Choudhary, K.; Cohen, S.; Friedrich, T.; Lagodzinski, J. A. G.; Schirneck, M.; Wietheger, S. | |
| Generalized budgeted submodular set function maximization | 1-gen-2018 | Cellinese, Francesco; D'Angelo, Gianlorenzo; Monaco, Gianpiero; Velaj, Yllka | |
| Near-optimal deterministic single-source distance sensitivity oracles | 1-gen-2021 | Bilò, Davide; Cohen, S.; Friedrich, T.; Schirneck, M. | |
| New algorithms for Steiner tree reoptimization | 1-gen-2018 | Bilò, Davide | |
| A novel algorithm for the all-best-swap-edge problem on tree spanners | 1-gen-2018 | Bilò, Davide; Papadopoulos, K. | |
| On the complexity of two dots for narrow boards and few colors | 1-gen-2018 | Bilo', Davide; Gualà, L.; Leucci, S.; Misra, N. | |
| On the tree conjecture for the network creation game | 1-gen-2018 | Bilò, Davide; Lenzner, P. | |
| Optimal dislocation with persistent errors in subquadratic time | 1-gen-2018 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P. | |
| Optimal sorting with persistent comparison errors | 1-gen-2019 | Geissmann, B.; Leucci, S.; Liu, C. -H.; Penna, P. | |
| Pricing Problems with Buyer Preselection | 1-gen-2018 | Bilò, Vittorio; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca | |
| Resilient dictionaries for randomly unreliable memory | 1-gen-2019 | Leucci, S.; Liu, C. -H.; Meierhans, S. | |
| Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees | 1-gen-2021 | Guala, L.; Leucci, S.; Ziccardi, I. |
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