IRIS
SANITA', LAURA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 112
EU - Europa 88
NA - Nord America 45
Totale 245
Salva come PNG Salva come JPEG
Nazione #
CN - Cina 61
IE - Irlanda 50
SG - Singapore 43
US - Stati Uniti d'America 42
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 245
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
Reykjavik 1
San Giuliano Milanese 1
Tehran 1
Totale 172
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 12
0/1 polytopes with quadratic Chvátal rank 12
Exponentiality of the exchange algorithm for finding another room-partitioning 6
Fast approximation algorithms for the generalized survivable network design problem 4
Better approximation algorithms for technology diffusion 4
An LMP O(log n)-approximation algorithm for nodeweighted prize collecting steiner tree 4
Finding small stabilizers for unstable graphs 4
An improved LP-based approximation for steiner tree 4
Finding small stabilizers for unstable graphs 4
An exact algorithm for robust network design 4
An Efficient Characterization of Submodular Spanning Tree Games 4
Lehman's theorem and the directed Steiner tree problem 4
Approximate Deadline-Scheduling with precedence constraints 4
Algorithms for inverse optimization problems 4
From uncertainty to nonlinearity: Solving virtual private network via single-sink buy-at-bulk 4
The VPN problem with concave costs 4
Approximating weighted tree augmentation via Chvátal-Gomory cuts 4
Finding the closest ultrametric 4
On the circuit diameter of some combinatorial polytopes 4
On finding another room-partitioning of the vertices 3
Steiner tree approximation via iterative randomized rounding 3
Stable routing under the Spanning Tree Protocol 3
Network design with a discrete set of traffic matrices 3
On the approximability of two capacitated vehicle routing problems 3
The school bus problem on trees 3
Stable routing and unique-max coloring on trees 3
The Capacitated Orienteering Problem 3
The interval constrained 3-coloring problem 3
Set covering with ordered replacement: Additive and multiplicative gaps 3
Local restoration for trees and arborescences 3
On the complexity of the asymmetric VPN problem 3
Improved region-growing and combinatorial algorithms for κ-route cut problems 3
Opposite elements in clutters 2
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree 2
The school bus problem on trees 2
Stabilizing network bargaining games by blocking players 2
Single-sink fractionally subadditive network design 2
On the existence of compact ε-approximated formulations for knapsack in the original space 2
The diameter of the fractional matching polytope and its hardness implications 2
Stabilizing network bargaining games by blocking players 2
Totale 301
Salva come PNG Salva come JPEG
Categoria #
all - tutte 2.295
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.295
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/20259 9 0 0 0 0 0 0 0 0 0 0 0
Totale 301