Movatterモバイル変換

[0]ホーム
URL:

×

zbMATH Open — the first resource for mathematics

from until
Reset all

Examples

Simon Donald*Search inall parts of an author's name (results containSimon, Donald M. andDonaldson,Simon Kirwan).
ln: Donald* fn: SimonSearch for specified family (ln) and given (fn) name.
au: Stefan Müller cc:49Combine name search (au) with main MSC fields (cc).
au: Helga BunkeSearch results includename variations, in particularname changes, differenttransliterations andpseudonyms. Names of collectives will be displayed as a separate entity.
(st:r & b) | (st:o)Search results include allreviewers withbiographic information orcollectives.
(en:MGP | wikidata) ln:a*Search results include all authors having either anentry in theMath Genealogy Project or inWikidata and whose family name starts with''A''.
aw: Fields AbelSearch for allFields Medalaward winners who also received anAbel Prize. The& operator is default and ommitted here.

Fields

ai zbMATH author ID
any Includes ai, au, aw, cc
au Author name
aw Name of an award (to find laureates)
cc Main Fields of the author (given by first two MSC digits)
cm Name of a collective (to find members of this collective)
co Name of an author (to find collectives the author is a member of)
en External author ID: ORCID, MGP, Wikidata object number and others
fn First name
ln Last name
py Year(s) in which the author has published. Interval search with “-”
rv Reviewer ID
st State: has biographic references (st:b), is cited (st:c), is collective (st:o), has references (st:r)

Operators

a & bLogical and (default)
a | bLogical or
!abLogical not
abc*Right wildcard
ab cPhrase
(ab c)Term grouping

See also ourGeneral Help.



Grandoni, Fabrizio

Author ID:
grandoni.fabrizio Recent zbMATH articles by "Grandoni, Fabrizio"
Published as:
Grandoni, Fabrizio;Grandoni, F.
alltop 5

Co-Authors

2single-authored
13 Fomin, Fedor V.
12 Italiano, Giuseppe Francesco
12 Leonardi, Stefano
11 Wiese, Andreas
10 Ameli, Afrouz Jabal
9 Rothvoß, Thomas
8 Kratsch, Dieter
7 Eisenbrand, Friedrich
7 Finocchi, Irene
7 Gálvez, Waldo
6 Cygan, Marek
6 Panconesi, Alessandro
6 Sankowski, Piotr
5 Anagnostopoulos, Aris
5 Khan, Arindam
5 Mömke, Tobias
5 Vassilevska Williams, Virginia
4 Byrka, Jarosław
4 Könemann, Jochen
4 Laekhanukit, Bundit
4 Oriolo, Gianpaolo
4 Sanità, Laura
4 Saurabh, Saket
4 Schafer, Guido
3 Abboud, Amir
3 Chandran, L. Sunil
3 Ingala, Salvatore
3 Lokshtanov, Daniel
3 Pyatkin, Artëm Valer'evich
3 Saha, Barna
3 Schwiegelshohn, Chris
3 Singh, Mohit
3 Skutella, Martin
3 Stepanov, Alexey A.
3 Zenklusen, Rico
3 Zhou, Hang
2 Adamczyk, Marek
2 Berger, André
2 Bhattacharya, Sayan
2 Bonifaci, Vincenzo
2 Bosch-Calvo, Miguel
2 De Santis, Emilio
2 Demaine, Erik D.
2 Díaz, Josep
2 Hermelin, Danny
2 Jansen, Klaus
2 Krysta, Piotr
2 Li, Shi
2 Marchetti-Spaccamela, Alberto
2 Pilipczuk, Marcin L.
2 Rau, Malin
2 Ravi, Ramamoorthi
2 Solomon, Shay
2 Sornat, Krzysztof
2 Sozio, Mauro
2 Ventre, Carmine
2 Włodarczyk, Michał
1 Addanki, Raghavendra
1 Bärtschi, Andreas
1 Becchetti, Luca
1 Bhattacharyya, Arnab
1 Bilò, Davide
1 Bodwin, Greg
1 Bringmann, Karl
1 Bury, Marc
1 Chalermsook, Parinya
1 Cheriyan, Joseph
1 Chris, Schwiegelshohn
1 Cohen-Addad Viallat, Vincent
1 Cohen-Addad, Vincent
1 Dippel, Jack
1 Fagerberg, Rolf
1 Ferraro-Petrillo, Umberto
1 Garg, Mohit
1 Grandoni, Fabrizio
1 Gualà, Luciano
1 Gupta, Anupam
1 Herman, Grzegorz
1 Heydrich, Sandy
1 Hommelsheim, Felix
1 Jabal, Ameli Afrouz
1 Jørgensen, Allan Grønlund
1 Kaibel, Volker
1 Kalaitzis, Christos
1 Kavitha, Telikepalli
1 Khodamoradi, Kamyar
1 Kociumaka, Tomasz
1 Kratsch, Stefan
1 Kulkarni, Janardhan
1 Lee, Euiwoong
1 Leucci, Stefano
1 Lindermayr, Alexander
1 Liu, Quanquan C.
1 Łukasiewicz, Aleksander
1 Mastrolilli, Monaldo
1 Mathieu, Claire
1 Miettinen, Pauli
1 Mølhave, Thomas
1 Moruz, Gabriel
1 Mucha, Marcin
...and 22 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

