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


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/2024144 1 6 6 3 13 9 7 4 1 28 66 0
Totale 227