Naviga IRIS

Sfoglia per Serie LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS

Ordina per:

In ordine:

Risultati/Pagina

Vai a: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

o inserisci le iniziali:

Mostrati risultati da 1 a 10 di 10

2018-01-01 Bilo, D.

2020-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G.

2020-01-01 Bilò, D.; Friedrich, T.; Lenzner, P.; Melnichenko, A.; Molitor, L.

2021-01-01 Bilò, D.; Cohen, S.; Friedrich, T.; Schirneck, M.

2018-01-01 Bilo, D.

2018-01-01 Bilo, D.; Papadopoulos, K.

2018-01-01 Bilo, D.; Guala, L.; Leucci, S.; Misra, N.

2018-01-01 Bilo, D.; Guala, L.; Leucci, S.; Proietti, G.; Rossi, M.

2021-01-01 Bilò, D.; Cohen, S.; Friedrich, T.; Schirneck, M.

2020-01-01 Bilò, D.; Bilò, V.; Lenzner, P.; Molitor, L.

Titolo	Data di pubblicazione	Autore(i)
Almost optimal algorithms for diameter-optimally augmenting trees	1-gen-2018	Bilo, D.
Cutting bamboo down to size	1-gen-2020	Bilò, D.; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G.
Fair tree connection games with topology-dependent edge cost	1-gen-2020	Bilò, D.; Friedrich, T.; Lenzner, P.; Melnichenko, A.; Molitor, L.
Near-optimal deterministic single-source distance sensitivity oracles	1-gen-2021	Bilò, D.; Cohen, S.; Friedrich, T.; Schirneck, M.
New algorithms for Steiner tree reoptimization	1-gen-2018	Bilo, D.
A novel algorithm for the all-best-swap-edge problem on tree spanners	1-gen-2018	Bilo, D.; Papadopoulos, K.
On the complexity of two dots for narrow boards and few colors	1-gen-2018	Bilo, D.; Guala, L.; Leucci, S.; Misra, N.
On the PSPACE - Completeness of peg duotaire and other peg-jumping games	1-gen-2018	Bilo, D.; Guala, L.; Leucci, S.; Proietti, G.; Rossi, M.
Space-Efficient Fault-Tolerant Diameter Oracles	1-gen-2021	Bilò, D.; Cohen, S.; Friedrich, T.; Schirneck, M.
Topological influence and locality in swap schelling games	1-gen-2020	Bilò, D.; Bilò, V.; Lenzner, P.; Molitor, L.

Mostrati risultati da 1 a 10 di 10