110 Publications have been cited 1,308 times in965 DocumentsCited by ▼Year ▼
Steiner tree approximation via iterative randomized rounding. Zbl 1281.68234
Byrka, Jarosław;Grandoni, Fabrizio;Rothvoss, Thomas;Sanità, Laura
2013
A measure & conquer approach for the analysis of exact algorithms. Zbl 1325.68311
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2009
An improved LP-based approximation for Steiner tree. Zbl 1293.05039
Byrka, Jaroslaw;Grandoni, Fabrizio;Rothvoß, Thomas;Sanità, Laura
2010
On the complexity of fixed parameter clique and dominating set. Zbl 1071.68030
Eisenbrand, Friedrich;Grandoni, Fabrizio
2004
Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. Zbl 1445.05101
Fomin, Fedor V.;Grandoni, Fabrizio;Pyatkin, Artem V.;Stepanov, Alexey A.
2008
Measure and conquer: Domination – a case study. Zbl 1082.68866
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2005
Solving connected dominating set faster than \(2^n\). Zbl 1170.68030
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2008
Subcubic equivalences between graph centrality problems, APSP and diameter. Zbl 1371.68203
Abboud, Amir;Grandoni, Fabrizio;Williams, Virginia Vassilevska
2015
Measure and conquer: a simple \(O(2^{0.288n})\) independent set algorithm. Zbl 1192.68960
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2006
New approaches to multi-objective optimization. Zbl 1297.90147
Grandoni, Fabrizio;Ravi, R.;Singh, Mohit;Zenklusen, Rico
2014
Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Zbl 1223.05222
Berger, André;Bonifaci, Vincenzo;Grandoni, Fabrizio;Schäfer, Guido
2011
Improved approximation for tree augmentation: saving by rewiring. Zbl 1429.68190
Grandoni, Fabrizio;Kalaitzis, Christos;Zenklusen, Rico
2018
Some new techniques in design and analysis of exact (exponential) algorithms. Zbl 1169.68669
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2005
How to sell hyperedges: the hypermatching assignment problem. Zbl 1425.90053
Cygan, Marek;Grandoni, Fabrizio;Mastrolilli, Monaldo
2013
A note on the complexity of minimum dominating set. Zbl 1127.05070
Grandoni, Fabrizio
2006
On pairwise spanners. Zbl 1354.05131
Cygan, Marek;Grandoni, Fabrizio;Kavitha, Telikepalli
2013
Sharp separation and applications to exact and parameterized algorithms. Zbl 1236.68090
Fomin, Fedor V.;Grandoni, Fabrizio;Lokshtanov, Daniel;Saurabh, Saket
2012
Connected facility location via random facility sampling and core detouring. Zbl 1208.68236
Eisenbrand, Friedrich;Grandoni, Fabrizio;Rothvoß, Thomas;Schäfer, Guido
2010
A mazing \(2+\varepsilon\) approximation for unsplittable flow on a path. Zbl 1422.68279
Anagnostopoulos, Aris;Grandoni, Fabrizio;Leonardi, Stefano;Wiese, Andreas
2014
Approximating connected facility location problems via random facility sampling and core detouring. Zbl 1192.90103
Eisenbrand, Friedrich;Grandoni, Fabrizio;Rothvoß, Thomas;Schäfer, Guido
2008
Refined memorization for vertex cover. Zbl 1173.68529
Chandran, L. Sunil;Grandoni, Fabrizio
2005
Improved purely additive fault-tolerant spanners. Zbl 1465.68205
Bilò, Davide;Grandoni, Fabrizio;Gualà, Luciano;Leucci, Stefano;Proietti, Guido
2015
\(O(\log^2 k/\log\log k)\)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. Zbl 1433.68614
Grandoni, Fabrizio;Laekhanukit, Bundit;Li, Shi
2019
Oblivious dimension reduction for \(k\)-means: beyond subspaces and the Johnson-Lindenstrauss lemma. Zbl 1433.68324
Becchetti, Luca;Bury, Marc;Cohen-Addad, Vincent;Grandoni, Fabrizio;Schwiegelshohn, Chris
2019
Improved approximation for single-sink buy-at-bulk. Zbl 1135.90422
Grandoni, Fabrizio;Italiano, Giuseppe F.
2006
Preserving distances in very faulty graphs. Zbl 1441.68166
Bodwin, Greg;Grandoni, Fabrizio;Parter, Merav;Vassilevska Williams, Virginia
2017
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. Zbl 07298290
Byrka, Jarosław;Grandoni, Fabrizio;Ameli, Afrouz Jabal
2020
Bounding the number of minimal dominating sets: A measure and conquer approach. Zbl 1175.05100
Fomin, Fedor V.;Grandoni, Fabrizio;Pyatkin, Artem V.;Stepanov, Alexey A.
2005
Faster replacement paths and distance sensitivity oracles. Zbl 1484.68056
Grandoni, Fabrizio;Vassilevska Williams, Virginia
2020
A primal-dual bicriteria distributed algorithm for capacitated vertex cover. Zbl 1187.68707
Grandoni, F.;Könemann, J.;Panconesi, A.;Sozio, M.
2008
Network design via core detouring for problems without a core. Zbl 1288.68013
Grandoni, Fabrizio;Rothvoß, Thomas
2010
Faster Steiner tree computation in polynomial-space. Zbl 1158.68429
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2008
Constant integrality gap LP formulations of unsplittable flow on a path. Zbl 1331.90086
Anagnostopoulos, Aris;Grandoni, Fabrizio;Leonardi, Stefano;Wiese, Andreas
2013
Approximation algorithms for single and multi-commodity connected facility location. Zbl 1341.90081
Grandoni, Fabrizio;Rothvoß, Thomas
2011
Iterative rounding for multi-objective optimization problems. Zbl 1256.90043
Grandoni, Fabrizio;Ravi, R.;Singh, Mohit
2009
Improved pseudo-polynomial-time approximation for strip packing. Zbl 1393.68189
Gálvez, Waldo;Grandoni, Fabrizio;Ingala, Salvatore;Khan, Arindam
2016
A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes. Zbl 1422.68298
Grandoni, Fabrizio;Mömke, Tobias;Wiese, Andreas;Zhou, Hang
2018
Optimal resilient dynamic dictionaries. Zbl 1151.68384
Brodal, Gerth Stølting;Fagerberg, Rolf;Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.;Jørgensen, Allan Grønlund;Moruz, Gabriel;Mølhave, Thomas
2007
Optimal resilient sorting and searching in the presence of memory faults. Zbl 1183.68230
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2009
To augment or not to augment: solving unsplittable flow on a path by creating slack. Zbl 1411.68188
Grandoni, Fabrizio;Mömke, Tobias;Wiese, Andreas;Zhou, Hang
2017
Approximating geometric knapsack via L-packings. Zbl 1545.68142
Gálvez, Waldo;Grandoni, Fabrizio;Ingala, Salvatore;Heydrich, Sandy;Khan, Arindam;Wiese, Andreas
2021
Dynamic set cover: improved algorithms and lower bounds. Zbl 1433.68616
Abboud, Amir;Addanki, Raghavendra;Grandoni, Fabrizio;Panigrahi, Debmalya;Saha, Barna
2019
Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product. Zbl 1421.68258
Bringmann, Karl;Grandoni, Fabrizio;Saha, Barna;Williams, Virginia Vassilevska
2019
Optimal resilient sorting and searching in the presence of memory faults. Zbl 1223.68033
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2006
Approximation schemes for multi-budgeted independence systems. Zbl 1287.90059
Grandoni, Fabrizio;Zenklusen, Rico
2010
Budgeted matching and budgeted matroid intersection via the Gasoline puzzle. Zbl 1143.90373
Berger, André;Bonifaci, Vincenzo;Grandoni, Fabrizio;Schäfer, Guido
2008
Improved approximation algorithms for stochastic matching. Zbl 1401.68359
Adamczyk, Marek;Grandoni, Fabrizio;Mukherjee, Joydeep
2015
Resilient search trees. Zbl 1302.68099
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2007
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. Zbl 1370.68231
Grandoni, Fabrizio;Laekhanukit, Bundit
2017
A linear time algorithm to list the minimal separators of chordal graphs. Zbl 1085.05058
Chandran, L. Sunil;Grandoni, Fabrizio
2006
The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm. Zbl 1452.90309
Cheriyan, J.;Dippel, J.;Grandoni, F.;Khan, A.;Narayan, V. V.
2020
New approaches for virtual private network design. Zbl 1140.68546
Eisenbrand, Friedrich;Grandoni, Fabrizio;Oriolo, Gianpaolo;Skutella, Martin
2007
Set covering with our eyes closed. Zbl 1275.68158
Grandoni, Fabrizio;Gupta, Anupam;Leonardi, Stefano;Miettinen, Pauli;Sankowski, Piotr;Singh, Mohit
2013
Improved approximation algorithms for unsplittable flow on a path with time windows. Zbl 1422.68297
Grandoni, Fabrizio;Ingala, Salvatore;Uniyal, Sumedha
2015
Computing optimal Steiner trees in polynomial space. Zbl 1269.05049
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter;Lokshtanov, Daniel;Saurabh, Saket
2013
Solving connected dominating set faster than \(2^{n}\). Zbl 1170.68545
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2006
Pricing on paths: a PTAS for the highway problem. Zbl 1377.90100
Grandoni, Fabrizio;Rothvoß, Thomas
2011
From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk. Zbl 1238.68188
Grandoni, Fabrizio;Rothvoß, Thomas;Sanità, Laura
2011
On min-power Steiner tree. Zbl 1365.68356
Grandoni, Fabrizio
2012
Tight kernel bounds for problems on graphs with small degeneracy. Zbl 1451.68137
Cygan, Marek;Grandoni, Fabrizio;Hermelin, Danny
2017
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. Zbl 1314.68156
Grandoni, F.;Könemann, J.;Panconesi, A.;Sozio, M.
2005
Tight kernel bounds for problems on graphs with small degeneracy (extended abstract). Zbl 1394.68173
Cygan, Marek;Grandoni, Fabrizio;Hermelin, Danny
2013
On conflict-free multi-coloring. Zbl 1444.05054
Bärtschi, Andreas;Grandoni, Fabrizio
2015
Resilient dictionaries. Zbl 1300.68020
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2009
On survivable set connectivity. Zbl 1371.68205
Chalermsook, Parinya;Grandoni, Fabrizio;Laekhanukit, Bundit
2015
Designing reliable algorithms in unreliable memories. Zbl 1302.68106
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2007
Pricing on paths: a PTAS for the highway problem. Zbl 1336.68294
Grandoni, Fabrizio;Rothvoß, Thomas
2016
An improved approximation algorithm for virtual private network design. Zbl 1297.68020
Eisenbrand, Friedrich;Grandoni, Fabrizio
2005
On the cycle augmentation problem: hardness and approximation algorithms. Zbl 1528.05066
Gálvez, Waldo;Grandoni, Fabrizio;Ameli, Afrouz Jabal;Sornat, Krzysztof
2020
Breaching the 2 LMP approximation barrier for facility location with applications to \(k\)-median. Zbl 07847997
Cohen-Addad Viallat, Vincent;Grandoni, Fabrizio;Lee, Euiwoong;Schwiegelshohn, Chris
2023
Distributed weighted vertex cover via maximal matchings. Zbl 1128.68401
Grandoni, Fabrizio;Könemann, Jochen;Panconesi, Alessandro
2005
Approximation algorithms for union and intersection covering problems. Zbl 1246.68262
Cygan, Marek;Grandoni, Fabrizio;Leonardi, Stefano;Mucha, Marcin;Pilipczuk, Marcin;Sankowski, Piotr
2011
28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Zbl 1445.68017
2020
On the cycle augmentation problem: hardness and approximation algorithms. Zbl 1473.05292
Gálvez, Waldo;Grandoni, Fabrizio;Jabal Ameli, Afrouz;Sornat, Krzysztof
2021
A path-decomposition theorem with applications to pricing and covering on trees. Zbl 1365.68350
Cygan, Marek;Grandoni, Fabrizio;Leonardi, Stefano;Pilipczuk, Marcin;Sankowski, Piotr
2012
Distributed weighted vertex cover via maximal matchings. Zbl 1445.68164
Grandoni, Fabrizio;Könemann, Jochen;Panconesi, Alessandro
2008
Maintaining an EDCS in general graphs: simpler, density-sensitive and with worst-case time bounds. Zbl 07848197
Grandoni, Fabrizio;Schwiegelshohn, Chris;Solomon, Shay;Uzrad, Amitai
2022
A mazing \(2+\epsilon\) approximation for unsplittable flow on a path. Zbl 1422.68278
Anagnostopoulos, Aris;Grandoni, Fabrizio;Leonardi, Stefano;Wiese, Andreas
2018
New approaches for virtual private network design. Zbl 1085.68005
Eisenbrand, Friedrich;Grandoni, Fabrizio;Oriolo, Gianpaolo;Skutella, Martin
2005
Designing reliable algorithms in unreliable memories. Zbl 1162.68307
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2005
8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8–10, 2016. Proceedings. Zbl 1351.68013
2016
Utilitarian mechanism design for multiobjective optimization. Zbl 1300.91034
Grandoni, Fabrizio;Krysta, Piotr;Leonardi, Stefano;Ventre, Carmine
2014
A tight \((3/2+\varepsilon)\) approximation for skewed strip packing. Zbl 07758346
Gálvez, Waldo;Grandoni, Fabrizio;Ameli, Afrouz Jabal;Jansen, Klaus;Khan, Arindam;Rau, Malin
2020
A refined approximation for Euclidean \(k\)-means. Zbl 1485.68268
Grandoni, Fabrizio;Ostrovsky, Rafail;Rabani, Yuval;Schulman, Leonard J.;Venkat, Rakesh
2022
Data structures resilient to memory faults: an experimental study of dictionaries. Zbl 1322.68061
Ferraro-Petrillo, Umberto;Grandoni, Fabrizio;Italiano, Giuseppe F.
2013
\((1 + \varepsilon)\)-approximate incremental matching in constant deterministic amortized time. Zbl 1432.68354
Grandoni, Fabrizio;Leonardi, Stefano;Sankowski, Piotr;Chris, Schwiegelshohn;Shay, Solomon
2019
All-pairs LCA in DAGs. Breaking through the \(O(n^{2.5})\) barrier. Zbl 07788356
Grandoni, Fabrizio;Italiano, Giuseppe F.;Łukasiewicz, Aleksander;Parotsidis, Nikos;Uznański, Przemysław
2021
Breaching the 2-approximation barrier for the forest augmentation problem. Zbl 07774441
Grandoni, Fabrizio;Ameli, Afrouz Jabal;Traub, Vera
2022
Approximation algorithms for demand strip packing. Zbl 07768365
Gálvez, Waldo;Grandoni, Fabrizio;Ameli, Afrouz Jabal;Khodamoradi, Kamyar
2021
Packing cars into narrow roads: PTASs for limited supply highway. Zbl 1548.68334
Grandoni, Fabrizio;Wiese, Andreas
2019
Stable routing under the Spanning Tree Protocol. Zbl 1202.90063
Grandoni, Fabrizio;Nicosia, Gaia;Oriolo, Gianpaolo;Sanità, Laura
2010
Utilitarian mechanism design for multi-objective optimization. Zbl 1288.90075
Grandoni, Fabrizio;Krysta, Piotr;Leonardi, Stefano;Ventre, Carmine
2010
A short proof of the VPN tree routing conjecture on ring networks. Zbl 1154.90334
Grandoni, Fabrizio;Kaibel, Volker;Oriolo, Gianpaolo;Skutella, Martin
2008
Sharp separation and applications to exact and parameterized algorithms. Zbl 1278.68232
Fomin, Fedor V.;Lokshtanov, Daniel;Grandoni, Fabrizio;Saurabh, Saket
2010
An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph. Zbl 1302.68317
Grandoni, Fabrizio;Kociumaka, Tomasz;Włodarczyk, Michał
2015
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. Zbl 07693610
Byrka, Jarosław;Grandoni, Fabrizio;Ameli, Afrouz Jabal
2023
Fully dynamic \((\Delta +1)\)-coloring in \(O(1)\) update time. Zbl 1547.68545
Bhattacharya, Sayan;Grandoni, Fabrizio;Kulkarni, Janardhan;Liu, Quanquan C.;Solomon, Shay
2022
Detecting directed 4-cycles still faster. Zbl 1175.68187
Eisenbrand, Friedrich;Grandoni, Fabrizio
2003
Unsplittable flow on a path: the game! Zbl 07883620
Grandoni, Fabrizio;Mömke, Tobias;Wiese, Andreas
2021
Online edge coloring algorithms via the nibble method. Zbl 07788506
Bhattacharya, Sayan;Grandoni, Fabrizio;Wajc, David
2021
Breaching the 2 LMP approximation barrier for facility location with applications to \(k\)-median. Zbl 07847997
Cohen-Addad Viallat, Vincent;Grandoni, Fabrizio;Lee, Euiwoong;Schwiegelshohn, Chris
2023
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. Zbl 07693610
Byrka, Jarosław;Grandoni, Fabrizio;Ameli, Afrouz Jabal
2023
Subcubic equivalences between graph centrality problems, APSP, and diameter. Zbl 07753154
Abboud, Amir;Grandoni, Fabrizio;Vassilevska Williams, Virginia
2023
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing. Zbl 07746794
Gálvez, Waldo;Grandoni, Fabrizio;Ameli, Afrouz Jabal;Jansen, Klaus;Khan, Arindam;Rau, Malin
2023
Maintaining an EDCS in general graphs: simpler, density-sensitive and with worst-case time bounds. Zbl 07848197
Grandoni, Fabrizio;Schwiegelshohn, Chris;Solomon, Shay;Uzrad, Amitai
2022
A refined approximation for Euclidean \(k\)-means. Zbl 1485.68268
Grandoni, Fabrizio;Ostrovsky, Rafail;Rabani, Yuval;Schulman, Leonard J.;Venkat, Rakesh
2022
Breaching the 2-approximation barrier for the forest augmentation problem. Zbl 07774441
Grandoni, Fabrizio;Ameli, Afrouz Jabal;Traub, Vera
2022
Fully dynamic \((\Delta +1)\)-coloring in \(O(1)\) update time. Zbl 1547.68545
Bhattacharya, Sayan;Grandoni, Fabrizio;Kulkarni, Janardhan;Liu, Quanquan C.;Solomon, Shay
2022
A PTAS for unsplittable flow on a path. Zbl 07774340
Grandoni, Fabrizio;Mömke, Tobias;Wiese, Andreas
2022
Approximating geometric knapsack via L-packings. Zbl 1545.68142
Gálvez, Waldo;Grandoni, Fabrizio;Ingala, Salvatore;Heydrich, Sandy;Khan, Arindam;Wiese, Andreas
2021
On the cycle augmentation problem: hardness and approximation algorithms. Zbl 1473.05292
Gálvez, Waldo;Grandoni, Fabrizio;Jabal Ameli, Afrouz;Sornat, Krzysztof
2021
All-pairs LCA in DAGs. Breaking through the \(O(n^{2.5})\) barrier. Zbl 07788356
Grandoni, Fabrizio;Italiano, Giuseppe F.;Łukasiewicz, Aleksander;Parotsidis, Nikos;Uznański, Przemysław
2021
Approximation algorithms for demand strip packing. Zbl 07768365
Gálvez, Waldo;Grandoni, Fabrizio;Ameli, Afrouz Jabal;Khodamoradi, Kamyar
2021
Unsplittable flow on a path: the game! Zbl 07883620
Grandoni, Fabrizio;Mömke, Tobias;Wiese, Andreas
2021
Online edge coloring algorithms via the nibble method. Zbl 07788506
Bhattacharya, Sayan;Grandoni, Fabrizio;Wajc, David
2021
Faster \((1+ \varepsilon)\)-approximation for unsplittable flow on a path via resource augmentation and back. Zbl 07740904
Grandoni, Fabrizio;Mömke, Tobias;Wiese, Andreas
2021
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. Zbl 07298290
Byrka, Jarosław;Grandoni, Fabrizio;Ameli, Afrouz Jabal
2020
Faster replacement paths and distance sensitivity oracles. Zbl 1484.68056
Grandoni, Fabrizio;Vassilevska Williams, Virginia
2020
The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm. Zbl 1452.90309
Cheriyan, J.;Dippel, J.;Grandoni, F.;Khan, A.;Narayan, V. V.
2020
On the cycle augmentation problem: hardness and approximation algorithms. Zbl 1528.05066
Gálvez, Waldo;Grandoni, Fabrizio;Ameli, Afrouz Jabal;Sornat, Krzysztof
2020
28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Zbl 1445.68017
2020
A tight \((3/2+\varepsilon)\) approximation for skewed strip packing. Zbl 07758346
Gálvez, Waldo;Grandoni, Fabrizio;Ameli, Afrouz Jabal;Jansen, Klaus;Khan, Arindam;Rau, Malin
2020
\(O(\log^2 k/\log\log k)\)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. Zbl 1433.68614
Grandoni, Fabrizio;Laekhanukit, Bundit;Li, Shi
2019
Oblivious dimension reduction for \(k\)-means: beyond subspaces and the Johnson-Lindenstrauss lemma. Zbl 1433.68324
Becchetti, Luca;Bury, Marc;Cohen-Addad, Vincent;Grandoni, Fabrizio;Schwiegelshohn, Chris
2019
Dynamic set cover: improved algorithms and lower bounds. Zbl 1433.68616
Abboud, Amir;Addanki, Raghavendra;Grandoni, Fabrizio;Panigrahi, Debmalya;Saha, Barna
2019
Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product. Zbl 1421.68258
Bringmann, Karl;Grandoni, Fabrizio;Saha, Barna;Williams, Virginia Vassilevska
2019
\((1 + \varepsilon)\)-approximate incremental matching in constant deterministic amortized time. Zbl 1432.68354
Grandoni, Fabrizio;Leonardi, Stefano;Sankowski, Piotr;Chris, Schwiegelshohn;Shay, Solomon
2019
Packing cars into narrow roads: PTASs for limited supply highway. Zbl 1548.68334
Grandoni, Fabrizio;Wiese, Andreas
2019
Parameterized approximation schemes for independent set of rectangles and geometric knapsack. Zbl 1548.68333
Grandoni, Fabrizio;Kratsch, Stefan;Wiese, Andreas
2019
Improved approximation for tree augmentation: saving by rewiring. Zbl 1429.68190
Grandoni, Fabrizio;Kalaitzis, Christos;Zenklusen, Rico
2018
A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes. Zbl 1422.68298
Grandoni, Fabrizio;Mömke, Tobias;Wiese, Andreas;Zhou, Hang
2018
A mazing \(2+\epsilon\) approximation for unsplittable flow on a path. Zbl 1422.68278
Anagnostopoulos, Aris;Grandoni, Fabrizio;Leonardi, Stefano;Wiese, Andreas
2018
Preserving distances in very faulty graphs. Zbl 1441.68166
Bodwin, Greg;Grandoni, Fabrizio;Parter, Merav;Vassilevska Williams, Virginia
2017
To augment or not to augment: solving unsplittable flow on a path by creating slack. Zbl 1411.68188
Grandoni, Fabrizio;Mömke, Tobias;Wiese, Andreas;Zhou, Hang
2017
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. Zbl 1370.68231
Grandoni, Fabrizio;Laekhanukit, Bundit
2017
Tight kernel bounds for problems on graphs with small degeneracy. Zbl 1451.68137
Cygan, Marek;Grandoni, Fabrizio;Hermelin, Danny
2017
When the optimum is also blind: a new perspective on universal optimization. Zbl 1441.68285
Adamczyk, Marek;Grandoni, Fabrizio;Leonardi, Stefano;Włodarczyk, Michał
2017
Improved pseudo-polynomial-time approximation for strip packing. Zbl 1393.68189
Gálvez, Waldo;Grandoni, Fabrizio;Ingala, Salvatore;Khan, Arindam
2016
Pricing on paths: a PTAS for the highway problem. Zbl 1336.68294
Grandoni, Fabrizio;Rothvoß, Thomas
2016
8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8–10, 2016. Proceedings. Zbl 1351.68013
2016
Online network design with outliers. Zbl 1348.68015
Anagnostopoulos, Aris;Grandoni, Fabrizio;Leonardi, Stefano;Sankowski, Piotr
2016
Subcubic equivalences between graph centrality problems, APSP and diameter. Zbl 1371.68203
Abboud, Amir;Grandoni, Fabrizio;Williams, Virginia Vassilevska
2015
Improved purely additive fault-tolerant spanners. Zbl 1465.68205
Bilò, Davide;Grandoni, Fabrizio;Gualà, Luciano;Leucci, Stefano;Proietti, Guido
2015
Improved approximation algorithms for stochastic matching. Zbl 1401.68359
Adamczyk, Marek;Grandoni, Fabrizio;Mukherjee, Joydeep
2015
Improved approximation algorithms for unsplittable flow on a path with time windows. Zbl 1422.68297
Grandoni, Fabrizio;Ingala, Salvatore;Uniyal, Sumedha
2015
On conflict-free multi-coloring. Zbl 1444.05054
Bärtschi, Andreas;Grandoni, Fabrizio
2015
On survivable set connectivity. Zbl 1371.68205
Chalermsook, Parinya;Grandoni, Fabrizio;Laekhanukit, Bundit
2015
An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph. Zbl 1302.68317
Grandoni, Fabrizio;Kociumaka, Tomasz;Włodarczyk, Michał
2015
New approaches to multi-objective optimization. Zbl 1297.90147
Grandoni, Fabrizio;Ravi, R.;Singh, Mohit;Zenklusen, Rico
2014
A mazing \(2+\varepsilon\) approximation for unsplittable flow on a path. Zbl 1422.68279
Anagnostopoulos, Aris;Grandoni, Fabrizio;Leonardi, Stefano;Wiese, Andreas
2014
Utilitarian mechanism design for multiobjective optimization. Zbl 1300.91034
Grandoni, Fabrizio;Krysta, Piotr;Leonardi, Stefano;Ventre, Carmine
2014
Steiner tree approximation via iterative randomized rounding. Zbl 1281.68234
Byrka, Jarosław;Grandoni, Fabrizio;Rothvoss, Thomas;Sanità, Laura
2013
How to sell hyperedges: the hypermatching assignment problem. Zbl 1425.90053
Cygan, Marek;Grandoni, Fabrizio;Mastrolilli, Monaldo
2013
On pairwise spanners. Zbl 1354.05131
Cygan, Marek;Grandoni, Fabrizio;Kavitha, Telikepalli
2013
Constant integrality gap LP formulations of unsplittable flow on a path. Zbl 1331.90086
Anagnostopoulos, Aris;Grandoni, Fabrizio;Leonardi, Stefano;Wiese, Andreas
2013
Set covering with our eyes closed. Zbl 1275.68158
Grandoni, Fabrizio;Gupta, Anupam;Leonardi, Stefano;Miettinen, Pauli;Sankowski, Piotr;Singh, Mohit
2013
Computing optimal Steiner trees in polynomial space. Zbl 1269.05049
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter;Lokshtanov, Daniel;Saurabh, Saket
2013
Tight kernel bounds for problems on graphs with small degeneracy (extended abstract). Zbl 1394.68173
Cygan, Marek;Grandoni, Fabrizio;Hermelin, Danny
2013
Data structures resilient to memory faults: an experimental study of dictionaries. Zbl 1322.68061
Ferraro-Petrillo, Umberto;Grandoni, Fabrizio;Italiano, Giuseppe F.
2013
Sharp separation and applications to exact and parameterized algorithms. Zbl 1236.68090
Fomin, Fedor V.;Grandoni, Fabrizio;Lokshtanov, Daniel;Saurabh, Saket
2012
On min-power Steiner tree. Zbl 1365.68356
Grandoni, Fabrizio
2012
A path-decomposition theorem with applications to pricing and covering on trees. Zbl 1365.68350
Cygan, Marek;Grandoni, Fabrizio;Leonardi, Stefano;Pilipczuk, Marcin;Sankowski, Piotr
2012
Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Zbl 1223.05222
Berger, André;Bonifaci, Vincenzo;Grandoni, Fabrizio;Schäfer, Guido
2011
Approximation algorithms for single and multi-commodity connected facility location. Zbl 1341.90081
Grandoni, Fabrizio;Rothvoß, Thomas
2011
Pricing on paths: a PTAS for the highway problem. Zbl 1377.90100
Grandoni, Fabrizio;Rothvoß, Thomas
2011
From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk. Zbl 1238.68188
Grandoni, Fabrizio;Rothvoß, Thomas;Sanità, Laura
2011
Approximation algorithms for union and intersection covering problems. Zbl 1246.68262
Cygan, Marek;Grandoni, Fabrizio;Leonardi, Stefano;Mucha, Marcin;Pilipczuk, Marcin;Sankowski, Piotr
2011
An improved LP-based approximation for Steiner tree. Zbl 1293.05039
Byrka, Jaroslaw;Grandoni, Fabrizio;Rothvoß, Thomas;Sanità, Laura
2010
Connected facility location via random facility sampling and core detouring. Zbl 1208.68236
Eisenbrand, Friedrich;Grandoni, Fabrizio;Rothvoß, Thomas;Schäfer, Guido
2010
Network design via core detouring for problems without a core. Zbl 1288.68013
Grandoni, Fabrizio;Rothvoß, Thomas
2010
Approximation schemes for multi-budgeted independence systems. Zbl 1287.90059
Grandoni, Fabrizio;Zenklusen, Rico
2010
Stable routing under the Spanning Tree Protocol. Zbl 1202.90063
Grandoni, Fabrizio;Nicosia, Gaia;Oriolo, Gianpaolo;Sanità, Laura
2010
Utilitarian mechanism design for multi-objective optimization. Zbl 1288.90075
Grandoni, Fabrizio;Krysta, Piotr;Leonardi, Stefano;Ventre, Carmine
2010
Sharp separation and applications to exact and parameterized algorithms. Zbl 1278.68232
Fomin, Fedor V.;Lokshtanov, Daniel;Grandoni, Fabrizio;Saurabh, Saket
2010
Online network design with outliers. Zbl 1287.68012
Anagnostopoulos, Aris;Grandoni, Fabrizio;Leonardi, Stefano;Sankowski, Piotr
2010
A measure & conquer approach for the analysis of exact algorithms. Zbl 1325.68311
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2009
Iterative rounding for multi-objective optimization problems. Zbl 1256.90043
Grandoni, Fabrizio;Ravi, R.;Singh, Mohit
2009
Optimal resilient sorting and searching in the presence of memory faults. Zbl 1183.68230
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2009
Resilient dictionaries. Zbl 1300.68020
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2009
Balanced cut approximation in random geometric graphs. Zbl 1175.68289
Diaz, Josep;Grandoni, Fabrizio;Marchetti Spaccamela, Alberto
2009
Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. Zbl 1445.05101
Fomin, Fedor V.;Grandoni, Fabrizio;Pyatkin, Artem V.;Stepanov, Alexey A.
2008
Solving connected dominating set faster than \(2^n\). Zbl 1170.68030
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2008
Approximating connected facility location problems via random facility sampling and core detouring. Zbl 1192.90103
Eisenbrand, Friedrich;Grandoni, Fabrizio;Rothvoß, Thomas;Schäfer, Guido
2008
A primal-dual bicriteria distributed algorithm for capacitated vertex cover. Zbl 1187.68707
Grandoni, F.;Könemann, J.;Panconesi, A.;Sozio, M.
2008
Faster Steiner tree computation in polynomial-space. Zbl 1158.68429
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2008
Budgeted matching and budgeted matroid intersection via the Gasoline puzzle. Zbl 1143.90373
Berger, André;Bonifaci, Vincenzo;Grandoni, Fabrizio;Schäfer, Guido
2008
Distributed weighted vertex cover via maximal matchings. Zbl 1445.68164
Grandoni, Fabrizio;Könemann, Jochen;Panconesi, Alessandro
2008
A short proof of the VPN tree routing conjecture on ring networks. Zbl 1154.90334
Grandoni, Fabrizio;Kaibel, Volker;Oriolo, Gianpaolo;Skutella, Martin
2008
Optimal resilient dynamic dictionaries. Zbl 1151.68384
Brodal, Gerth Stølting;Fagerberg, Rolf;Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.;Jørgensen, Allan Grønlund;Moruz, Gabriel;Mølhave, Thomas
2007
Resilient search trees. Zbl 1302.68099
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2007
New approaches for virtual private network design. Zbl 1140.68546
Eisenbrand, Friedrich;Grandoni, Fabrizio;Oriolo, Gianpaolo;Skutella, Martin
2007
Designing reliable algorithms in unreliable memories. Zbl 1302.68106
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2007
Measure and conquer: a simple \(O(2^{0.288n})\) independent set algorithm. Zbl 1192.68960
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2006
A note on the complexity of minimum dominating set. Zbl 1127.05070
Grandoni, Fabrizio
2006
Improved approximation for single-sink buy-at-bulk. Zbl 1135.90422
Grandoni, Fabrizio;Italiano, Giuseppe F.
2006
Optimal resilient sorting and searching in the presence of memory faults. Zbl 1223.68033
Finocchi, Irene;Grandoni, Fabrizio;Italiano, Giuseppe F.
2006
A linear time algorithm to list the minimal separators of chordal graphs. Zbl 1085.05058
Chandran, L. Sunil;Grandoni, Fabrizio
2006
Solving connected dominating set faster than \(2^{n}\). Zbl 1170.68545
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2006
Measure and conquer: Domination – a case study. Zbl 1082.68866
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2005
Some new techniques in design and analysis of exact (exponential) algorithms. Zbl 1169.68669
Fomin, Fedor V.;Grandoni, Fabrizio;Kratsch, Dieter
2005
...and 10 more Documents
alltop 5

