SANITA', LAURA
 Distribuzione geografica
Continente #
AS - Asia 141
EU - Europa 103
NA - Nord America 91
SA - Sud America 1
Totale 336
Nazione #
US - Stati Uniti d'America 87
CN - Cina 86
IE - Irlanda 50
SG - Singapore 44
IT - Italia 17
DE - Germania 9
FI - Finlandia 9
AT - Austria 4
RU - Federazione Russa 4
TR - Turchia 4
CA - Canada 3
RO - Romania 3
HK - Hong Kong 2
NL - Olanda 2
BE - Belgio 1
BY - Bielorussia 1
IN - India 1
IR - Iran 1
IS - Islanda 1
JM - Giamaica 1
KR - Corea 1
PE - Perù 1
PT - Portogallo 1
SK - Slovacchia (Repubblica Slovacca) 1
TH - Thailandia 1
VN - Vietnam 1
Totale 336
Città #
Dublin 50
Guangzhou 32
Singapore 23
Los Angeles 8
Helsinki 7
Ashburn 6
Dallas 6
Beijing 5
Milan 4
New York 4
Bucharest 3
Calgary 3
Cascina 3
Corsico 3
Vienna 3
Ferrara 2
Frankfurt am Main 2
Hong Kong 2
Moscow 2
Munich 2
Nuremberg 2
Tianjin 2
Amsterdam 1
Bonndorf 1
Bratislava 1
Brussels 1
Dimapur 1
Eindhoven 1
Espoo 1
Florence 1
Ho Chi Minh City 1
Ivanovo 1
Lappeenranta 1
Lima 1
Lisbon 1
Minsk 1
Phoenix 1
Reykjavik 1
Rome 1
San Giuliano Milanese 1
Secaucus 1
Seoul 1
Tehran 1
Yekaterinburg 1
Totale 196
Nome #
Integer programming and combinatorial optimization : 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings 40
Node connectivity augmentation via iterative randomized rounding 38
Stabilizing weighted graphs 32
An efficient characterization of submodular spanning tree games 31
Pivot rules for circuit-augmentation algorithms in linear optimization 25
0/1 Polytopes with quadratic Chvátal rank 20
0/1 polytopes with quadratic Chvátal rank 19
Fast approximation algorithms for the generalized survivable network design problem 13
An LMP O(log n)-approximation algorithm for nodeweighted prize collecting steiner tree 12
Exponentiality of the exchange algorithm for finding another room-partitioning 11
An improved LP-based approximation for steiner tree 10
Approximate deadline-scheduling with precedence constraints 10
Better approximation algorithms for technology diffusion 9
Finding small stabilizers for unstable graphs 9
Finding small stabilizers for unstable graphs 9
An exact algorithm for robust network design 9
Lehman's theorem and the directed Steiner tree problem 9
Algorithms for inverse optimization problems 9
Approximating weighted tree augmentation via Chvátal-Gomory cuts 9
An efficient characterization of submodular spanning tree games 8
From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk 8
Finding the closest ultrametric 8
Improved region-growing and combinatorial algorithms for κ-route cut problems 7
Stable routing under the Spanning Tree Protocol 6
Network design with a discrete set of traffic matrices 6
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree 6
Stabilizing network bargaining games by blocking players 6
Stable routing and unique-max coloring on trees 6
The VPN problem with concave costs 6
Local restoration for trees and arborescences 6
On the circuit diameter of some combinatorial polytopes 6
On the complexity of the asymmetric VPN problem 6
On finding another room-partitioning of the vertices 5
Opposite elements in clutters 5
Steiner tree approximation via iterative randomized rounding 5
The school bus problem on trees 5
On the approximability of two capacitated vehicle routing problems 5
The school bus problem on trees 5
The capacitated orienteering problem 5
The interval constrained 3-coloring problem 5
Set covering with ordered replacement: additive and multiplicative gaps 5
On the existence of compact ε-approximated formulations for knapsack in the original space 5
Single-sink fractionally subadditive network design 4
The diameter of the fractional matching polytope and its hardness implications 4
Stabilizing network bargaining games by blocking players 4
Totale 471
Categoria #
all - tutte 4.192
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 4.192


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2022/202383 0 0 0 0 0 0 24 0 50 4 2 3
2023/2024209 1 6 6 3 13 9 7 4 1 28 86 45
2024/2025179 89 7 30 10 43 0 0 0 0 0 0 0
Totale 471