IRIS
SANITA', LAURA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 112
EU - Europa 88
NA - Nord America 46
Totale 246
Salva come PNG Salva come JPEG
Nazione #
CN - Cina 61
IE - Irlanda 50
SG - Singapore 43
US - Stati Uniti d'America 43
IT - Italia 13
DE - Germania 7
FI - Finlandia 7
TR - Turchia 4
CA - Canada 3
RO - Romania 3
AT - Austria 2
HK - Hong Kong 2
NL - Olanda 2
BE - Belgio 1
BY - Bielorussia 1
IN - India 1
IR - Iran 1
IS - Islanda 1
PT - Portogallo 1
Totale 246
Salva come PNG Salva come JPEG
Città #
Dublin 50
Guangzhou 32
Singapore 22
Ashburn 6
Dallas 6
Helsinki 6
Beijing 5
Los Angeles 4
New York 4
Bucharest 3
Calgary 3
Cascina 3
Corsico 3
Milan 3
Ferrara 2
Frankfurt am Main 2
Hong Kong 2
Nuremberg 2
Vienna 2
Amsterdam 1
Bonndorf 1
Brussels 1
Dimapur 1
Eindhoven 1
Florence 1
Lappeenranta 1
Lisbon 1
Minsk 1
Phoenix 1
Reykjavik 1
San Giuliano Milanese 1
Tehran 1
Totale 173
Salva come PNG Salva come JPEG
Nome #
Integer programming and combinatorial optimization : 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings 37
Node connectivity augmentation via iterative randomized rounding 35
An efficient characterization of submodular spanning tree games 29
Stabilizing weighted graphs 27
Pivot rules for circuit-augmentation algorithms in linear optimization 24
0/1 polytopes with quadratic Chvátal rank 15
0/1 Polytopes with quadratic Chvátal rank 14
Exponentiality of the exchange algorithm for finding another room-partitioning 8
Fast approximation algorithms for the generalized survivable network design problem 6
Better approximation algorithms for technology diffusion 6
An LMP O(log n)-approximation algorithm for nodeweighted prize collecting steiner tree 6
Finding small stabilizers for unstable graphs 6
An improved LP-based approximation for steiner tree 6
Finding small stabilizers for unstable graphs 6
An exact algorithm for robust network design 6
An efficient characterization of submodular spanning tree games 6
Lehman's theorem and the directed Steiner tree problem 6
Approximate deadline-scheduling with precedence constraints 6
Algorithms for inverse optimization problems 6
From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk 6
The VPN problem with concave costs 6
Approximating weighted tree augmentation via Chvátal-Gomory cuts 6
Finding the closest ultrametric 6
On the circuit diameter of some combinatorial polytopes 6
On finding another room-partitioning of the vertices 5
Steiner tree approximation via iterative randomized rounding 5
Stable routing under the Spanning Tree Protocol 5
Network design with a discrete set of traffic matrices 5
On the approximability of two capacitated vehicle routing problems 5
The school bus problem on trees 5
Stable routing and unique-max coloring on trees 5
The interval constrained 3-coloring problem 5
Set covering with ordered replacement: additive and multiplicative gaps 5
Local restoration for trees and arborescences 5
On the complexity of the asymmetric VPN problem 5
Improved region-growing and combinatorial algorithms for κ-route cut problems 5
Opposite elements in clutters 4
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree 4
The school bus problem on trees 4
Stabilizing network bargaining games by blocking players 4
Single-sink fractionally subadditive network design 4
The capacitated orienteering problem 4
On the existence of compact ε-approximated formulations for knapsack in the original space 4
The diameter of the fractional matching polytope and its hardness implications 4
Stabilizing network bargaining games by blocking players 4
Totale 381
Salva come PNG Salva come JPEG
Categoria #
all - tutte 2.617
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 2.617
Salva come PNG Salva come JPEG


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/202589 89 0 0 0 0 0 0 0 0 0 0 0
Totale 381