Cited by 1,396 Authors

32 Grandoni, Fabrizio
31 Kratsch, Dieter
26 Liedloff, Mathieu
26 Saurabh, Saket
23 Fomin, Fedor V.
18 Gaspers, Serge
18 Xiao, Mingyu
17 Fernau, Henning
17 Nutov, Zeev
17 Paschos, Vangelis Th.
16 Vassilevska Williams, Virginia
16 Zehavi, Meirav
15 Abboud, Amir
15 Lingas, Andrzej
14 Zenklusen, Rico
13 Golovach, Petr A.
12 Bilò, Davide
12 Kortsarz, Guy
11 Bodwin, Greg
11 Jansen, Klaus
11 Kaski, Petteri
11 Leucci, Stefano
11 Lokshtanov, Daniel
11 Nagamochi, Hiroshi
11 Panolan, Fahad
11 Wiese, Andreas
10 Laekhanukit, Bundit
10 Shachnai, Hadas
9 Della Croce, Federico
9 Kowaluk, Mirosław
8 Escoffier, Bruno
8 Heggernes, Pinar
8 Khan, Arindam
8 Kobourov, Stephen G.
8 Komusiewicz, Christian
8 Ljubić, Ivana
8 Niedermeier, Rolf
8 Parter, Merav
8 Rau, Malin
8 Rossmanith, Peter
8 Spence, Richard
7 Ahmed, Reyan
7 Binkele-Raible, Daniel
7 Björklund, Andreas
7 Couturier, Jean-Francois
7 Cygan, Marek
7 Gualà, Luciano
7 Koivisto, Mikko
7 Kurpisz, Adam
7 Nagarajan, Viswanath
7 Olver, Neil
7 Ravi, Ramamoorthi
7 Sahneh, Faryad Darabi
7 Swamy, Chaitanya
7 van Rooij, Johan M. M.
7 Villanger, Yngve
6 Ameli, Afrouz Jabal
6 Bley, Andreas
6 Bourgeois, Nicolas
6 Calinescu, Gruia
6 Censor-Hillel, Keren
6 Choudhary, Keerti
6 Eiben, Eduard
6 Feldmann, Andreas Emil
6 Fukunaga, Takuro
6 Italiano, Giuseppe Francesco
6 Pilipczuk, Marcin L.
6 Sanità, Laura
5 Bazgan, Cristina
5 Chen, Jian-er
5 Emek, Yuval
5 Finocchi, Irene
5 Gálvez, Waldo
5 Gupta, Anupam
5 Inamdar, Tanmay C.
5 Koana, Tomohiro
5 Kobayashi, Yusuke
5 Könemann, Jochen
5 Kutten, Shay
5 Leonardi, Stefano
5 Marx, Dániel
5 Mömke, Tobias
5 Nichterlein, André
5 Pilipczuk, Michał
5 Proietti, Guido
5 Raman, Venkatesh
5 Rauch Henzinger, Monika
5 Salavatipour, Mohammad R.
5 Sankowski, Piotr
5 Sayadi, Mohamed Yosri
5 Woeginger, Gerhard
4 Bandyapadhyay, Sayan
4 Bliznets, Ivan A.
4 Bodlaender, Hans L.
4 Bonnet, Edouard
4 Branković, Ljiljana
4 Bringmann, Karl
4 Büsing, Christina
4 Chakrabarty, Deeparnab
4 Chepoi, Victor D.
...and 1,296 more Authors
alltop 5

Cited in 98 Serials

99 Algorithmica
82 Theoretical Computer Science
44 Discrete Applied Mathematics
27 Information Processing Letters
26 SIAM Journal on Computing
26 Journal of Combinatorial Optimization
25 Mathematical Programming. Series A. Series B
20 Theory of Computing Systems
17 Journal of Computer and System Sciences
17 SIAM Journal on Discrete Mathematics
15 Journal of Discrete Algorithms
14 Networks
14 Operations Research Letters
13 European Journal of Operational Research
13 ACM Transactions on Algorithms
11 Distributed Computing
7 Discrete Optimization
6 Mathematics of Operations Research
6 Annals of Operations Research
5 Information and Computation
5 International Journal of Foundations of Computer Science
5 INFORMS Journal on Computing
5 ACM Journal of Experimental Algorithmics
4 Discrete Mathematics
4 Computers \& Operations Research
4 Journal of the ACM
4 RAIRO. Operations Research
4 Optimization Letters
4 Journal of the Operations Research Society of China
4 Computer Science Review
3 Artificial Intelligence
3 Journal of Graph Theory
3 Journal of Global Optimization
3 The Journal of Analysis
3 Journal of Graph Algorithms and Applications
3 Discrete Mathematics, Algorithms and Applications
3 TheoretiCS
2 Applied Mathematics and Computation
2 Computational Geometry
2 International Journal of Computer Mathematics
2 The Journal of Artificial Intelligence Research (JAIR)
2 International Transactions in Operational Research
2 Mathematical Methods of Operations Research
2 Journal of Scheduling
2 4OR
2 Algorithms
2 Mathematical Programming Computation
1 Journal of Computational Physics
1 Journal of Mathematical Biology
1 Rocky Mountain Journal of Mathematics
1 Bulletin of Mathematical Biology
1 Computing
1 Information Sciences
1 Journal of the American Statistical Association
1 Journal of Econometrics
1 Journal of the Operations Research Society of Japan
1 Mathematics and Computers in Simulation
1 Operations Research
1 European Journal of Combinatorics
1 Combinatorica
1 Annals of Pure and Applied Logic
1 Optimization
1 Journal of Symbolic Computation
1 Discrete \& Computational Geometry
1 Asia-Pacific Journal of Operational Research
1 Journal of Parallel and Distributed Computing
1 Machine Learning
1 Random Structures \& Algorithms
1 International Journal of Computational Geometry \& Applications
1 Discrete Mathematics and Applications
1 SIAM Review
1 Computational Complexity
1 Computational Optimization and Applications
1 Journal of Mathematical Sciences (New York)
1 The Electronic Journal of Combinatorics
1 Sbornik: Mathematics
1 Data Mining and Knowledge Discovery
1 Journal of Discrete Mathematical Sciences \& Cryptography
1 Foundations of Computational Mathematics
1 Journal of Systems Science and Complexity
1 Journal of Machine Learning Research (JMLR)
1 OR Spectrum
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Journal of Applied Mathematics and Computing
1 Quantum Information Processing
1 Oberwolfach Reports
1 Journal of Industrial and Management Optimization
1 Mathematics in Computer Science
1 Logical Methods in Computer Science
1 European Journal of Pure and Applied Mathematics
1 Advances and Applications in Discrete Mathematics
1 Operational Research. An International Journal
1 Ars Mathematica Contemporanea
1 Science China. Mathematics
1 EURO Journal on Computational Optimization
1 ACM Transactions on Computation Theory
1 Computational Visual Media
1 SN Operations Research Forum
alltop 5

Cited in 19 Fields

732 Computer science (68-XX)
425 Combinatorics (05-XX)
332 Operations research, mathematical programming (90-XX)
30 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
11 Statistics (62-XX)
10 Linear and multilinear algebra; matrix theory (15-XX)
8 Information and communication theory, circuits (94-XX)
7 Biology and other natural sciences (92-XX)
5 Mathematical logic and foundations (03-XX)
4 Probability theory and stochastic processes (60-XX)
3 Algebraic geometry (14-XX)
3 Convex and discrete geometry (52-XX)
3 Quantum theory (81-XX)
1 General and overarching topics; collections (00-XX)
1 Order, lattices, ordered algebraic structures (06-XX)
1 Group theory and generalizations (20-XX)
1 Geometry (51-XX)
1 Algebraic topology (55-XX)
1 Statistical mechanics, structure of matter (82-XX)

Citations by Year

The data are displayed as stored in Wikidata under aCreative Commons CC0 License. Updates and corrections should be madein Wikidata.
© 2025FIZ Karlsruhe GmbHPrivacy PolicyLegal NoticesTerms & Conditions
  • Mastodon logo
 (opens in new tab)
[8]ページ先頭
©2009-2025 Movatter.jp